The maximization of a function over the efficient set via a penalty function approach

European Journal of Operational Research

Volumn 94, Issue 1, 1996, Pages 143-153

  White, D J ^a  

^a University of Virginia   (United States)

Author keywords

Efficient set; Mathematical programming; Optimization; Penalty functions

Indexed keywords

FUNCTIONS; MATHEMATICAL PROGRAMMING; SET THEORY; THEOREM PROVING;

EFFICIENT SET; EPSILON EFFICIENCY; OBJECTIVE FUNCTIONS; PENALTY FUNCTION APPROACH;

OPTIMIZATION;

EID: 0042093547     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(95)00184-0     Document Type: Article

References (23)

1. Anandalingam, G., and White, D.J., "A solution method for the linear Stackelberg problem using penalty functions", IEEE Transactions on Automatic Control 35 (1990) 1170-1173.
2. Benson, H.P., "An algorithm for optimizing over the weakly efficient set", European Journal of Operational Research 25 (1986) 192-199.
3. Benson, H.P., "Optimizing over the efficient set", Journal of Mathematical Analysis and Applications 98 (1984) 562-580.
4. Benson, H.P., "An all-linear programming relaxation algorithm for optimizing over the efficient set", Journal of Global Optimization 1 (1991) 83-104.
5. Falk, J.E., "A linear max-min problem", Mathematical Programming 5 (1973) 169-188.
6. Gallo, G., and Ülkücü, A., "Bilinear programming: An exact algorithm", Mathematical Programming 12 (1977) 173-194.
7. Geoffrion, A.M., Perspectives on Optimization, Addison-Wesley, London, 1972.
8. Geoffrion, A.M., "Proper efficiency and the theory of vector maximization", Journal of Mathematical Analysis and Applications 22 (1968) 618-630.
9. Horst, R., Phong, T.Q., Thoai, Ng.V., and de Vries, J., "On solving a d.c. programming problem by a sequence of linear programs", Journal of Global Optimization 1 (1991) 183-203.
10. Isermann, H., and Steuer, R.E., "Computational experience concerning payoff tables and minimum criterion values over the efficient set", European Journal of Operational Research 33 (1987) 91-97.
11. Konno, H., "A cutting plane algorithm for solving bilinear programs", Mathematical Programming 11 (1976) 14-27.
12. Philip, J., "Algorithms for the vector maximization problem", Mathematical Programming 2 (1972) 207-229.
13. Sherali, H.D., and Shetty, C.M., "A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts", Mathematical Programming 19 (1980) 14-31.
14. Stoer, J., and Witzgall, C., Convexity and Optimization in Finite Dimensions, I, Springer-Verlag, Berlin, 1970.
15. Thieu, T.V., "A note on the solution of bilinear programming problems by reduction to concave minimization", Mathematical Programming 41 (1988) 249-260.
16. White, D.J., and Scherer, W.T., "A systems engineering design experiment at the University of Virginia", in: Proceedings of the National Council of Systems Engineering, Annual Conference, Seattle, Washington, 1992 527-533.
17. White, D.J., Optimality and Efficiency, Wiley, Chichester, 1982.
18. White, D.J., "A linear programming approach to solving bilinear programmes", Mathematical Programming 56 (1992) 45-60.
19. White, D.J., "Finite horizon Markov decision processes with uncertain terminal payoffs", Operations Research 43 (1995) 862-869.
20. White, D.J., "On a Markov decision problem and maximizing the difference between two functions", Journal of Information and Optimisation Sciences 16 (1995) 429-435.
21. White, D.J., "Solving bi-level linear programmes", 1993; Journal of Mathematical Analysis and Applications, to appear.
22. White, D.J., "Epsilon efficiency", Journal of Optimization Theory and Applications 49 (1986) 319-337.
23. Zangwill, W.I. Nonlinear Programming, Prentice-Hall, Englewood Cliffs, NJ, 1969.