On \(\varepsilon\)-optimality conditions for multiobjective fractional optimization problems
From MaRDI portal
Publication:1952121
DOI10.1186/1687-1812-2011-6zbMath1270.90063OpenAlexW2108239222WikidataQ59269977 ScholiaQ59269977MaRDI QIDQ1952121
Gwi Soo Kim, Gue Myung Lee, Moon Hee Kim
Publication date: 27 May 2013
Published in: Fixed Point Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/1687-1812-2011-6
multiobjective fractional optimization problem\(\varepsilon\)-optimality conditionweakly \(\varepsilon\)-efficient solution
Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32)
Related Items
Higher Order Hybrid Invexity Frameworks and Discrete Multiobjective Fractional Programming Problems, Sequential optimality conditions of approximate proper efficiency for a multiobjective fractional programming problem, Optimality conditions for generalized convex nonsmooth uncertain multi-objective fractional programming, Role of \((\rho , \eta , A)\)-invexity to \(\varepsilon \)-optimality conditions for multiple objective fractional programming, Unnamed Item, Unnamed Item, Generalized hybrid \(B-(b, \rho, \theta, \tilde{p}, \tilde{r})\)-invexities and efficiency conditions for multiobjective fractional programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Liberating the subgradient optimality conditions from constraint qualifications
- \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints
- \(\epsilon\)-solutions in vector minimization problems
- Theory of multiobjective optimization
- Asymptotic dual conditions characterizing optimality for infinite convex programs
- Epsilon approximate solutions for multiobjective programming problems
- \(\varepsilon\)-optimality for multiobjective programming on a Banach space
- \(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- On \(\varepsilon\)-approximate solutions for convex semidefinite optimization problems
- Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems
- Characterizations of solution sets of convex vector minimization problems
- An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces∗
- Necessary conditions for ε-optimality
- ε-Optimal solutions in nondifferentiable convex programming and some related questions
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Convex Analysis
