Duality without constraint qualification for multiobjective programming
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 12754
- Duality for generalized convex multiobjective programming without a constraint qualification
- scientific article; zbMATH DE number 232392
- scientific article; zbMATH DE number 14317
- Duality for multiobjective optimization problem with vanishing constraints
- Duality without constraint qualification in nonsmooth optimization
- scientific article; zbMATH DE number 2159410
- Duality in multiobjective programming
- scientific article; zbMATH DE number 1552795
- scientific article; zbMATH DE number 3858876
Cited in
(10)- Duality without a constraint qualification for minimax fractional programming
- Duality for generalized convex multiobjective programming without a constraint qualification
- On sufficiency and duration in nonsmooth multiobjective programming.
- Duality without constraint qualification in nonsmooth optimization
- scientific article; zbMATH DE number 3847230 (Why is no real title available?)
- Duality and Lagrange multipliers for nonsmooth multiobjective programming
- scientific article; zbMATH DE number 12754 (Why is no real title available?)
- Mixed duality without a constraint qualification for minimax fractional programming
- Optimality and duality without a constraint qualification for minimax programming
- scientific article; zbMATH DE number 232392 (Why is no real title available?)
This page was built for publication: Duality without constraint qualification for multiobjective programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4009935)