-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
From MaRDI portal
Publication:377740
Recommendations
- Refinements of \(\varepsilon\)-duality theorems for a nonconvex problem with an infinite number of constraints
- An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems
- Duality theorems of a nonconvex program with infinite constraints
- scientific article; zbMATH DE number 7347486
- On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems
Cites work
- scientific article; zbMATH DE number 3662118 (Why is no real title available?)
- scientific article; zbMATH DE number 1113627 (Why is no real title available?)
- scientific article; zbMATH DE number 2120969 (Why is no real title available?)
- scientific article; zbMATH DE number 2212215 (Why is no real title available?)
- An ε-lagrange multiplier rule for a mathematical programming problem on banacch spaces∗
- Approximate quasi efficient solutions in multiobjective optimization
- Approximate saddle-point theorems in vector optimization
- Characterizations of optimal solution sets of convex infinite programs
- Characterizations of solution sets of a class of nonconvex semi-infinite programming problems
- Cone characterizations of approximate solutions in real vector optimization
- Epsilon efficiency
- Exact generation of epsilon-efficient solutions in multiple objective programming
- From linear to convex systems: consistency, Farkas' lemma and applications
- Necessary conditions for ε-optimality
- Necessary optimality conditions and saddle points for approximate optimization in Banach space
- New Farkas-type constraint qualifications in convex infinite programming
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- On approximate solutions in vector optimization problems via scalarization
- Optimality conditions for metrically consistent approximate solutions in vector optimization
- Optimization and nonsmooth analysis
- Qualification and optimality conditions for dc programs with infinite constraints
- Semismooth and Semiconvex Functions in Constrained Optimization
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- Variational Inequalities with Generalized Monotone Operators
- Weak stability and strong duality of a class of nonconvex infinite programs via augmented Lagrangian
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- \(\epsilon\)-solutions in vector minimization problems
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
- \(\varepsilon\)-optimality for multiobjective programming on a Banach space
- ε-approximate solutions in multiobjective optimization
Cited in
(29)- Approximate efficient solutions for nondifferentiable multiobjective optimization problems with an infinite number of constraints
- Characterizations of approximate duality and saddle point theorems for nonsmooth robust vector optimization
- Optimality and duality for nonsmooth semi-infinite multiobjective programming with support functions
- Approximate optimality conditions for nonsmooth optimization problems
- Approximate solutions in nonsmooth and nonconvex cone constrained vector optimization
- Characterizations of robust \(\varepsilon\)-quasi optimal solutions for nonsmooth optimization problems with uncertain data
- Duality and saddle point theorems of approximate solutions for nonsmooth semi-infinite multiobjective optimization problems
- An approach to \(\epsilon\)-duality theorems for nonconvex semi-infinite multiobjective optimization problems
- Duality related to approximate proper solutions of vector optimization problems
- Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs
- An approach to characterizing \(\epsilon\)-solution sets of convex programs
- Approximate quasi efficiency of set-valued optimization problems via weak subdifferential
- Approximate optimality conditions and mixed type duality for a class of non-convex optimization problems
- On a weakly C-$\epsilon$-vector saddle point approach in weak vector problems
- Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data
- Some characterizations of approximate solutions for robust semi-infinite optimization problems
- Minimax programming as a tool for studying robust multi-objective optimization problems
- Duality theorems of a nonconvex program with infinite constraints
- On approximate solutions and saddle point theorems for robust convex optimization
- Approximate optimal solutions for multiobjective optimization problems with infinite constraints
- scientific article; zbMATH DE number 7347486 (Why is no real title available?)
- Approximate optimality conditions and mixed type duality for semi-infinite multiobjective programming problems involving tangential subdifferentials
- On strong KKT optimality conditions for multiobjective semi-infinite programming problems with Lipschitzian data
- On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data
- Robust approximate optimal solutions for nonlinear semi-infinite programming with uncertainty
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints
- On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives
- Refinements of \(\varepsilon\)-duality theorems for a nonconvex problem with an infinite number of constraints
- On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems
This page was built for publication: \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q377740)
