Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 0577.90077
Lai, H.C.; Ho, C.P.
Duality theorem of nondifferentiable convex multiobjective programming. (English)
[J] J. Optimization Theory Appl. 50, 407-420 (1986). ISSN 0022-3239; ISSN 1573-2878/e

Necessary and sufficient conditions of Fritz-John type for Pareto optimality of multiobjective programming problems are derived. This article suggests to establish a Wolfe-type duality theorem for nonlinear, nondifferentiable, convex multiobjective minimization problems. The vector Lagrangian and the generalized saddle point for Pareto optimality are studied. Some previously known results are shown to be special cases of the results described in this paper.

MSC 2000:: *90C31 Sensitivity, etc.
90C25 Convex programming
49N15 Duality theory (optimization)
90C55 Methods of successive quadratic programming type
49K10 Free problems in several independent variables (nec./ suff.)

Keywords: Pareto optimality; multiobjective programming; duality; nonlinear nondifferentiable convex multiobjective minimization; generalized saddle point; optimality conditions

Cited in: Zbl 0689.90067

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]