Duality without constraint qualification for multiobjective programming

DOI10.1017/S0334270000007219zbMath0764.90073MaRDI QIDQ4009935

T. Weir, Richard R Egudo, Bertram Mond

Publication date: 27 September 1992

Published in: The Journal of the Australian Mathematical Society. Series B. Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

duality resultsgeneralized convex multiobjective programs

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Duality theory (optimization) (49N15)

Related Items

Optimality and duality without a constraint qualification for minimax programming ⋮ On sufficiency and duration in nonsmooth multiobjective programming. ⋮ Duality without constraint qualification in nonsmooth optimization ⋮ Mixed duality without a constraint qualification for minimax fractional programming ⋮ Duality without a constraint qualification for minimax fractional programming ⋮ Duality and Lagrange multipliers for nonsmooth multiobjective programming