Sufficiency and duality in nondifferentiable multiobjective programming
From MaRDI portal
Publication:1182076
zbMath0755.90071MaRDI QIDQ1182076
Publication date: 27 June 1992
Published in: Opsearch (Search for Journal in Brave)
weak and strong duality theoremssubgradientsproperly efficient solutionsnondifferentiable multiobjective programming
Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Duality theory (optimization) (49N15)
Related Items (5)
On Efficiency in Nondifferentiable Multiobjective Optimization Involving Pseudo d-Univex Functions; Duality ⋮ Pseudoinvexity, optimality conditions and efficiency in multiobjective problems; duality ⋮ On sufficiency and duration in nonsmooth multiobjective programming. ⋮ Duality for nonsmooth multiobjective fractional programs under generalized \((F,\rho)\)-convexity. ⋮ Nondifferentiable multiobjective symmetric dual programs over cones
This page was built for publication: Sufficiency and duality in nondifferentiable multiobjective programming
