Coradiant-valued maps and approximate solutions in variable ordering structures
From MaRDI portal
Publication:1734112
Recommendations
- A coradiant based scalarization to characterize approximate solutions of vector optimization problems with variable ordering structures
- Concepts for approximate solutions of vector optimization problems with variable order structures
- Approximate solutions and scalarization in set-valued optimization
- Characterization of approximate solutions of vector optimization problems with a variable order structure
- Approximate properly solutions of constrained vector optimization with variable coradiant sets
Cites work
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- \(\epsilon\)-solutions in vector minimization problems
- A coradiant based scalarization to characterize approximate solutions of vector optimization problems with variable ordering structures
- A Unified Approach and Optimality Conditions for Approximate Solutions of Vector Optimization Problems
- An improved definition of proper efficiency for vector maximization with respect to cones
- Approximate Pareto sets of minimal size for multi-objective optimization problems
- Approximating the Pareto set of multiobjective linear programs via robust optimization
- Approximation of solutions for location problems
- Characterization of approximate solutions of vector optimization problems with a variable order structure
- Characterizations of variable domination structures via nonlinear scalarization
- Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
- Coradiant sets and \(\varepsilon \)-efficiency in multiobjective optimization
- scientific article; zbMATH DE number 3874989 (Why is no real title available?)
- scientific article; zbMATH DE number 3662118 (Why is no real title available?)
- scientific article; zbMATH DE number 912668 (Why is no real title available?)
- Numerical procedures in multiobjective optimization with variable ordering structures
- On approximate efficiency in multiobjective programming
- ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
- Optimal elements in vector optimization with a variable ordering structure
- Optimality conditions for approximate solutions of vector optimization problems with variable ordering structures
- Proper efficiency with respect to cones
- Proper Efficient Points for Maximizations with Respect to Cones
- Scalarizing vector optimization problems
- Variable preference modeling with ideal-symmetric convex cones
- Vector complementarity problems with a variable ordering relation
- Vector optimization. Set-valued and variational analysis.
- Vector variational principles; -efficiency and scalar stationarity
Cited in
(3)- A coradiant based scalarization to characterize approximate solutions of vector optimization problems with variable ordering structures
- Scalarization and optimality conditions for the approximate solutions to vector variational inequalities in Banach spaces
- Linear and nonlinear scalarization methods for vector optimization problems with variable ordering structures
This page was built for publication: Coradiant-valued maps and approximate solutions in variable ordering structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1734112)
