Optimality of a class of generalized convex multi-objective fractional programming approximate weak efficient solutions

DOI10.13764/J.CNKI.NCDL.2020.02.002MaRDI QIDQ3386008zbMATH OpenFDO

Authors Wenyan Han, Guolin Yu

Publication date 14 January 2021

zbMATH Keywords

optimality conditionssaddle pointgeneralized convex functionmulti-objective fractional programmingapproximate weak efficient solution

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29) Fractional programming (90C32) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• Optimality conditions and saddle point theorems of approximate quasi weak efficient solutions for robust multi-objective programming
• Optimality conditions for multi-objective fractional programming with a new formulation of generalized convexity
• Efficient conditions of solution for fractional multiobjective programming
• Multi-objective fractional programming with \((\alpha,\rho)\)-\((\eta,\theta)\)-convexity
• Efficiency conditions and duality for a class of multiobjective fractional programming problems

Cited in

(10)

• A sublinear functional based approximated equivalence to optimality and duality for multiobjective programming in complex spaces
• Weakly fuzzy efficient conditions for multiobjective fractional programming problem
• APPROXIMATE EFFICIENCY FOR n-SET MULTIOBJECTIVE FRACTIONAL PROGRAMMING
• Sequential approximate weak optimality conditions for multiobjective fractional programming problems via sequential calculus rules for the Brøndsted-Rockafellar approximate subdifferential
• Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem
• Optimality conditions and saddle point theorems of approximate quasi weak efficient solutions for robust multi-objective programming
• Weak \(\epsilon\)-efficiency conditions for multiobjective fractional programming
• Multi-criteria optimization problems with fractional objectives: approximate optimality and approximate duality
• Generalizations of Isermann's results in multiobjective fractional optimization problem
• Efficient conditions of solution for fractional multiobjective programming

This page was built for publication: Optimality of a class of generalized convex multi-objective fractional programming approximate weak efficient solutions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3386008)