Sequential optimality conditions for multiobjective fractional programming problems
From MaRDI portal
Publication:2512875
DOI10.1007/s40096-014-0128-3zbMath1308.90164OpenAlexW2038106124WikidataQ59321178 ScholiaQ59321178MaRDI QIDQ2512875
Publication date: 30 January 2015
Published in: Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40096-014-0128-3
sequential optimality conditionsmultiobjective fractional programming problem\(\varepsilon\)-subdifferentialssequential duality
Related Items
Sequential approximate weak optimality conditions for multiobjective fractional programming problems via sequential calculus rules for the Brøndsted-Rockafellar approximate subdifferential, Sequential optimality conditions of approximate proper efficiency for a multiobjective fractional programming problem
Cites Work
- Nonconvex separation theorems and some applications in vector optimization
- Liberating the subgradient optimality conditions from constraint qualifications
- \(\varepsilon\)-optimality criteria for convex programming problems via exact penalty functions
- Approximate necessary conditions for locally weak Pareto optimality
- Lagrange multipliers and saddle points in multiobjective programming
- \(\varepsilon\)-optimality criteria for vector minimization problems via exact penalty functions
- Asymptotic dual conditions characterizing optimality for infinite convex programs
- A fuzzy approach using generalized Dinkelbach's algorithm for multiobjective linear fractional transportation problem
- Epsilon approximate solutions for multiobjective programming problems
- Inequality systems and global optimization
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- Proper efficiency and the theory of vector maximization
- Proper Efficiency in Nonconvex Multicriteria Programming
- Necessary conditions for ε-optimality
- ε-Optimal solutions in nondifferentiable convex programming and some related questions
- ε-approximate solutions in multiobjective optimization
- Optimality conditions for multiobjecttve and nonsmooth minimisation in abstract spaces
- Variational Analysis
- Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Penalty functions in ε-programming and ε-minimax problems
- Sequential Lagrange multiplier condition forϵ-optimal solution in convex programming
