Duality and Farkas-type results for DC fractional programming with DC constraints
From MaRDI portal
Publication:552120
DOI10.1016/j.mcm.2010.11.059zbMath1217.90152OpenAlexW1971121476MaRDI QIDQ552120
Publication date: 21 July 2011
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2010.11.059
Numerical mathematical programming methods (65K05) Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32)
Related Items
Some characterizations of robust optimal solutions for uncertain fractional optimization and applications ⋮ Some dual characterizations of Farkas-type results for fractional programming problems ⋮ Duality and Farkas-type results for extended Ky Fan inequalities with DC functions ⋮ Extended Farkas lemma and strong duality for composite optimization problems with DC functions ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ Farkas-type results for constrained fractional programming with DC functions ⋮ On robust duality for fractional programming with uncertainty data
Cites Work
- Unnamed Item
- Unnamed Item
- Duality for multiobjective optimization problems with convex objective functions and D.C. constraints
- Some new Farkas-type results for inequality systems with DC functions
- Some Farkas-type results for fractional programming problems with DC functions
- Duality in D. C. programming: The case of several D. C. constraints
- On minimax fractional optimality and duality with generalized convexity
- Farkas-type results for fractional programming problems
- New constraint qualification and conjugate duality for composed convex optimization problems
- Duality for nonconvex approximation and optimization.
- Farkas-type results for inequality systems with composed convex functions via conjugate duality
- A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
- Regularity Conditions via Quasi-Relative Interior in Convex Programming
- Duality in Fractional Programming: A Unified Approach
- A comparison of constraint qualifications in infinite-dimensional convex programming revisited
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
- Farkas-Type Results With Conjugate Functions
- On Nonlinear Fractional Programming
- Programming Problems with Convex Fractional Functions
- Duality in nonlinear fractional programming
