Maximizing a concave function over the efficient or weakly-efficient set
Authors:
- Reiner HorstRHReiner Horst
- Nguyen V. ThoaiNTNguyen V. Thoai
- 1 September 1999
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 117 (2) , 239-252
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problemJournal of Optimization Theory and Applications, 1996
- Optimization over the efficient setJournal of Global Optimization, 1995
- A geometrical analysis of the efficient outcome set in multiple objective convex programs with linear criterion functionsJournal of Global Optimization, 1995
- Minimization of a quasi-concave function over an efficient setMathematical Programming, 1993
- Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problemsJournal of Optimization Theory and Applications, 1992
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient setJournal of Optimization Theory and Applications, 1992
- Concave minimization via conical partitions and polyhedral outer approximationMathematical Programming, 1991
- An all-linear programming relaxation algorithm for optimizing over the efficient setJournal of Global Optimization, 1991
- Optimization over the efficient setJournal of Mathematical Analysis and Applications, 1984
- Algorithms for the vector maximization problemMathematical Programming, 1972