Sufficiency and duality in nondifferentiable multiobjective programming
From MaRDI portal
Recommendations
Cited in
(23)- Duality theorem of nondifferentiable convex multiobjective programming
- 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,)-convexity.
- Sufficiency and duality in nondifferentiable multiobjective programming involving generalized type I functions
- On sufficiency and duality for generalised quasicnvex nonsmooth programs
- Conic efficiency and duality in nondifferentiable multiobjective mathematical programming
- On efficiency in nondifferentiable multiobjective optimization involving pseudo d-univex functions; duality
- Necessary and sufficient conditions for the efficient solutions of nondifferentiable multiobjective problems
- scientific article; zbMATH DE number 3910154 (Why is no real title available?)
- Saddlepoint Theory for Nondifferentiable Multiobjective Fractional Programming
- Subgradient Duality Using jFritz John Conditions
- Duality for a Class of Nondifferentiable Multiple Objective Programming Problems
- scientific article; zbMATH DE number 633408 (Why is no real title available?)
- scientific article; zbMATH DE number 1791759 (Why is no real title available?)
- scientific article; zbMATH DE number 761894 (Why is no real title available?)
- scientific article; zbMATH DE number 853072 (Why is no real title available?)
- Fritz John's type conditions and associated duality forms in convex non differentiable vector-optimization
- New sufficiency for global optimality and duality of nonlinear multi-objective programming problems via underestimators
- scientific article; zbMATH DE number 2201818 (Why is no real title available?)
- Nondifferentiable multiobjective symmetric dual programs over cones
- Duality in nondifferentiable vector programming
- Asymptotic sign-solvability, multiple objective linear programming, and the nonsubstitution theorem
This page was built for publication: Sufficiency and duality in nondifferentiable multiobjective programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1182076)