论文信息 - Necessary and sufficient conditions for the efficient solutions of nondifferentiable multiobjective problems

Necessary and sufficient conditions for the efficient solutions of nondifferentiable multiobjective problems

The necessary conditions for the efficient solutions of multiobjective problems with locally Lipschitz objective and constraint functions are presented. Under the assumption of convexity, these conditions are also sufficient conditions. For its application, the optimality conditions for the multiobjective problems including extremal-value functions are obtained. The necessary conditions are derived by means of the generalized Motzkin's lemma and are expressed in terms of Clarke's generalized gradients (1975).

Kiyotaka Shimizu | Yo Ishizuka

[1] R. Mifflin. Semismooth and Semiconvex Functions in Constrained Optimization , 1977 .

[2] W. Schmitendorf. Necessary conditions and sufficient conditions for static minmax problems , 1977 .

[3] F. Clarke. Generalized gradients and applications , 1975 .

[4] K. R. Gehner,et al. Necessary and Sufficient Optimality Conditions for the Fritz John Problem with Linear Equality Constraints , 1974 .

[5] P. Yu. Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives , 1974 .

[6] J. Gauvin,et al. Differential properties of the marginal function in mathematical programming , 1982 .

[7] J. Danskin. The Theory of Max-Min, with Applications , 1966 .

[8] Generalized Farkas' theorem and optimization of infinitely constrained problems , 1983 .

[9] K. Schittkowski,et al. NONLINEAR PROGRAMMING , 2022 .

[10] Jean-Baptiste Hiriart-Urruty,et al. On optimality conditions in nondifferentiable programming , 1978, Math. Program..

[11] A. M. Geoffrion. Proper efficiency and the theory of vector maximization , 1968 .

[12] Frank H. Clarke,et al. A New Approach to Lagrange Multipliers , 1976, Math. Oper. Res..

[13] E. Aiyoshi,et al. Necessary conditions for min-max problems and algorithms by a relaxation procedure , 1980 .