Optimization over the efficient set: Overview

Journal of Global Optimization

Volumn 22, Issue 1-4, 2002, Pages 285-317

  Yamamoto, Yoshitsugu ^a  

^a UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

Efficient set; Global optimization; Minimum maximal flow; Multicriteria programming

Indexed keywords

GLOBAL OPTIMIZATION;

ADJACENT VERTICES; BISECTION ALGORITHMS; EFFICIENT SETS; LAGRANGIAN RELAXATION; MAXIMAL FLOW; MULTICRITERIA PROBLEMS; MULTICRITERIA PROGRAMMING; NONADJACENT VERTICES;

LEARNING ALGORITHMS;

EID: 84938604116     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1023/a:1013875600711     Document Type: Article

References (45)

1. Al-Khayyal, F.A. and Falk, J.E. (1983), Jointly constrained biconvex programming. Mathematics of Operations Research8, 273–286
2. An, L.T.H., Tao, P.D. and Muu, L.D. (1996), Numerical solution for optimization over the efficient set by d.c. optimization algorithms. Operations Research Letters19, 117–128
3. Atteia, M. and El Qortobi, Quasi-convex duality. In Optimization and Optimal Control, Lecture Notes in Control and Information Science 35, Springer, Berlin, 1981, pp. 3–8
4. Benson, H.P. (1991), An all-linear programming relaxation algorithm for optimizing over the efficient set. Journal of Global Optimization1, 83–104
5. Benson, H.P. (1992), A finite nonadjacent extreme-point search algorithm for optimization over the efficient set. Journal of Optimization Theory and Applications73, 47–64
6. Benson, H.P. (1995), A geometric analysis of the efficient outcome set in multiple objective convex program with linear criteria functions. Journal of Global Optimization6, 213–251
7. Benson, H.P. and Lee, D. (1996), Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming. Journal of Optimization Theory and Applications88, 77–105
8. Benson, H.P. and Sayin, S. (1994), Optimization over the efficient set: four special case. Journal of Optimization Theory and Applications80, 3–18
9. Bolintineanu, S. (1993), Minimization of a quasi-concave function over an efficient set. Mathematical Programming61, 89–110
10. Chen, P.C., Hansen, P. and Jaumard, B. (1991), On-line and off-line vertex enumeration by adjacency lists. Operations Research Letters10, 403–409
11. Dauer, J.P. and Fosnaugh, T.A. (1995), Optimization over the efficient set. Journal of Global Optimization7, 261–277
12. Ecker, J.G. and Song, J.H. (1994), Optimizing a linear function over an efficient set. Journal of Optimization Theory and Applications83, 541–563
13. Fülöp, J. (1994), A cutting plane algorithm for linear optimization over the efficient set. In S. Komlösi, T. Rapcsàk and S. Shaible (eds.), Generalized Convexity, Lecture Notes in Economics and Mathematical Systems 405, Springer, Berlin, pp. 374–385
14. Garay, M.R. and Johnson, D.S. (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco
15. Horst, R., de Vries, J. and Thoai, N.V. (1988), On finding new vertices and redundant constraints in cutting plane algorithms for global optimization. Operations Research Letters7, 85–90
16. Horst, R. and Thoai, N.V. (1999), Maximizing a concave function over the efficient or weaklyefficient set. European Journal of Operational Research117, 239–252
17. Horst, R. and Tuy, H. (1996), Global Optimization: Deterministic Approach. Springer-Verlag, Berlin
18. Iri, M. (1994), An essay in the theory of uncontrollable flows and congestion. Technical Report, Department of Information and System Engineering, Faculty of Science and Engineering, Chuo University, TRISE 94-03
19. Iri, M. (1996), Network flow-theory and applications with practical impact. In J. Doležal and J. Fidler (eds.), System Modelling and Optimization, Chapman & Hall, London, 1996, pp. 24-36
20. Isermann, H. and Steuer, E. (1987), Computational experience concerning payoff tables and minimum criterion values over the efficient set. European Journal of Operational Research33, 91–97
21. Konno, H., Thach, P.T. and Tuy, H. (1997), Optimization on Low Rank Nonconvex Structures. Kluwer, Dordrecht
22. Muu, L.D. (2000), A convex-concave programming method for optimizing over the efficient set. Acta Mathematica Vietnamica 25(1), 67–85
23. Naccache, P.H. (1978), Connectedness of the set of nondominated outcomes in multicriteria optimization. Journal of Optimization Theory and Applications25, 459–467
24. Philip, J. (1972), Algorithms for the vector maximization problem. Mathematical Programming2, 207–229
25. Phong, T.Q. and Tuyen, J.Q. (2000), Bisection search algorithm for optimizing over the efficient set. to appear in Vietman Journal of Mathematics
26. Reeves, G.R. and Reid, C. (1988), Minimum values over the efficient set in multiple objective decision making. European Journal of Operational Research36, 334–338
27. Rockafellar, R.T. and Wets, R.J-B. (1998), Variational Analysis. Springer, Berlin
28. Sayin, S. (1996), An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming. Operations Research Letters19, 87–92
29. Sayin, S. (2000), Optimizing over the efficient set using a top-down search of faces. Operations Research48, 65–72
30. Sawaragi, Y., Nakayama, H. and Tanino, T. (1985), Theory ofMultiobjective Optimization. Academic Press, Orland.
31. Shi, J.M. and Yamamoto, Y. (1997), A global optimization method for minimum maximal flow problem. Acta Mathematica Vietnamica22, 271-287
32. Steuer, R.E. (1985), Multiple Criteria Optimization: Theory, Computation and Application. Wiley, New York.
33. Steuer, R.E. (1995), Manual for the ADBASE multiple objective linear programming package. Department of Management Science and Information Technology, University of Georgia
34. Stoer, J. and Witzgall, C. (1970), Convexity and Optimization in Finite Dimensions I. Springer- Verlag, Berlin.
35. Thach, P.T. (1991), Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraints and quasiconvex maximization under a cnvex constraint, and applications. Journal of Mathematical Analysis and Applications159, 299–322
36. Thach, P.T., (1993), Global optimality criterion and a duality with a zero gap in nonconvex optimization. SIAM Journal on Mathematical Analysis24, 1537–1556
37. Thach, P.T. (1994), A nonconvex duality with zero gap and applications. SIAM Journal on Optimization4, 44–64
38. Thach, P.T., Konno, H. and Yokota, D. (1996), Dual approach to nminimization on the set of paretooptimal solutions. Journal of Optimization Theory and Applications88, 689–707
39. Thieu, T.V., Tam, B.T. and Ban, V.T. (1983), An outer-approximation method for globally minimizing a concave function over a compact convex set. Acta Mathematica Vietnamica8, 21–40
40. Thoai, N.V. (2000), A class of optimization problems over the efficient set of a multiple criteria nonlinear programming problem. European Journal of Operational Research122, 58–68
41. Thoai, N.V. (2001), Conical algorithm in global optimization for optimizing over efficient sets Journal of Global Optimization, 18, 321–336
42. Tuy, H. (1998), Convex Analysis and Global Optimization. Kluwer, Dordrecht
43. White, D.J. (1982), Optimality and Efficiency. John Wiley & Sons, Chichester
44. White, D.J. (1996), The maximization of a function over the efficient set via a penalty function approach, European Journal of Operational Research94, 143–153
45. Yamada, S., Tanino, T. and Inuiguchi, M. (2000), An inner approximation method for optimization over the weakly efficient set. Journal of Global Optimization16, 197–217