论文信息 - Necessary conditions for nonlinear suboptimization over the weakly-efficient set

Necessary conditions for nonlinear suboptimization over the weakly-efficient set

The optimization problem of a nonlinear real function over the weakly-efficient set associated to a nonlinear multi-objective program is examined. Necessary first-order conditions for a suboptimal solution are proposed, assuming the convexity of the multi-objective program. Estimations of the optimal value are established and an algorithm for finding suboptimal solutions is proposed. The optimal value is approximated to any prescribed degree of accuracy using a weakly-efficient suboptimal solution.

S. Bolintinéanu | S. Bolintineanu

[1] S. Bolintineanu,et al. Minimization of a quasi-concave function over an efficient set , 1993, Math. Program..

[2] H. P. Benson,et al. An algorithm for optimizing over the weakly-efficient set , 1986 .

[3] K. Jittorntrum. Solution point differentiability without strict complementarity in nonlinear programming , 1984 .

[4] David G. Luenberger,et al. Linear and nonlinear programming , 1984 .

[5] Jerald P. Dauer,et al. Optimization over the efficient set using an active constraint approach , 1991, ZOR Methods Model. Oper. Res..

[6] Harold P. Benson,et al. An all-linear programming relaxation algorithm for optimizing over the efficient set , 1991, J. Glob. Optim..

[7] H. P. Benson,et al. A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set , 1992 .

[8] W. Stadler,et al. A survey of vector optimization in infinite-dimensional spaces, part 2 , 1986 .

[9] H. P. Benson,et al. Optimization over the efficient set , 1984 .

[10] Johan Philip,et al. An Algorithm for Combined Quadratic and Multiobjective Programming , 1976 .

[11] Johan Philip,et al. Algorithms for the vector maximization problem , 1972, Math. Program..