A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs
From MaRDI portal
Publication:5139635
DOI10.1287/ijoc.2018.0851OpenAlexW2952861077WikidataQ127660055 ScholiaQ127660055MaRDI QIDQ5139635
Hadi Charkhgard, Alvaro Sierra Altamiranda
Publication date: 9 December 2020
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/f53d353d7c12a4dd0eb1d53199a1e00f732fcc4a
biobjective mixed integer linear programmingcriterion space search algorithmoptimization over efficient frontiertriangle splitting method
Related Items
An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program ⋮ A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs ⋮ Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization ⋮ OOESAlgorithm.jl: a julia package for optimizing a linear function over the set of efficient solutions for biobjective mixed integer linear programming ⋮ Quantifying outcome functions of linear programs: an approach based on interval-valued right-hand sides ⋮ Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs ⋮ Quadratic optimization over a discrete pareto set of a multi-objective linear fractional program
Cites Work
- The \(L\)-shape search method for triobjective integer programming
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
- An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
- An exact algorithm for biobjective mixed integer linear programming problems
- Finding all nondominated points of multi-objective integer programs
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- Optimization over the efficient set: overview
- A method for optimizing over the integer efficient set
- An outcome-space finite algorithm for solving linear multiplicative programming
- 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
- A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints
- Bi-objective mixed integer linear programming for managing building clusters with a shared electrical energy storage
- On nadir points of multiobjective integer programming problems
- Multi-objective branch and bound
- The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
- A new method for optimizing a linear function over the efficient set of a multiobjective integer program
- A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems
- Multi-objective integer programming: an improved recursive algorithm
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
- 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
- Primal and dual multi-objective linear programming algorithms for linear multiplicative programmes
- A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method
- A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method
- The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program
- An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
- Optimization over the efficient set using an active constraint approach
- Bicriteria Transportation Problem
- Optimizing Over the Efficient Set Using a Top-Down Search of Faces
- Multicriteria Optimization
- Optimization over the efficient set
