Some dual characterizations of Farkas-type results for fractional programming problems
From MaRDI portal
(Redirected from Publication:1670547)
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
Cites work
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 3465097 (Why is no real title available?)
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- Conjugate duality in convex optimization
- Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming
- Convex analysis and nonlinear optimization. Theory and examples
- Duality and Farkas-type results for DC fractional programming with DC constraints
- 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
- Duality and saddle-point type optimality for generalized nonlinear fractional programming.
- Farkas-type results for constrained fractional programming with DC functions
- Farkas-type results for fractional programming problems
- Farkas-type results for general composed convex optimization problems with inequality constraints
- Fractional Programming. II, On Dinkelbach's Algorithm
- Functional inequalities and theorems of the alternative involving composite functions
- Further generalizations of Farkas' theorem and their applications in optimal control
- Necessary and sufficient conditions for Farkas' Lemma for cone systems and second-order cone programming duality
- Necessary and sufficient conditions for stable conjugate duality
- On Nonlinear Fractional Programming
- On robust duality for fractional programming with uncertainty data
- 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
- Results of farkas type
- Sequential optimality conditions for fractional optimization with applications to vector optimization
- Some Farkas-type results for fractional programming problems with DC functions
- Stable strong and total parametrized dualities for DC optimization problems in locally convex spaces
- Symmetric duality for a class of multiobjective fractional programming problems.
- Symmetric duality for a class of nonlinear fractional programming problems
Cited in
(6)- On robust approximate optimal solutions for fractional semi-infinite optimization with uncertainty data
- Farkas-type results for fractional programming problems
- Some Farkas-type results for fractional programming problems with DC functions
- scientific article; zbMATH DE number 7317464 (Why is no real title available?)
- scientific article; zbMATH DE number 7108075 (Why is no real title available?)
- Farkas-type results for constrained fractional programming with DC functions
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)
