Approximate optimal solutions for multiobjective optimization problems with infinite constraints
From MaRDI portal
(Redirected from Publication:6196813)
Recommendations
- Approximate efficient solutions for nondifferentiable multiobjective optimization problems with an infinite number of constraints
- On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems
- Optimality and duality for generalized approximate solutions in semi-infinite multiobjective optimization
- \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
- Duality and saddle point theorems of approximate solutions for nonsmooth semi-infinite multiobjective optimization problems
Cites work
- \(\epsilon\)-solutions in vector minimization problems
- \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
- An approach to -duality theorems for nonconvex semi-infinite multiobjective optimization problems
- Approximate necessary optimality in fractional semi-infinite multiobjective optimization
- Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials
- Approximate solutions of multiobjective optimization problems
- Characterizations of the solution set for nonconvex semi-infinite programming problems
- Characterizing robust optimal solution sets for nonconvex uncertain semi-infinite programming problems involving tangential subdifferentials
- Characterizing the solution set for nonconvex semi-infinite programs involving tangential subdifferentials
- Constraint qualifications in semi-infinite systems and their applications in nonsmooth semi-infinite problems with mixed constraints
- Duality for nonlinear fractional programs
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 1095224 (Why is no real title available?)
- scientific article; zbMATH DE number 7347486 (Why is no real title available?)
- Isolated and proper efficiencies in semi-infinite vector optimization problems
- Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming via tangential subdifferentials
- Multi-criteria optimization problems with fractional objectives: approximate optimality and approximate duality
- Multicriteria Optimization
- Necessary and sufficient optimality conditions in DC semi-infinite programming
- Necessary conditions for ε-optimality
- Nondifferentiable fractional semi-infinite multiobjective optimization problems
- Nonsmooth semi-infinite multiobjective optimization problems
- On approximate solutions for nonsmooth robust multiobjective optimization problems
- On isolated/properly efficient solutions in nonsmooth robust semi-infinite multiobjective optimization
- On Nonlinear Fractional Programming
- ON OPTIMALITY AND DUALITY FOR GENERALIZED FRACTIONAL ROBUST OPTIMIZATION PROBLEMS
- On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems
- On robust duality for fractional programming with uncertainty data
- On strong KKT optimality conditions for multiobjective semi-infinite programming problems with Lipschitzian data
- On the Mangasarian-Fromovitz constraint qualification and Karush-Kuhn-Tucker conditions in nonsmooth semi-infinite multiobjective programming
- Optimality conditions and duality in fractional robust optimization problems
- Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints
- Optimality conditions for nonsmooth semi-infinite multiobjective programming
- Optimality conditions for semi-infinite programming problems under relaxed quasiconvexity assumptions
- Optimality conditions of approximate solutions for nonsmooth semi-infinite programming problems
- Parametric approach for approximate efficiency of robust multiobjective fractional programming problems
- Parametric Saddle Point Criteria in Semi-Infinite Minimax Fractional Programming Problems Under (p,r)-Invexity
- Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data
- Robust optimality conditions and duality for nonsmooth multiobjective fractional semi-infinite programming problems with uncertain data
- Robust optimality, duality and saddle points for multiobjective fractional semi-infinite optimization with uncertain data
- Some characterizations of approximate solutions for robust semi-infinite optimization problems
- Strong Karush-Kuhn-Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming
- Strong Karush-Kuhn-Tucker optimality conditions for multiobjective semi-infinite programming
- Variational analysis and applications
Cited in
(5)- On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data
- Approximate efficient solutions for nondifferentiable multiobjective optimization problems with an infinite number of constraints
- Optimality and duality for approximate solutions of multiobjective optimization problems involving intersection of closed sets
- On Chankong-Haimes scheme for approximate optimality conditions of nonsmooth fractional multiobjective optimization problems with infinite constraints
- On efficient solutions of nonsmooth fractional multiobjective optimization problems with mixed constraints
This page was built for publication: Approximate optimal solutions for multiobjective optimization problems with infinite constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6196813)
