Duality for a Class of Nondifferentiable Multiple Objective Programming Problems

DOI10.1080/02522667.1988.10698934zbMath0657.90093OpenAlexW2008161398MaRDI QIDQ3807010

M. V. Durga Prasad, I. Husain, Bertram Mond

Publication date: 1988

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1988.10698934

zbMATH Keywords

properly efficient solutionsprimal and dual problemsstrong duality theoremsnondifferentiable multiple objective programming

Mathematics Subject Classification ID

Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Duality theory (optimization) (49N15)

Related Items (8)

Higher-order duality results for a new class of nonconvex nonsmooth multiobjective programming problems ⋮ Duality in nonlinear multiobjective programming using augmented Lagrangian functions ⋮ Duality for multiobjective variational problems ⋮ Second order duality for nondifferentiable multiobjective programming problem involving \((F, \alpha , \rho , d)-V\)-type I functions ⋮ Generalized type I invexity and duality in multiobjective variational problems ⋮ Duality and exact penalization for vector optimization via augmented Lagrangian ⋮ Duality for multiobjective control problems with generalized invexity ⋮ Duality relations for second-order programming problem under (G,αf)-bonvexity assumptions

Cites Work

• A class of nondifferentiable mathematical programming problems
• Proper efficiency and the theory of vector maximization
• An optimality condition for a nondifferentiable convex program
• Generalized concavity and duality with a square root term

This page was built for publication: Duality for a Class of Nondifferentiable Multiple Objective Programming Problems