ϵ-Efficient solutions in semi-infinite multiobjective optimization
From MaRDI portal
(Redirected from Publication:4634336)
\(\epsilon\)-Efficient solutions in semi-infinite multiobjective optimization
\(\epsilon\)-Efficient solutions in semi-infinite multiobjective optimization
Recommendations
- Optimality and duality for generalized approximate solutions in semi-infinite multiobjective optimization
- Optimality conditions for generalized approximate solutions in semi-infinite multiobjective optimization
- An approach to -duality theorems for nonconvex semi-infinite multiobjective optimization problems
- Weakly quasi -efficiency for semi-infinite multi-objective optimization problems with locally Lipschitzian data
- Optimality conditions and duality theorems for -quasi weakly efficient solutions in semi-convex multi-objective optimization problems
Cites work
- A new approach to characterize the solution set of a pseudoconvex programming problem
- Again on regularity conditions in differentiable vector optimization
- An introduction to the theory of nonsmooth optimization
- Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators
- Characterizations of solution sets of a class of nonconvex semi-infinite programming problems
- Constrained qualifications in multiobjective optimization problems: Differentiable case
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
- Constraint qualifications for KKT optimality condition in convex optimization with locally Lipschitz inequality constraints
- Constraint qualifications for semi-infinite systems of convex inequalities
- Constraint qualifications in convex vector semi-infinite optimization
- Constraint qualifications in nonsmooth multiobjective optimization
- Convex Analysis
- Dini derivatives in optimization — Part I
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 6508502 (Why is no real title available?)
- scientific article; zbMATH DE number 3905307 (Why is no real title available?)
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- scientific article; zbMATH DE number 1779286 (Why is no real title available?)
- scientific article; zbMATH DE number 872150 (Why is no real title available?)
- Isolated and proper efficiencies in semi-infinite vector optimization problems
- Multicriteria Optimization
- Necessary conditions for nonsmooth multiobjective semi-infinite problems using Michel-penot subdifferential
- Nondifferentiable Multiplier Rules for Optimization and Bilevel Optimization Problems
- Nonsmooth calculus, minimality, and monotonicity of convexificators
- Nonsmooth semi-infinite multiobjective optimization problems
- On constraint qualification in multiobjective optimization problems: Semidifferentiable case
- On constraint qualifications in directionally differentiable multiobjective optimization problems
- On convex optimization without convex representation
- On robust multiobjective optimization
- On strong KKT optimality conditions for multiobjective semi-infinite programming problems with Lipschitzian data
- Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators
- Optimality conditions for nonsmooth semi-infinite multiobjective programming
- Optimality conditions for pseudoconvex minimization over convex sets defined by tangentially convex constraints
- Optimality conditions in convex multiobjective SIP
- Optimality conditions in convex optimization revisited
- Optimality Conditions in Directionally Differentiable Pareto Problems with a Set Constraint via Tangent Cones
- Optimality conditions in optimization problems with convex feasible set using convexificators
- Optimization and nonsmooth analysis
- Proper efficiency and the theory of vector maximization
- Regularity Conditions and Optimality in Vector Optimization
- Robust aspects of solutions in deterministic multiple objective linear programming
- Robustness in nonsmooth nonlinear multi-objective programming
- Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
- Set-valued analysis
- Strong Kuhn-Tucker conditions and constraint qualifications in locally Lipschitz multiobjective optimization problems
- Sufficient conditions for extremum, penalty functions and regularity
Cited in
(17)- An approach to -duality theorems for nonconvex semi-infinite multiobjective optimization problems
- An \({\mathcal{UV}}\)-algorithm for semi-infinite multiobjective programming
- Some characterizations of approximate solutions for robust semi-infinite optimization problems
- On Proper Efficiency in Multiobjective Semi-infinite Optimization
- scientific article; zbMATH DE number 5811784 (Why is no real title available?)
- Optimality and duality for generalized approximate solutions in semi-infinite multiobjective optimization
- Characterizations of robust -quasi optimal solutions for nonsmooth optimization problems with uncertain data
- Weakly quasi -efficiency for semi-infinite multi-objective optimization problems with locally Lipschitzian data
- Optimality conditions for generalized approximate solutions in semi-infinite multiobjective optimization
- On a weakly C-\epsilon-vector saddle point approach in weak vector problems
- Optimality conditions and duality theorems for -quasi weakly efficient solutions in semi-convex multi-objective optimization problems
- Approximate solution in robust multi-objective optimization and its application in portfolio 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 Chankong-Haimes scheme for approximate optimality conditions of nonsmooth fractional multiobjective optimization problems with infinite constraints
- \(\mathcal{E}\)-\(LU\)-Pareto solutions for semi-infinite programs with multiple intervals
- Optimality conditions for approximate Pareto solutions of a nonsmooth vector optimization problem with an infinite number of constraints
This page was built for publication: ϵ-Efficient solutions in semi-infinite multiobjective optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4634336)
