The Vector Maximization Problem: Proper Efficiency and Stability
From MaRDI portal
Publication:4133426
Cited in
(30)- A multicriteria approach to timeout collaboration protocol
- Decomposition of multiple criteria mathematical programming problems by dynamic programming
- Linear programming with partial information
- On efficient sets in vector maximum problems - A brief survey
- Proper efficiency in a linear fractional vector maximum problem with generalized convex constraints
- Multiple-objective programming with polynomial objectives and constraints
- Stability in vector maximization - a survey
- Duality for nonlinear multiple-criteria optimization problems
- Proper efficiency with respect to cones
- Optimization over the efficient set
- Efficiency and proper efficiency in vector maximization with respect to cones
- Solving a special class of multiple objective linear fractional programming problems
- A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets
- Improved -constraint method for multiobjective programming
- Vector maximization with two objective functions
- Enhanced efficiency in multi-objective optimization
- Efficiency and approachability of nonconvex bicriteria programs
- Stability of properly efficient points and isolated minimizers of constrained vector optimization problems
- Efficiency in Multi-Objective Fractional Functional Programming
- Efficiency in multiple objective optimization problems
- Kuhn-Tucker multipliers as trade-offs in multiobjective decision-making analysis
- Convexification of a noninferior frontier
- Characterizations of Hartley proper efficiency in nonconvex vector optimization
- On the optimality conditions for D.C. vector optimization problems
- Existence of efficient solutions for vector maximization problems
- Stability results for efficient solutions of vector optimization problems
- Hierarchical multiobjective analysis for large-scale systems: Review and current status
- Isolated minimizers and proper efficiency for \(C^{0,1}\) constrained vector optimization problems
- On the characterization of Pareto-optimal solutions in bicriterion optimization
- On weak and strong Kuhn-Tucker conditions for smooth multiobjective optimization
This page was built for publication: The Vector Maximization Problem: Proper Efficiency and Stability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4133426)
