Sequential optimality conditions of approximate proper efficiency for a multiobjective fractional programming problem
From MaRDI portal
Publication:6067531
DOI10.1007/s40324-022-00308-yOpenAlexW4298071376WikidataQ114219218 ScholiaQ114219218MaRDI QIDQ6067531
Mohamed Laghdir, I. Dali, M. B. Moustaid
Publication date: 14 December 2023
Published in: S\(\vec{\text{e}}\)MA Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40324-022-00308-y
sequential optimality conditionsmultiobjective fractional programming problemapproximate proper efficient solution
Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32)
Cites Work
- Unnamed Item
- Farkas-type results for constrained fractional programming with DC functions
- Liberating the subgradient optimality conditions from constraint qualifications
- \(\varepsilon\)-optimality and duality for multiobjective fractional programming
- \(\varepsilon\)-properly efficient solutions to nondifferentiable multiobjective programming problems
- On \(\varepsilon\)-optimality conditions for multiobjective fractional optimization problems
- Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data
- Sequential approximate weak optimality conditions for multiobjective fractional programming problems via sequential calculus rules for the Brøndsted-Rockafellar approximate subdifferential
- Sequential optimality conditions for fractional optimization with applications to vector optimization
- Sequential \(\varepsilon\)-subdifferential calculus for scalar and vector mappings
- Optimality and duality for a class of nondifferentiable multiobjective fractional programming problems
- Sequential optimality conditions for multiobjective fractional programming problems
- Proper efficiency and the theory of vector maximization
- Some characterizations of robust optimal solutions for uncertain fractional optimization and applications
- Duality in Vector Optimization
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
This page was built for publication: Sequential optimality conditions of approximate proper efficiency for a multiobjective fractional programming problem