Optimality, scalarization and duality in linear vector semi-infinite programming
From MaRDI portal
Recommendations
Cites work
- \(\epsilon\)-solutions in vector minimization problems
- A duality theorem for non-linear programming
- A sup-function approach to linear semi-infinite optimization
- Approximate solutions of multiobjective optimization problems
- Constrained qualifications in multiobjective optimization problems: Differentiable case
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
- Constraint qualifications for semi-infinite systems of convex inequalities
- Constraint qualifications in convex vector semi-infinite optimization
- Constraint qualifications in linear vector semi-infinite optimization
- Constraint qualifications in semi-infinite systems and their applications in nonsmooth semi-infinite problems with mixed constraints
- Extended Active Constraints in Linear Optimization with Applications
- scientific article; zbMATH DE number 3856842 (Why is no real title available?)
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces
- Multicriteria optimization
- On strong KKT optimality conditions for multiobjective semi-infinite programming problems with Lipschitzian data
- On the variational principle
- Optimality conditions in convex multiobjective SIP
- Robust alternative theorem for linear inequalities with applications to robust multiobjective optimization
- Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization
- Semi-infinite optimization: Structure and stability of the feasible set
- Semi-infinite programming
Cited in
(19)- Über die Skalarisierung und Dualisierung von Vektoroptimierungsproblemen. (Scalarization and dualization of vector optimization problems)
- On affine scaling and semi-infinite programming
- Mixed \(E\)-duality for \(E\)-differentiable vector optimization problems under (generalized) \(V\)-\(E\)-invexity
- Optimality and duality in nonsmooth semi-infinite optimization, using a weak constraint qualification
- On stationarity for nonsmooth multiobjective problems with vanishing constraints
- Constraint qualifications in linear vector semi-infinite optimization
- Optimality conditions and duality theorems for nonsmooth semi-infinite interval-valued mathematical programs with vanishing constraints
- Optimality and duality for \(E\)-differentiable multiobjective programming problems involving \(E\)-type I functions
- On isolated/properly efficient solutions in nonsmooth robust semi-infinite multiobjective optimization
- Isolated efficiency in nonsmooth semi-infinite multi-objective programming
- Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization
- scientific article; zbMATH DE number 7468708 (Why is no real title available?)
- scientific article; zbMATH DE number 7546024 (Why is no real title available?)
- Necessary conditions in generalized semi-infinite optimization with nondifferentiable convex data
- \(\varPhi\)-weak Slater constraint qualification in nonsmooth multiobjective semi-infinite programming
- On nonsmooth multiobjective semi-infinite programming problems with mixed constraints
- Upper level qualifications and optimality in multiobjective convex generalized semi-infinite problems
- Regularity properties for locally Lipschitz C(T)-valued functions on Hilbert spaces
- Quasiconvex semi-infinite optimization
This page was built for publication: Optimality, scalarization and duality in linear vector semi-infinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4643678)
