On sufficiency and duration in nonsmooth multiobjective programming.
From MaRDI portal
Recommendations
- Sufficiency and duality in nondifferentiable multiobjective programming
- scientific article; zbMATH DE number 1135672
- On nonsmooth multiobjective programming with generalized univexity
- scientific article; zbMATH DE number 751236
- Optimality conditions for efficiency on nonsmooth multiobjective programming problems
Cites work
- Duality theorem of nondifferentiable convex multiobjective programming
- Duality without constraint qualification for multiobjective programming
- scientific article; zbMATH DE number 3904354 (Why is no real title available?)
- scientific article; zbMATH DE number 3756249 (Why is no real title available?)
- Invex functions and constrained local minima
- Necessary and sufficient conditions in constrained optimization
- On generalised convex mathematical programming
- On generalised convex multi-objective nonsmooth programming
- On sufficiency of the Kuhn-Tucker conditions in nondifferentiable programming
- Optimization and nonsmooth analysis
- Proper efficiency and the theory of vector maximization
- Sufficiency and duality in nondifferentiable multiobjective programming
Cited in
(6)- Nondifferentiable multiobjective programming under generalized d-univexity
- scientific article; zbMATH DE number 3948017 (Why is no real title available?)
- scientific article; zbMATH DE number 1135672 (Why is no real title available?)
- scientific article; zbMATH DE number 1501184 (Why is no real title available?)
- scientific article; zbMATH DE number 751236 (Why is no real title available?)
- Some nondifferentiable multiobjective programming problems
This page was built for publication: On sufficiency and duration in nonsmooth multiobjective programming.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2468559)
