On duality for weakly minimized vector valued optimization problems
From MaRDI portal
Publication:3744778
DOI10.1080/02331938608843188zbMath0606.49011OpenAlexW2095172861MaRDI QIDQ3744778
T. Weir, Bruce D.Craven, Bertram Mond
Publication date: 1986
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331938608843188
Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Management decision making, including multiple objectives (90B50) Methods involving semicontinuity and convergence; relaxation (49J45) Duality theory (optimization) (49N15)
Related Items (21)
Nonsmooth vector-valued invex functions and applications ⋮ Lagrange multipliers and saddle points in multiobjective programming ⋮ Global efficiency in multiobjective programming* ⋮ A modified wolfe dual for weak vector minimization ⋮ Multiobjective optimization problems with modified objective functions and cone constraints and applications ⋮ Saddle points criteria in nondifferentiable multiobjective programming with \(V\)-invex functions via an \(\eta \)-approximation method ⋮ Characterization of vector strict global minimizers of order 2 in differentiable vector optimization problems under a new approximation method ⋮ AN η-APPROXIMATION METHOD FOR NONSMOOTH MULTIOBJECTIVE PROGRAMMING PROBLEMS ⋮ A survey of recent[1985-1995advances in generalized convexity with applications to duality theory and optimality conditions] ⋮ A new characterization of (weak) Pareto optimality for differentiable vector optimization problems with \(G\)-invex functions ⋮ Equivalence and existence of weak Pareto optima for multiobjective optimization problems with cone constraints ⋮ Nondifferentiable optimization in banach space ⋮ Another approach to multiobjective programming problems with \(F\)-convex functions ⋮ Lagrange multipliers saddle points and scalarizations in composite multiobjective nonsmooth programming ⋮ Saddle point criteria and duality in multiobjective programming via an η-approximation method ⋮ On \(G\)-invex multiobjective programming. II: Duality ⋮ Quasimin and quasisaddlepoint for vector optimization ⋮ On a finite element method for a certain class of time-dependent problems ⋮ AN η-APPROXIMATION APPROACH IN NONLINEAR VECTOR OPTIMIZATION WITH UNIVEX FUNCTIONS ⋮ An \(\eta\)-approximation method in nonlinear vector optimization ⋮ Constrained minimax for a vector-valued function
Cites Work
- Unnamed Item
- Optimization theory in linear spaces. III: Mathematical programming in partially ordered Banach spaces
- Nonlinear programming in locally convex spaces
- A duality theorem for non-linear programming
- Strong Vector Minimization and Duality
- Invex functions and constrained local minima
- Necessary and Sufficient Conditions for the Order‐ Completeness of Partially Ordered Vector Spaces
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- Lagrangean conditions and quasiduality
This page was built for publication: On duality for weakly minimized vector valued optimization problems
