Improved -constraint method for multiobjective programming
From MaRDI portal
Improved \(\varepsilon\)-constraint method for multiobjective programming
Recommendations
- Improving the min-max method for multiobjective programming
- A new method in multiple objective programming study and its application in \(\varepsilon \)-Pareto solution and \(\varepsilon \)-Pareto saddle point
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- A constraint method in nonlinear multi-objective optimization
- A combined scalarizing method for multiobjective programming problems
Cites work
- scientific article; zbMATH DE number 4010155 (Why is no real title available?)
- scientific article; zbMATH DE number 2209474 (Why is no real title available?)
- A Bibliography on the Applications of Mathematical Programming Multiple-objective Methods
- An improved definition of proper efficiency for vector maximization with respect to cones
- Characterizations of Hartley proper efficiency in nonconvex vector optimization
- Constructing robust crew schedules with bicriteria optimization
- Multicriteria Optimization
- Multiple criteria decision analysis. State of the art surveys
- Nearly subconvexlike set-valued maps and vector optimization problems
- On Cone-Efficiency, Cone-Convexity and Cone-Compactness
- On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
- On characterizations of proper efficiency for nonconvex multiobjective optimization
- Proper Efficient Points for Maximizations with Respect to Cones
- Proper efficiency and the theory of vector maximization
- The Vector Maximization Problem: Proper Efficiency and Stability
- Theory of multiobjective optimization
Cited in
(52)- A simple, efficient and versatile objective space algorithm for multiobjective integer programming
- Multi-objective dynamic optimization of path-constrained switched systems
- A flexible objective-constraint approach and a new algorithm for constructing the Pareto front of multiobjective optimization problems
- Scalarization for characterization of approximate strong/weak/proper efficiency in multi-objective optimization
- Solving fractional multicriteria optimization problems with sum of squares convex polynomial data
- Scalarizations for approximate quasi efficient solutions in multiobjective optimization problems
- An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets
- Whole blood or apheresis donations? A multi-objective stochastic optimization approach
- Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data
- A modeling framework for incorporating DEA efficiency into set covering, packing, and partitioning formulations
- Parametric approach to quadratically constrained multi-level multi-objective quadratic fractional programming
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- The \(\varepsilon\)-constrained method to solve a bi-objective problem of sustainable cultivation
- A combined scalarization method for multi-objective optimization problems
- Separations and optimality of constrained multiobjective optimization via improvement sets
- scientific article; zbMATH DE number 5006219 (Why is no real title available?)
- Multi-objective evolutionary algorithms for a reliability location problem
- A COMPUTATIONAL APPROACH BASED ON THE \epsilon-CONSTRAINT METHOD IN MULTI-OBJECTIVE OPTIMIZATION PROBLEMS
- Relaxation of constraints in lexicographic multiobjective programming problems
- Improvement of FPPR method to solve ECDLP
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
- Improving the min-max method for multiobjective programming
- A new scalarization technique and new algorithms to generate Pareto fronts
- A supply chain design problem with facility location and bi-objective transportation choices
- An approximation algorithm for convex multi-objective programming problems
- A multiple objective methodology for sugarcane harvest management with varying maturation periods
- A smoothing method for solving bilevel multiobjective programming problems
- Interactive decision support in radiation therapy treatment planning
- scientific article; zbMATH DE number 2159088 (Why is no real title available?)
- An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
- Non-contour efficient fronts for identifying most preferred portfolios in sustainability investing
- Efficient multiobjective optimization employing Gaussian processes, spectral sampling and a genetic algorithm
- Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations
- A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems
- Computationally efficient approach for solving lexicographic multicriteria optimization problems
- On approximating weakly/properly efficient solutions in multi-objective programming
- Outer branching: how to optimize under partial orders?
- A multi-criteria approach for hospital capacity analysis
- New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach
- The modified objective-constraint scalarization approach for multiobjective optimization problems
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems
- A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets
- A revised Pascoletti-Serafini scalarization method for multiobjective optimization problems
- Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems
- A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
- An exact algorithm for biobjective mixed integer linear programming problems
- A combined scalarizing method for multiobjective programming problems
- Linear fractional multi-objective optimization problems subject to fuzzy relational equations with a continuous Archimedean triangular norm
- An approximation algorithm for multi-objective optimization problems using a box-coverage
- An algorithm for quadratically constrained multi-objective quadratic fractional programming with pentagonal fuzzy numbers
- Slack-based generalized Tchebycheff norm scalarization approaches for solving multiobjective optimization problems
- A modified direction approach for proper efficiency of multiobjective optimization
This page was built for publication: Improved \(\varepsilon\)-constraint method for multiobjective programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1014011)
