An approach to generating all efficient solutions for multiple objective programs with piecewise linear objective functions and linear constraints is presented. The approach is based on the decomposition of the feasible set into subsets, referred to as cells, so that the original problem reduces to
โฆ LIBER โฆ
Linear programming with multiple objective functions: Step method (stem)
โ Scribed by R. Benayoun; J. de Montgolfier; J. Tergny; O. Laritchev
- Publisher
- Springer-Verlag
- Year
- 1971
- Tongue
- English
- Weight
- 340 KB
- Volume
- 1
- Category
- Article
- ISSN
- 0025-5610
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Multiple objective programming with piec
โ
Stefan Nickel; Margaret M. Wiecek
๐
Article
๐
1999
๐
John Wiley and Sons
๐
English
โ 135 KB
Programming with fractional linear objec
โ
H. C. Joksch
๐
Article
๐
1964
๐
John Wiley and Sons
๐
English
โ 319 KB
Fuzzy programming and linear programming
โ
H.-J. Zimmermann
๐
Article
๐
1978
๐
Elsevier Science
๐
English
โ 559 KB
On multiple objective programming proble
โ
J.H Chou; Wei-Shen Hsia; Tan-Yu Lee
๐
Article
๐
1985
๐
Elsevier Science
๐
English
โ 515 KB
An interactive method for multiple objec
โ
Joรฃo Paulo Costa
๐
Article
๐
2005
๐
Springer
๐
German
โ 144 KB
On computing objective function values i
โ
Pekka Korhonen; GuangYuan Yu
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 439 KB
In this paper, we will consider the computation of objective function values when a nondominated frontier is searched in multiple objective quadratic-linear programming (MOQLP). Reference directions and weighted-sums constitute a methodological basis for the search. This idea leads to a parametric l