Conic efficiency and duality in nondifferentiable multiobjective mathematical programming
From MaRDI portal
Recommendations
- Efficiency and generalized convex duality for nondifferentiable multiobjective programs
- Sufficiency and duality in nondifferentiable multiobjective programming
- scientific article; zbMATH DE number 633408
- Nondifferentiable higher order duality in multiobjective programming involving cones
- Higher-order duality in nondifferentiable multiobjective fractional programming involving cones
Cited in
(8)- A reduced formulation for pseudoinvex vector functions
- On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives
- scientific article; zbMATH DE number 446504 (Why is no real title available?)
- Introducing nonpolyhedral cones to multiobjective programming
- scientific article; zbMATH DE number 853072 (Why is no real title available?)
- On a weakly C-\epsilon-vector saddle point approach in weak vector problems
- Optimality conditions for differentiable linearly constrained pseudoconvex programs
- Efficiency and generalized convex duality for nondifferentiable multiobjective programs
This page was built for publication: Conic efficiency and duality in nondifferentiable multiobjective mathematical programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2789083)
