Proper Efficiency in Nonconvex Multicriteria Programming
From MaRDI portal
Cited in
(29)- Interactive fuzzy decision making for multiobjective nonlinear programming using augmented minimax problems
- Dynamic parametric bounds on efficient outcomes in interactive multiple criteria decision making problems
- An interactive fuzzy satisficing method for multiobjective nonlinear programming problems with fuzzy parameters
- ε-approximate solutions in multiobjective optimization
- Families of differentiable scalarization functions
- Proper efficiency and cardinal utilities in multicriteria decision making
- Computation of ideal and Nadir values and implications for their use in MCDM methods.
- Linear multiobjective maxmin optimization and some Pareto and lexmaxmin extensions
- Multiobjective optimization of table olive preparation systems
- Slack-based generalized Tchebycheff norm scalarization approaches for solving multiobjective optimization problems
- Convex cones, assessment functions, balanced attributes
- Efficient solutions and bounds on tradeoffs
- Out of the mist -- towards decision-maker-friendly multiple criteria decision making support
- A combined scalarization method for multi-objective optimization problems
- Approximate solutions for multi-objective optimization problems via scalarizing and nonscalarizing methods
- Some characterizations of the optimal solutions of a vector optimization problem
- Sequential optimality conditions for multiobjective fractional programming problems
- Pareto optimality of critical state vectors in vector sets with state attributes
- The influence of proper efficiency on optimal solutions of scalarizing problems in multicriteria optimization
- Proper Efficiency and Tradeoffs in Multiple Criteria and Stochastic Optimization
- On necessary and sufficient optimality conditions for multicriterial optimization problems
- Minimization of Gerstewitz functionals extending a scalarization by Pascoletti and Serafini
- A modified weighted Tchebycheff metric for multiple objective programming
- Stability achievement scalarization function for multiobjective nonlinear programming problems
- Definition and characterization of Geoffrion proper efficiency for real vector optimization with infinitely many criteria
- Nonlinear scalarization in multiobjective optimization with a polyhedral ordering cone
- Construction of vector-valued weak separation functions with applications to conjugate duality in vector optimization
- A unified approach for characterizing Pareto optimal solutions of multiobjective optimization problems: The hyperplane method
- Searching for psychologically stable solutions of multiple criteria decision problems
This page was built for publication: Proper Efficiency in Nonconvex Multicriteria Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3037170)
