Some dual characterizations of Farkas-type results for fractional programming problems
From MaRDI portal
Publication:1670547
DOI10.1007/s11590-017-1196-8zbMath1396.90084OpenAlexW2752792064MaRDI QIDQ1670547
Xian-Jun Long, Xiang-Kai Sun, Ming Hua Li, Li-Ping 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
Related Items
Unnamed Item ⋮ On robust approximate optimal solutions for fractional semi-infinite optimization with uncertainty data
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Duality and Farkas-type results for DC infinite programming with inequality constraints
- Stable strong and total parametrized dualities for DC optimization problems in locally convex spaces
- Farkas-type results for constrained fractional programming with DC functions
- Duality and Farkas-type results for DC fractional programming with DC constraints
- On robust duality for fractional programming with uncertainty data
- Functional inequalities and theorems of the alternative involving composite functions
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- Optimality conditions, duality and saddle points for nondifferentiable multiobjective fractional programs
- Some Farkas-type results for fractional programming problems with DC functions
- Conjugate duality in convex optimization
- Further generalizations of Farkas' theorem and their applications in optimal control
- Duality and saddle-point type optimality for generalized nonlinear fractional programming.
- Convex analysis and nonlinear optimization. Theory and examples
- Symmetric duality for a class of nonlinear fractional programming problems
- Symmetric duality for a class of multiobjective fractional programming problems.
- Duality and Farkas-type results for extended Ky Fan inequalities with DC functions
- Sequential optimality conditions for fractional optimization with applications to vector optimization
- Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
- Farkas-type results for fractional programming problems
- Necessary and sufficient conditions for stable conjugate duality
- Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
- Results of farkas type
- Fractional Programming. II, On Dinkelbach's Algorithm
- Farkas-Type results for general composed convex optimization problems with inequality constraints
- On Nonlinear Fractional Programming
