Isolated and proper efficiencies in semi-infinite vector optimization problems
From MaRDI portal
The paper addresses semi-infinite vector optimization problems of the form \(\min_{\mathbb{R}_+^m} \{f(x): x \in C\}\), where \(C\) is defined by a possibly infinite set of inequality constraints. It is concerned with local efficient, local strongly isolated, and local positively properly efficient solutions of such problems. The authors prove a sufficient condition for local strongly isolated solutions under a limiting constraint qualification. If the vectors of the objective and constraint functions are locally convex at a point that satisfies the condition, they show that the condition is sufficient. Furthermore, they prove a necessary condition for local positively properly efficient solutions under the limiting constraint qualification. This condition is shown to be sufficient under generalized convexity. Finally, a Wolfe-type dual problem is defined for which weak and strong duality results are proved.
Recommendations
- scientific article; zbMATH DE number 7598243
- Nonsmooth semi-infinite multiobjective optimization problems
- Isolated efficiency in nonsmooth semi-infinite multi-objective programming
- On duality in multiobjective semi-infinite optimization
- Nonsmooth multiobjective semi-infinite problems with mixed constraints
Cites work
- A duality theorem for non-linear programming
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- Convex Analysis
- Density of stable convex semi-infinite vector optimization problems
- From scalar to vector optimization.
- Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- Isolated minimizers and proper efficiency for \(C^{0,1}\) constrained vector optimization problems
- Lipschitz behavior of solutions to nonconvex semi-infinite vector optimization problems
- Lower semi-continuity of the Pareto solution map in quasiconvex semi-infinite vector optimization
- New Farkas-type constraint qualifications in convex infinite programming
- Nonsmooth semi-infinite multiobjective optimization problems
- On the notion of proper efficiency in vector optimization
- Optimality and duality for proper and isolated efficiencies in multiobjective optimization
- Proper efficiency and the theory of vector maximization
- Pseudo-Lipschitz property of linear semi-infinite vector optimization problems
- Qualification and optimality conditions for dc programs with infinite constraints
- Scalarization and optimality conditions for strict minimizers in multiobjective optimization via contingent epiderivatives
- Semi-infinite multiobjective programming with generalized invexity
- Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
- Stability of properly efficient points and isolated minimizers of constrained vector optimization problems
- Stability of semi-infinite vector optimization problems under functional perturbations
- Strong duality for proper efficiency in vector optimization
- Strong KKT conditions and weak sharp solutions in convex-composite optimization
- Subdifferentials of marginal functions in semi-infinite programming
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- Subsmooth semi-infinite and infinite optimization problems
- Sufficient conditions for pseudo-Lipschitz property in convex semi-infinite vector optimization problems
- Variational methods in partially ordered spaces
Cited in
(35)- Nondifferentiable fractional semi-infinite multiobjective optimization problems
- Necessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problems
- Optimality conditions for minimax optimization problems with an infinite number of constraints and related applications
- Quasi \(\epsilon\)-solutions in a semi-infinite programming problem with locally Lipschitz data
- Karush-Kuhn-Tucker optimality conditions and duality for convex semi-infinite programming with multiple interval-valued objective functions
- Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints
- On the Mangasarian-Fromovitz constraint qualification and Karush-Kuhn-Tucker conditions in nonsmooth semi-infinite multiobjective programming
- Characterizing robust weak sharp solution sets of convex optimization problems with uncertainty
- Nonsmooth semi-infinite multiobjective optimization problems
- Optimality conditions in convex multiobjective SIP
- On the Hölder continuity of solution maps to parametric generalized vector quasi-equilibrium problems via nonlinear scalarization
- Strong Karush-Kuhn-Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming
- On isolated/properly efficient solutions in nonsmooth robust semi-infinite multiobjective optimization
- On optimality conditions and duality theorems for approximate solutions of nonsmooth infinite optimization problems
- Weak sharp efficiency in multiobjective optimization
- \(\epsilon\)-Efficient solutions in semi-infinite multiobjective optimization
- Optimality, scalarization and duality in linear vector semi-infinite programming
- Isolated efficiency in nonsmooth semi-infinite multi-objective programming
- Higher-order Karush-Kuhn-Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming
- Strong second-order Karush-Kuhn-Tucker optimality conditions for vector optimization
- Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming via tangential subdifferentials
- Levitin-Polyak well-posedness for generalized semi-infinite multiobjective programming problems
- Density Aspects in Semi-Infinite Vector Optimization
- On \(\varepsilon\)-quasi efficient solutions for fractional infinite multiobjective optimization problems with locally Lipschitz data
- Approximate optimality conditions and approximate duality theorems for nonlinear semi-infinite programming problems with uncertainty data
- On global well-posedness of semi-infinite set optimization problems
- Approximate optimal solutions for multiobjective optimization problems with infinite constraints
- Lagrange Duality and Saddle Point Optimality Conditions for Multiobjective Semi-Infinite Programming with Vanishing Constraints
- Local isolated efficiency in non-smooth robust semi-infinite multi-objective fractional programming problems
- Approximate efficient solutions for nondifferentiable multiobjective optimization problems with an infinite number of constraints
- -quasi-weakly solution for semi-infinite vector optimization problems with data uncertainty
- Semi-infinite vanishing constraints problem with convexificators and optimality analysis
- Optimality and duality relations for multiobjective fractional semi-infinite optimization problems with equilibrium constraints
- On isolated and proper efficiencies in fractional multiobjective optimization problems involving equality and inequality constraints
- Some results of Karush-Kuhn-Tucker multipliers in robust semi-infinite multiobjective optimization
This page was built for publication: Isolated and proper efficiencies in semi-infinite vector optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q467444)
