On sufficiency and duration in nonsmooth multiobjective programming.

DOI10.1007/BF03398527MaRDI QIDQ2468559zbMATH OpenOpenAlexFDO

Authors S. K. Mishra

Publication date 25 January 2008

Published in Opsearch (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf03398527

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Duality theory (optimization) (49N15)

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

• scientific article; zbMATH DE number 3904354 (Why is no real title available?)
• scientific article; zbMATH DE number 3756249 (Why is no real title available?)
• Duality theorem of nondifferentiable convex multiobjective programming
• Duality without constraint qualification for multiobjective programming
• 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

(3)

• Some nondifferentiable multiobjective programming problems
• Nondifferentiable multiobjective programming under generalized d-univexity
• scientific article; zbMATH DE number 3948017 (Why is no real title available?)

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)