Duality without constraint qualification in nonsmooth optimization

DOI10.1155/IJMMS/2006/30459MaRDI QIDQ2468970zbMATH OpenFDO

Authors S. Nobakhtian

Publication date 1 February 2008

Published in International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/55960

Mathematics Subject Classification ID

Duality theory (optimization) (49N15) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Review text

Summary: We are concerned with a nonsmooth multiobjective optimization problem with inequality constraints. In order to obtain our main results, we give the definitions of the generalized convex functions based on the generalized directional derivative. Under the above generalized convexity assumptions, sufficient and necessary conditions for optimality are given without the need of a constraint qualification. Then we formulate the dual problem corresponding to the primal problem, and some duality results are obtained without a constraint qualification.

Recommendations

• Mixed Duality without Constraint Qualification for Nonsmooth Fractional Programming
• Duality and Lagrange multipliers for nonsmooth multiobjective programming
• Generalized (F, )-convexity and duality in nonsmooth problems of multiobjective optimization
• Optimality and duality for a class of nonsmooth optimization problems
• On duality for nonsmooth Lipschitz optimization problems

Cites work

• A duality theorem for non-linear programming
• Duality without constraint qualification for multiobjective programming
• scientific article; zbMATH DE number 417962 (Why is no real title available?)
• scientific article; zbMATH DE number 3934789 (Why is no real title available?)
• scientific article; zbMATH DE number 4010155 (Why is no real title available?)
• scientific article; zbMATH DE number 12754 (Why is no real title available?)
• scientific article; zbMATH DE number 1113627 (Why is no real title available?)
• On optimality conditions in nonsmooth inequality constrained minimization
• Optimization and nonsmooth analysis
• The Fritz John necessary optimality conditions in the presence of equality and inequality constraints

Cited in

(11)

• Generalized (F, )-convexity and duality in nonsmooth problems of multiobjective optimization
• Optimality and duality for nonsmooth optimization.
• scientific article; zbMATH DE number 3934789 (Why is no real title available?)
• scientific article; zbMATH DE number 3970543 (Why is no real title available?)
• Duality without constraint qualification for multiobjective programming
• scientific article; zbMATH DE number 1552795 (Why is no real title available?)
• scientific article; zbMATH DE number 2156835 (Why is no real title available?)
• Optimality and duality without a constraint qualification for minimax programming
• Mixed Duality without Constraint Qualification for Nonsmooth Fractional Programming
• On duality theorems for nonsmooth Lipschitz optimization problems
• Optimality and Duality for Nonsmooth Optimization Problems with Switching Constraints

This page was built for publication: Duality without constraint qualification in nonsmooth optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2468970)