A combined scalarizing method for multiobjective programming problems
From MaRDI portal
Recommendations
- A combined scalarization method for multi-objective optimization problems
- Combined scalarizations for approximate solutions of multi-objective optimization problems
- Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization
- scientific article; zbMATH DE number 7266699
- On approximating weakly/properly efficient solutions in multi-objective programming
Cites work
- scientific article; zbMATH DE number 3934760 (Why is no real title available?)
- scientific article; zbMATH DE number 4010155 (Why is no real title available?)
- scientific article; zbMATH DE number 3662118 (Why is no real title available?)
- scientific article; zbMATH DE number 2063780 (Why is no real title available?)
- scientific article; zbMATH DE number 2209474 (Why is no real title available?)
- An MCDM approach to portfolio optimization.
- An improved definition of proper efficiency for vector maximization with respect to cones
- Approximate quasi efficient solutions in multiobjective optimization
- Approximation methods in multiobjective programming
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- Epsilon efficiency
- Generating \(\varepsilon\)-efficient solutions in multiobjective programming
- Global formulation for interactive multiobjective optimization
- Hybrid approach for solving multiple-objective linear programs in outcome space
- Improved -constraint method for multiobjective programming
- Improving the computational efficiency in a global formulation (GLIDE) for interactive multiobjective optimization
- Multicriteria optimization
- Multiobjective optimization: survey of methods and industrial applications
- Multiple criteria decision making combined with finance: a categorized bibliographic study.
- Multiple objective decision making - methods and applications. A state- of-the-art survey. In collaboration with Sudhakar R. Paidy and Kwangsun Yoon
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- ON APPROXIMATE MINIMA IN VECTOR OPTIMIZATION
- On Cone-Efficiency, Cone-Convexity and Cone-Compactness
- On approximate solutions in vector optimization problems via scalarization
- On approximating weakly/properly efficient solutions in multi-objective programming
- On characterizations of proper efficiency for nonconvex multiobjective optimization
- On the location of antennas for treatment planning in hyperthermia
- Optimality conditions for approximate solutions in multiobjective optimization problems
- Optimality conditions for approximate solutions of vector optimization problems
- Optimality conditions for metrically consistent approximate solutions in vector optimization
- Proper Efficient Points for Maximizations with Respect to Cones
- Proper efficiency and the theory of vector maximization
- Scalarizations for adaptively solving multi-objective optimization problems
- The weighted sum method for multi-objective optimization: new insights
- \(\epsilon\)-solutions in vector minimization problems
- \(\varepsilon\)-properly efficient solutions to nondifferentiable multiobjective programming problems
- ε-approximate solutions in multiobjective optimization
Cited in
(26)- An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems
- Analysis of the weighted Tchebycheff weight set decomposition for multiobjective discrete optimization problems
- Advances in multiobjective optimisation: scalarisation, approximation, and complexity
- Slack-based generalized Tchebycheff norm scalarization approaches for solving multiobjective optimization problems
- Improved -constraint method for multiobjective programming
- A combined scalarization method for multi-objective optimization problems
- Optimality conditions via scalarization for approximate quasi efficiency in multiobjective optimization
- Quadratic scalarization for decomposed multiobjective optimization
- An efficient hybrid algorithm for multiobjective optimization problems with upper and lower bounds in engineering
- A revised Pascoletti-Serafini scalarization method for multiobjective optimization problems
- Integrated business continuity and disaster recovery planning: towards organizational resilience
- A gap between multiobjective optimization and scalar optimization
- The hybrid approach: Lagrangian and proper equality constraints (Scalarization of vector optimization problems (SVOP))
- The modified objective-constraint scalarization approach for multiobjective optimization problems
- Improving the min-max method for multiobjective programming
- Comparison of some scalarization methods in multiobjective optimization
- A note on optimality conditions for multi-objective problems with a Euclidean cone of preferences
- Solving multiobjective optimal control problems using an improved scalarization method
- A hybrid optimization technique for solving nonlinear multi-objective optimization problem
- A discussion of scalarization techniques for multiple objective integer programming
- Combined scalarizations for approximate solutions of multi-objective optimization problems
- A unified approach for characterizing Pareto optimal solutions of multiobjective optimization problems: The hyperplane method
- A modified direction approach for proper efficiency of multiobjective optimization
- Generating properly efficient points in multi-objective programs by the nonlinear weighted sum scalarization method
- scientific article; zbMATH DE number 7266699 (Why is no real title available?)
- Optimality conditions via a unified direction approach for (approximate) efficiency in multiobjective optimization
This page was built for publication: A combined scalarizing method for multiobjective programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q299884)
