Duality and Farkas-type results for DC fractional programming with DC constraints
From MaRDI portal
Publication:552120
DOI10.1016/J.MCM.2010.11.059zbMATH Open1217.90152OpenAlexW1971121476MaRDI QIDQ552120FDOQ552120
Authors: Haijun Wang, Cao-zong Cheng 
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
Recommendations
- Some Farkas-type results for fractional programming problems with DC functions
- Farkas-type results for fractional programming problems
- Duality and Farkas-type results for DC infinite programming with inequality constraints
- Farkas-type results for constrained fractional programming with DC functions
- Characterizations of Farkas lemmas for a class of fractional optimization with DC functions
Numerical mathematical programming methods (65K05) Fractional programming (90C32) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- On Nonlinear Fractional Programming
- Title not available (Why is that?)
- Regularity Conditions via Quasi-Relative Interior in Convex Programming
- Duality in D. C. programming: The case of several D. C. constraints
- A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
- Farkas-type results and duality for DC programs with convex constraints
- A comparison of constraint qualifications in infinite-dimensional convex programming revisited
- Duality in nonlinear fractional programming
- Some new Farkas-type results for inequality systems with DC functions
- New constraint qualification and conjugate duality for composed convex optimization problems
- On minimax fractional optimality and duality with generalized convexity
- Duality in Fractional Programming: A Unified Approach
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
- Duality for multiobjective optimization problems with convex objective functions and D.C. constraints
- Farkas-type results for inequality systems with composed convex functions via conjugate duality
- Some Farkas-type results for fractional programming problems with DC functions
- Farkas-type results for fractional programming problems
- Farkas-Type Results With Conjugate Functions
- Duality for nonconvex approximation and optimization.
- Programming Problems with Convex Fractional Functions
Cited In (13)
- Farkas' lemma: three decades of generalizations for mathematical optimization
- Characterizations of Farkas lemmas for a class of fractional optimization with DC functions
- Duality and Farkas-type results for DC infinite programming with inequality constraints
- Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions
- Some dual characterizations of Farkas-type results for fractional programming problems
- Some characterizations of robust optimal solutions for uncertain fractional optimization and applications
- Optimality conditions for a DC fractional programming problem
- Farkas-type results for constrained fractional programming with DC functions
- On robust duality for fractional programming with uncertainty data
- Duality and Farkas-type results for extended Ky Fan inequalities with DC functions
- Some Farkas-type results for fractional programming problems with DC functions
- Extended Farkas lemma and strong duality for composite optimization problems with DC functions
- An approach to fractional programming via d.c. constraints problem: local search
This page was built for publication: Duality and Farkas-type results for DC fractional programming with DC constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q552120)
