Approximate optimality conditions for approximate efficiency in semi-infinite multiobjective fractional programming problem
From MaRDI portal
Cites work
- \(\epsilon\)-duality theorem of nondifferentiable nonconvex multiobjective programming
- \(\epsilon\)-Pareto optimality for nondifferentiable multiobjective programming via penalty function
- \(\epsilon\)-solutions in vector minimization problems
- -optimality and duality for multiobjective fractional programming
- A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials
- Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials
- Characterizing a class of robust vector polynomial optimization via sum of squares conditions
- Characterizing robust weak sharp solution sets of convex optimization problems with uncertainty
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
- Duality in Vector Optimization
- Epsilon efficiency
- scientific article; zbMATH DE number 3662118 (Why is no real title available?)
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- scientific article; zbMATH DE number 7598243 (Why is no real title available?)
- Inequality systems and global optimization
- Multiplier rules and saddle-point theorems for Helbig's approximate solutions in convex Pareto problems
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Nondifferentiable fractional semi-infinite multiobjective optimization problems
- Nonsmooth semi-infinite multiobjective optimization problems
- On -optimality conditions for multiobjective fractional optimization problems
- ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
- On Approximate Solutions in Convex Vector Optimization
- On isolated/properly efficient solutions in nonsmooth robust semi-infinite multiobjective optimization
- On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems
- On robust approximate optimal solutions for fractional semi-infinite optimization with uncertainty data
- On robust multiobjective optimization
- On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems
- On solving a class of fractional semi-infinite polynomial programming problems
- Optimality conditions and duality for minimax fractional programming problems with data uncertainty
- 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 of approximate proper efficiency for a multiobjective fractional programming problem
- Some characterizations of approximate solutions for robust semi-infinite optimization problems
- ε-Pareto Optimality Conditions for Convex Multiobjective Programming via Max Function
This page was built for publication: Approximate optimality conditions for approximate efficiency in semi-infinite multiobjective fractional programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6960194)
