Some dual characterizations of Farkas-type results for fractional programming problems

DOI10.1007/S11590-017-1196-8zbMATH Open1396.90084OpenAlexW2752792064MaRDI QIDQ1670547FDOQ1670547

X. J. Long, X. K. Sun, Ming-Hua Li, Liping Tang

Publication date: 5 September 2018

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-017-1196-8

Recommendations

• Some Farkas-type results for fractional programming problems with DC functions
• Farkas-type results for fractional programming problems
• Regularity conditions and Farkas-type results for systems with fractional functions
• Duality and Farkas-type results for DC fractional programming with DC constraints
• Farkas-type results for constrained fractional programming with DC functions

zbMATH Keywords

dualityfractional programming problemFarkas-type resultsalternative type theorems

Mathematics Subject Classification ID

Convex programming (90C25) Fractional programming (90C32)

Cites Work

• On Nonlinear Fractional Programming
• Conjugate duality in convex optimization
• Title not available (Why is that?)
• Title not available (Why is that?)
• Convex analysis and nonlinear optimization. Theory and examples
• Fractional Programming. II, On Dinkelbach's Algorithm
• Complete characterizations of stable Farkas' lemma and cone-convex programming duality
• Optimality conditions, duality and saddle points for nondifferentiable multiobjective fractional programs
• Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
• Duality and Farkas-type results for DC infinite programming with inequality constraints
• Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
• On robust duality for fractional programming with uncertainty data
• Necessary and sufficient conditions for stable conjugate duality
• Symmetric duality for a class of multiobjective fractional programming problems.
• Stable strong and total parametrized dualities for DC optimization problems in locally convex spaces
• Duality and Farkas-type results for DC fractional programming with DC constraints
• Duality and Farkas-type results for extended Ky Fan inequalities with DC functions
• Results of farkas type
• Farkas-Type results for general composed convex optimization problems with inequality constraints
• Title not available (Why is that?)
• Functional inequalities and theorems of the alternative involving composite functions
• Some Farkas-type results for fractional programming problems with DC functions
• Duality and saddle-point type optimality for generalized nonlinear fractional programming.
• Symmetric duality for a class of nonlinear fractional programming problems
• Farkas-type results for fractional programming problems
• Farkas-type results for constrained fractional programming with DC functions
• Further generalizations of Farkas' theorem and their applications in optimal control
• Sequential optimality conditions for fractional optimization with applications to vector optimization

Cited In (4)

• Farkas-type results for fractional programming problems
• Title not available (Why is that?)
• On robust approximate optimal solutions for fractional semi-infinite optimization with uncertainty data
• Title not available (Why is that?)

This page was built for publication: Some dual characterizations of Farkas-type results for fractional programming problems

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