Duality and Farkas-type results for DC fractional programming with DC constraints

DOI10.1016/J.MCM.2010.11.059MaRDI QIDQ552120zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

fractional programmingDC functionsFarkas-type resultsconjugate dualityDC constraints

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Fractional programming (90C32) Optimality conditions and duality in mathematical programming (90C46)

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

Cites work

• scientific article; zbMATH DE number 3320765 (Why is no real title available?)
• A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
• A comparison of constraint qualifications in infinite-dimensional convex programming revisited
• Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
• Duality for multiobjective optimization problems with convex objective functions and D.C. constraints
• Duality for nonconvex approximation and optimization.
• Duality in D. C. programming: The case of several D. C. constraints
• Duality in Fractional Programming: A Unified Approach
• Duality in nonlinear fractional programming
• Farkas-Type Results With Conjugate Functions
• Farkas-type results and duality for DC programs with convex constraints
• Farkas-type results for fractional programming problems
• Farkas-type results for inequality systems with composed convex functions via conjugate duality
• New constraint qualification and conjugate duality for composed convex optimization problems
• On Nonlinear Fractional Programming
• On minimax fractional optimality and duality with generalized convexity
• Programming Problems with Convex Fractional Functions
• Regularity Conditions via Quasi-Relative Interior in Convex Programming
• Some Farkas-type results for fractional programming problems with DC functions
• Some new Farkas-type results for inequality systems with DC functions

Cited in

(13)

• Extended Farkas lemma and strong duality for composite optimization problems with DC functions
• Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions
• Duality and Farkas-type results for DC infinite programming with inequality constraints
• Duality and Farkas-type results for extended Ky Fan inequalities with DC functions
• Some characterizations of robust optimal solutions for uncertain fractional optimization and applications
• Some Farkas-type results for fractional programming problems with DC functions
• Farkas' lemma: three decades of generalizations for mathematical optimization
• An approach to fractional programming via d.c. constraints problem: local search
• On robust duality for fractional programming with uncertainty data
• Some dual characterizations of Farkas-type results for fractional programming problems
• Optimality conditions for a DC fractional programming problem
• Farkas-type results for constrained fractional programming with DC functions
• Characterizations of Farkas lemmas for a class of fractional optimization with DC functions

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)