Optimization over the efficient set using an active constraint approach. (English) Zbl 0734.90081

Summary: The problem of maximizing a nonlinear objective over the set of efficient solutions of a multicriteria linear program is considered. This is a nonlinear program with nonconvex constraints. The approach is to develop an active constraint algorithm which utilizes the fact that the efficient structure in decision space can be associated in a natural way with hyperplanes in the space of objective values. Examples and numerical experience are included.


90C29 Multi-objective and goal programming
Full Text: DOI


[1] Benson HP (1984) Optimization over the efficient set. J Math Anal Appl 98:562-580 · Zbl 0534.90077
[2] Chankong V, Haimes YY (1983) Multiobjective Decision Making: Theory and Methodology. North-Holland Publishers, Amsterdam · Zbl 0622.90002
[3] Dauer JP (1980) An equivalence result for solutions of multiobjective linear programs. Comp Options Res 7:33-39
[4] Dauer JP (1987) Analysis of the objective space in multiple objective linear programming. J Math Anal and Appl 126:579-593 · Zbl 0631.90071
[5] Dauer JP, Krueger RJ (1980) A multiobjective optimization model for water resources planning. Appl Math Modelling 4:171-175 · Zbl 0438.90045
[6] Dauer JP, Liu Y-H (1990) Solving multiple objective linear programs in objective space. Eur J Oper Res 46:350-357 · Zbl 0712.90063
[7] Dauer JP, Saleh OA (1990) Constructing the set of efficient objective values in multiple objective linear programs. Eur J Oper Res 46:358-365 · Zbl 0706.90071
[8] Dauer JP, Saleh OA (1989) A representation of the set of feasible objetives in multiple objective linear programs. Lin Alg and Appl, to appear
[9] Dessouky M, Ghiassi M, Davis W (1986) Estimates of the minimum nondominated criterion values in multiple-criteria decision-making. Eng Costs Prod Econ 10:95-104
[10] Ecker JG, Kouada IA (1975) Finding efficient points for linear multiple objective programs. Math Progr 8:373-377
[11] Ecker JG, Hegner NS (1978) On computing an initial efficient extreme point. J Oper Res Soc 29:1005-1007 · Zbl 0385.90104
[12] Ecker JG, Hegner NS, Kouada IA (1980) Generating all maximal efficient faces for multiple objective linear programs. J Optim Theory Appl 30:353-381 · Zbl 0393.90087
[13] Fletcher R (1987) Practical methods of Optimization. Wiley, New York · Zbl 0905.65002
[14] Gill PE, Murray W (eds) (1974) Numerical Methods for Constrained Optimization. Academic Press, New York · Zbl 0297.90082
[15] Gill PE, Murray W (1978a) Modification of matrix factorizations after rank-one change. In: Jacobs DAH (ed) The State of the Art in Numerical Analysis. Academic Press, London
[16] Gill PE, Murray W (1978b) Numerically stable methods for quadratic programming. Math Progr 14:349-372 · Zbl 0374.90054
[17] Gill PE, Murray W, Saunders MA, Wright MH (1984) Sparse matrix methods in optimization. SIAM J Scient and Statistic Computing 5:562-589 · Zbl 0559.65042
[18] Gill PE, Murray W, Saunders MA, Wright MH (1989) Constrained nonlinear programming. In: Nemhauser GL, Rinnooy Kan AHG, Todd MJ (eds) Optimization. Handbooks in Operations Research and Management Science. Vol 1. North Holland, New York, 171-210
[19] Hwang CL, Masud ASM (1979) Multiple Objective Decision Making and Applications. Springer, New York
[20] Isermann H, Steuer R (1987) Computational experience concerning payoff tables and minimum criterion values over the efficient set. Eur J Oper Res 33:91-97 · Zbl 0632.90074
[21] Keeney RL, Raiffa H (1975) Decision with Multiple Objectives: Preferences and Value Tradeoffs. Wiley, New York
[22] McCormick GP (1972) Attempts to calculate global solutions of problems that may have local minima. In: Lootsma FA (ed) Numerical Methods for Nonlinear Optimization. Academic Press, New York, pp 209-221
[23] Murray W, Wright MH (1982) Computation of the search direction in constrained optimization algorithms. Math Progr Study 16:62-83 · Zbl 0477.90070
[24] Murtagh BA, Saunders MA (1978) Large-scale linearly constrained optimization. Math Progr 14:41-72 · Zbl 0383.90074
[25] Philip J (1972) Algorithms for the vector-maximization problem. Math Prog 2:459-467 · Zbl 0288.90052
[26] ]Ratschek H, Rokne J (1988) New Computer Methods for Global Optimization. Halsted Press, New York · Zbl 0648.65049
[27] Reeves G, Reid R (1988) Minimum values over the efficient set in multiple objective decision making. Eur J Oper Res 36:334-338
[28] Rhode R, Weber R (1984) The range of the efficient frontier in multiple objective linear programming. Math Prog 28:84-95 · Zbl 0526.90080
[29] Rockafellar RT (1970) Convex Analysis. Princeton University Press, Princeton, NJ · Zbl 0193.18401
[30] Sawaragi Y, Nakayama H, Tanino (1985) Theory of Multiobjective Optimization. Academic Press, New York · Zbl 0566.90053
[31] Schittowski K (1988) Solving constrained nonlinear least squares problems by a general purpose SQP-method. In: Hoffmann K-H, Hiriart-Urruty J-B, Lemarechal C, Zowe J (eds) Trends in Mathematical Optimization. Birkhauser Verlag, Boston, pp 295-309
[32] Steuer R (1986) Multiple Criteria Optimization. Wiley, New York · Zbl 0663.90085
[33] Weistroffer HR (1985) Careful usage of pessimistic values is needed in multiple objective optimization. Oper Res Letters 4/1:23-25 · Zbl 0569.90087
[34] White DJ (1982) Optimality and Efficiency. Wiley, New York · Zbl 0561.90087
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.