Sequential optimality conditions for fractional optimization with applications to vector optimization
From MaRDI portal
Publication:2260685
Recommendations
- Sequential optimality conditions for multiobjective fractional programming problems
- Sequential approximate optimality conditions for multi objective fractional programming problems via sequential approximate subdifferential calculus
- Formulas for sequential Pareto subdifferentials of the sums of vector mappings and applications to optimality conditions
- Sequential approximate weak optimality conditions for multiobjective fractional programming problems via sequential calculus rules for the Brøndsted-Rockafellar approximate subdifferential
- Optimality conditions with sequences in basic vector optimization
Cites work
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- Conjugate duality in convex optimization
- Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming
- Duality and Farkas-type results for DC infinite programming with inequality constraints
- Farkas-type results for fractional programming problems
- Fractional Programming. II, On Dinkelbach's Algorithm
- Generalized fractional programming problems containing locally subdifferentiable andρ-Univex functions
- Higher-order optimality conditions for set-valued optimization
- scientific article; zbMATH DE number 5992448 (Why is no real title available?)
- scientific article; zbMATH DE number 1568702 (Why is no real title available?)
- scientific article; zbMATH DE number 5245384 (Why is no real title available?)
- Liberating the subgradient optimality conditions from constraint qualifications
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- On Nonlinear Fractional Programming
- On robust duality for fractional programming with uncertainty data
- On strong and total Lagrange duality for convex optimization problems
- On the Subdifferentiability of Convex Functions
- Optimality conditions for approximate solutions of convex semi-infinite vector optimization problems
- Sequential characterization of solutions in convex composite programming and applications to vector optimization
- Sequential Convex Subdifferential Calculus and Sequential Lagrange Multipliers
- Sequential Lagrange multiplier condition forϵ-optimal solution in convex programming
- Sequential optimality conditions for composed convex optimization problems
- Stable and total Fenchel duality for convex optimization problems in locally convex spaces
- Stable and Total Fenchel Duality for DC Optimization Problems in Locally Convex Spaces
- Symmetric duality for a class of nonlinear fractional programming problems
- Vector optimization. Set-valued and variational analysis.
Cited in
(15)- Some dual characterizations of Farkas-type results for fractional programming problems
- Jacobi and Legendre variational tests for a class of generalized fractional variational problem
- On robust approximate optimal solutions for fractional semi-infinite optimization with uncertainty 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 multiobjective fractional programming problems
- Some characterizations of robust optimal solutions for uncertain fractional optimization and applications
- Sequential subdifferential for multi-composed functions via perturbation approach
- Optimality conditions with sequences in basic vector optimization
- Sequential approximate optimality conditions for multi objective fractional programming problems via sequential approximate subdifferential calculus
- Some characterizations of duality for DC optimization with composite functions
- Characterizations of approximate duality and saddle point theorems for nonsmooth robust vector optimization
- Sequential optimality conditions of approximate proper efficiency for a multiobjective fractional programming problem
- Sequential optimality theorems for second-order cone linear fractional vector optimization problems
- Sequential efficiency optimality conditions for robust multiobjective fractional optimization problems
- Sequential approximate optimality conditions for a constrained convex vector minimization problem and application to multiobjective fractional programming problem
This page was built for publication: Sequential optimality conditions for fractional optimization with applications to vector optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2260685)
