On duality for weakly minimized vector valued optimization problems
DOI10.1080/02331938608843188zbMATH Open0606.49011OpenAlexW2095172861MaRDI QIDQ3744778FDOQ3744778
Authors: T. Weir, Bertram Mond, B. D. Craven 
Publication date: 1986
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331938608843188
Recommendations
- Duality and weak efficiency in vector variational problems
- The duality on vector optimization problems
- scientific article; zbMATH DE number 3951400
- Duality in nonconvex vector minimum problems
- Sur la dualité en optimisation vectorielle convexe
- Some results on dual vector optimization problems
- scientific article; zbMATH DE number 672178
- Duality related to approximate proper solutions of vector optimization problems
- Duality for vector optimization problems via a general scalarization
- Duality for nonsmooth continuous-time problems of vector optimization
Convex programming (90C25) Management decision making, including multiple objectives (90B50) Sensitivity, stability, parametric optimization (90C31) Methods involving semicontinuity and convergence; relaxation (49J45) Duality theory (optimization) (49N15)
Cites Work
- Invex functions and constrained local minima
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- A duality theorem for non-linear programming
- Lagrangean conditions and quasiduality
- Title not available (Why is that?)
- Strong Vector Minimization and Duality
- Optimization theory in linear spaces. III: Mathematical programming in partially ordered Banach spaces
- Nonlinear programming in locally convex spaces
- Necessary and Sufficient Conditions for the Order‐ Completeness of Partially Ordered Vector Spaces
Cited In (26)
- Title not available (Why is that?)
- Multiobjective optimization problems with modified objective functions and cone constraints and applications
- Saddle point criteria and duality in multiobjective programming via an η-approximation method
- Vector duality for convex vector optimization problems by means of the quasi-interior of the ordering cone
- AN η-APPROXIMATION METHOD FOR NONSMOOTH MULTIOBJECTIVE PROGRAMMING PROBLEMS
- Another approach to multiobjective programming problems with \(F\)-convex functions
- Quasimin and quasisaddlepoint for vector optimization
- Equivalence and existence of weak Pareto optima for multiobjective optimization problems with cone constraints
- On \(G\)-invex multiobjective programming. II: Duality
- Lagrange multipliers saddle points and scalarizations in composite multiobjective nonsmooth programming
- Duality and weak efficiency in vector variational problems
- Weak minimization and duality
- Lagrange multipliers and saddle points in multiobjective programming
- Saddle points criteria in nondifferentiable multiobjective programming with \(V\)-invex functions via an \(\eta \)-approximation method
- On a finite element method for a certain class of time-dependent problems
- Characterization of vector strict global minimizers of order 2 in differentiable vector optimization problems under a new approximation method
- A modified wolfe dual for weak vector minimization
- General duality in vector optimization
- A new characterization of (weak) Pareto optimality for differentiable vector optimization problems with \(G\)-invex functions
- AN η-APPROXIMATION APPROACH IN NONLINEAR VECTOR OPTIMIZATION WITH UNIVEX FUNCTIONS
- Global efficiency in multiobjective programming*
- Nondifferentiable optimization in banach space
- A survey of recent[1985-1995]advances in generalized convexity with applications to duality theory and optimality conditions
- Constrained minimax for a vector-valued function
- An \(\eta\)-approximation method in nonlinear vector optimization
- Nonsmooth vector-valued invex functions and applications
This page was built for publication: On duality for weakly minimized vector valued optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3744778)
