Linear optimization with bipolar max-min constraints

  • Authors:
  • S. Freson;B. De Baets;H. De Meyer

  • Affiliations:
  • Department of Applied Mathematics and Computer Science, Ghent University, Krijgslaan 281 S9, B-9000 Gent, Belgium;Department of Applied Mathematics, Biometrics and Process Control, Ghent University, Coupure links 653, B-9000 Gent, Belgium;Department of Applied Mathematics and Computer Science, Ghent University, Krijgslaan 281 S9, B-9000 Gent, Belgium

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2013

Quantified Score

Hi-index 0.07

Visualization

Abstract

We consider a generalization of the linear optimization problem with fuzzy relational (in)equality constraints by allowing for bipolar max-min constraints, i.e. constraints in which not only the independent variables but also their negations occur. A necessary condition to have a non-empty feasible domain is given. The feasible domain, if not empty, is algebraically characterized. A simple procedure is described to generate all maximizers of the linear optimization problem considered and is applied to various illustrative example problems.