A new method for optimizing a linear function over the efficient set of a multiobjective integer program
From MaRDI portal
Publication:1753509
DOI10.1016/j.ejor.2016.02.037zbMath1403.90594OpenAlexW2291978598MaRDI QIDQ1753509
Natashia Boland, Hadi Charkhgard, Savelsbergh, Martin W. P.
Publication date: 29 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.02.037
nondominated pointsnadir pointmultiobjective integer programmingextension of the \(L\)-shape search methodoptimizing over the efficient set
Related Items (28)
An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program ⋮ A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach ⋮ Network Models for Multiobjective Discrete Optimization ⋮ A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs ⋮ Distribution based representative sets for multi-objective integer programs ⋮ Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization ⋮ Split algorithms for multiobjective integer programming problems ⋮ Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems ⋮ Holistic fleet optimization incorporating system design considerations ⋮ Optimal hierarchical clustering on a graph ⋮ OOESAlgorithm.jl: a julia package for optimizing a linear function over the set of efficient solutions for biobjective mixed integer linear programming ⋮ A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach ⋮ Optimizing a linear function over the nondominated set of multiobjective integer programs ⋮ Quantifying outcome functions of linear programs: an approach based on interval-valued right-hand sides ⋮ Optimization of a quadratic programming problem over an Integer efficient set ⋮ Parallel optimization over the integer efficient set ⋮ An exact method for solving the integer sum of linear ratios problem ⋮ Solving Multiobjective Mixed Integer Convex Optimization Problems ⋮ A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs ⋮ Representing the nondominated set in multi-objective mixed-integer programs ⋮ An improved algorithm to compute the \(\omega\)-primality ⋮ Preprocessing and cut generation techniques for multi-objective binary programming ⋮ Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs ⋮ Biobjective optimization over the efficient set of multiobjective integer programming problem ⋮ Branching with hyperplanes in the criterion space: the frontier partitioner algorithm for biobjective integer programming ⋮ Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems ⋮ GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs ⋮ Quadratic optimization over a discrete pareto set of a multi-objective linear fractional program
Cites Work
- Unnamed Item
- Optimization over the efficient set: overview
- A method for optimizing over the integer efficient set
- An all-linear programming relaxation algorithm for optimizing over the efficient set
- A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set
- Optimizing a linear function over an efficient set
- Computation of ideal and Nadir values and implications for their use in MCDM methods.
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- Multi-objective integer programming: an improved recursive algorithm
- Finding nadir points in multi-objective integer programs
- Computing the nadir point for multiobjective discrete optimization problems
- An algorithm for optimizing a linear function over an integer efficient set
- Optimizing a linear function over an integer efficient set
- The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program
- Optimization over the efficient set using an active constraint approach
- Optimizing Over the Efficient Set Using a Top-Down Search of Faces
- Optimization over the efficient set
- Benchmarking optimization software with performance profiles.
This page was built for publication: A new method for optimizing a linear function over the efficient set of a multiobjective integer program
