Class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem

European Journal of Operational Research

Volumn 122, Issue 1, 2000, Pages 58-68

  Thoai, Nguyen V ^a  

^a UNIVERSITY OF TRIER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DECISION THEORY; NONLINEAR PROGRAMMING; PROBLEM SOLVING;

MULTIPLE CRITERIA NONLINEAR PROGRAMMING; OUTER APPROXIMATION ALGORITHMS;

OPERATIONS RESEARCH;

EID: 0033906483     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00068-5     Document Type: Article

References (19)

1. Benson H.P. Optimization over the efficient set. Journal of Mathematical Analysis and Applications. 98:1984;562-580.
2. Benson H.P., Sayin S. Optimization over the efficient set: Four special cases. Journal of Optimization Theory and Applications. 80:1994;3-18.
3. Bolintineanu S. Minimization of a quasiconcave function over an efficient set. Mathematical Programming. 61:1993;89-110.
4. Chen P.C., Hansen P., Jaumard B. On-line and off-line vertex enumeration by adjacency lists. Operations Research Letters. 10:1991;403-409.
5. Dauer J.P., Fosnaugh T.A. Optimization over the efficient set. Journal of Global Optimization. 7:1995;261-277.
6. J. Fülöp, A cutting plane algorithm for linear optimization over the efficient set, generalized convexity, in: S. Komlösi, T. Rapcsàk, S. Schaible (Eds.), Lecture Notes in Economics and Mathematical Systems 405, Springer, Berlin, 1994, pp. 374-385.
7. R. Horst, P.M. Pardalos, N.V. Thoai, Introduction to Global Optimization, Kluwer, Dordrecht, The Netherlands, 1995.
8. R. Horst, N.V. Thoai, Maximizing a concave function over the efficient or weakly-efficient set, European Journal of Operational Research, forthcoming.
9. Horst R., Thoai N.V. Utility function programs and optimization over the efficient set in multiple-objective decision making. Journal of Optimization Theory and Applications. 92:1997;605-631.
10. Horst R., Thoai N.V., Tuy H. Outer approximation by polyhedral convex sets. Operations Research Spektrum. 9:1987;153-159.
11. Horst R., Thoai N.V., de Vries J. On finding new vertices and redundant constraints in cutting plane algorithms for global optimization. Operations Research Letters. 7:1988;85-90.
12. J.E. Kelley, The cutting plane method for solving convex programs, J. Soc. Industrial Appl. Math. (SIAM) 8 (1960) 703-712.
13. Muu L.D. Computational aspect of optimization problems over the efficient set. Vietnam Journal of Mathematics. 23:1995;83-105.
14. Philip J. Algorithms for the vector maximization problem. Mathematical Programming. 2:1972;207-229.
15. Reeves G.R., Reid R.C. Minimum values over the efficient set in multiple objective decision making. European Journal of Operational Research. 36:1988;334-338.
16. R.E. Steuer, Multiple Criteria Optimization: Theory, Computation and Application, Wiley, New York, 1985.
17. Thoai N.V. A global optimization approach for solving the convex multiplicative programming problem. Journal of Global Optimization. 1:1991;341-357.
18. Weistroffer H.R. Careful use of pessimistic values is needed in multiple objectives optimization. Operations Research Letters. 4:1985;23-25.
19. P.L. Yu, Multiple Criteria Decision Making: Concepts, Techniques and Extensions, Plenum, New York, 1985.