Linear optimization with bipolar max-min constraints
Linear optimization with bipolar max-min constraints
复制标题
DOI：
10.1016/j.ins.2011.06.009
复制
发表时间：
2013-06
期刊：
影响因子：
--
通讯作者：
Steven Freson;B. Baets;H. Meyer
中科院分区：
文献类型：
--
作者：
Steven Freson;B. Baets;H. Meyer
我们考虑一个泛化的线性优化问题，模糊关系（中）的等式约束，允许双极最大-最小的约束，即约束中，不仅独立的变量，而且他们的否定发生。给出了可行域非空的一个必要条件。可行域，如果不是空的，代数特征。一个简单的程序来生成所有的线性优化问题的最大化考虑，并适用于各种说明性的例子问题。
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.