Mixed Duality without Constraint Qualification for Nonsmooth Fractional Programming

DOI10.1080/01630560701766692MaRDI QIDQ5438286zbMATH OpenOpenAlexFDO

Authors S. Nobakhtian

Publication date 23 January 2008

Published in Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/01630560701766692

zbMATH Keywords

constraint qualificationmixed dualitynonsmooth analysisnonsmooth multiobjective fractional programmingoptimality conditions

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Fractional programming (90C32)

Recommendations

• Mixed duality without a constraint qualification for minimax fractional programming
• scientific article; zbMATH DE number 2156835
• scientific article; zbMATH DE number 232392
• scientific article; zbMATH DE number 4193476
• Optimality and duality for nonsmooth multiobjective fractional programming with mixed constraints
• Duality without a constraint qualification for minimax fractional programming
• scientific article; zbMATH DE number 2162238
• The mixed dual for a class of nonsmooth programming problems
• Mixed type duality for a nondifferentiable minimax fractional complex programming
• scientific article; zbMATH DE number 6747209

Cites work

• A Multiplier Rule for Multiobjective Programming Problems with Continuous Data
• Duality without a constraint qualification for minimax fractional programming
• Duality without constraint qualification in nonsmooth optimization
• Generalised convexity and duality in multiple objective programming
• scientific article; zbMATH DE number 1113627 (Why is no real title available?)
• Mixed duality without a constraint qualification for minimax fractional programming
• Nondifferentiable multiobjective programming under generalized d-univexity
• Optimality and Duality for Invex Nonsmooth Multiobjective programming problems
• Optimality and duality for multiobjective fractional programming involving nonsmooth pseudoinvex functions
• Optimality and duality for multiobjective fractional programming involving nonsmooth(si:Fesi:ρ)–convex functions
• Optimality and duality for nonsmooth multiobjective fractional programming with generalized invexity
• Optimality and duality for the multiobjective fractional programming with the generalized (F,) convexity.
• Optimality and duality in fractional multiple objective programming involving semilocally preinvex and related functions.
• Optimality conditions and duality in subdifferentiable multiobjective fractional programming
• Optimality Conditions in Directionally Differentiable Pareto Problems with a Set Constraint via Tangent Cones
• Optimization and nonsmooth analysis

Cited in

(6)

• Duality without a constraint qualification for minimax fractional programming
• Duality without constraint qualification in nonsmooth optimization
• Mixed duality without a constraint qualification for minimax fractional programming
• scientific article; zbMATH DE number 2156835 (Why is no real title available?)
• scientific article; zbMATH DE number 232392 (Why is no real title available?)
• On multiobjective fractional programs with vanishing constraints

This page was built for publication: Mixed Duality without Constraint Qualification for Nonsmooth Fractional Programming

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