Optimality, scalarization and duality in linear vector semi-infinite programming
From MaRDI portal
Publication:4643678
DOI10.1080/02331934.2018.1454921zbMath1475.90092OpenAlexW2795835294MaRDI QIDQ4643678
Giuseppe Caristi, Javad Shaker Ardekani, Nader Kanzi
Publication date: 28 May 2018
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2018.1454921
linear programmingoptimality conditionconstraint qualificationmultiple objective programmingsemi-infinite optimization
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)
Related Items (12)
On stationarity for nonsmooth multiobjective problems with vanishing constraints ⋮ 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 ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Mixed \(E\)-duality for \(E\)-differentiable vector optimization problems under (generalized) \(V\)-\(E\)-invexity ⋮ Isolated efficiency in nonsmooth semi-infinite multi-objective programming ⋮ Unnamed Item ⋮ $$\varPhi -$$ Weak Slater Constraint Qualification in Nonsmooth Multiobjective Semi-infinite Programming ⋮ Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization ⋮ Optimality and duality in nonsmooth semi-infinite optimization, using a weak constraint qualification
Cites Work
- Unnamed Item
- Unnamed Item
- Approximate solutions of multiobjective optimization problems
- Constraint qualifications in convex vector semi-infinite optimization
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
- On strong KKT optimality conditions for multiobjective semi-infinite programming problems with Lipschitzian data
- Semi-infinite programming
- Lagrange multipliers for \(\varepsilon \)-Pareto solutions in vector optimization with nonsolid cones in Banach spaces
- \(\epsilon\)-solutions in vector minimization problems
- Constrained qualifications in multiobjective optimization problems: Differentiable case
- Semi-infinite optimization: Structure and stability of the feasible set
- Multicriteria optimization
- Robust alternative theorem for linear inequalities with applications to robust multiobjective optimization
- On the variational principle
- A sup-function approach to linear semi-infinite optimization
- Constraint qualifications in linear vector semi-infinite optimization
- Optimality conditions in convex multiobjective SIP
- Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities
- Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization
- Constraint Qualifications in Semi-Infinite Systems and Their Applications in Nonsmooth Semi-Infinite Problems with Mixed Constraints
- A duality theorem for non-linear programming
- Extended Active Constraints in Linear Optimization with Applications
This page was built for publication: Optimality, scalarization and duality in linear vector semi-infinite programming
