An algorithm for the multiple objective integer linear programming problem

DOI10.1016/0377-2217(82)90182-5zbMath0477.90075OpenAlexW2065262885MaRDI QIDQ1160567

Edward L. Hannan, Dieter Klein

Publication date: 1982

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(82)90182-5

zbMATH Keywords

implementationmultiple objective integer linear programmingBalas' additive algorithmdetermination of all efficient solutionsinteger postoptimality techniques

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05)

Related Items (51)

An algorithm for the bi-criterion integer programming problem ⋮ A class of practical interactive branch and bound algorithms for multicriteria integer programming ⋮ Zero-one programming with multiple criteria ⋮ Two-machine flow shop scheduling with two criteria: maximum earliness and makespan ⋮ An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems ⋮ The \(L\)-shape search method for triobjective integer programming ⋮ Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic ⋮ Towards a multi-objective performance assessment and optimization model of a two-echelon supply chain using SCOR metrics ⋮ Unnamed Item ⋮ An algorithm for optimizing a linear function over an integer efficient set ⋮ An improved algorithm for solving biobjective integer programs ⋮ Algorithm robust for the bicriteria discrete optimization problem ⋮ Combination of MCDM and covering techniques in a hierarchical model for facility location: a case study ⋮ A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods ⋮ Algorithms for nonlinear integer bicriterion problems ⋮ A review of interactive methods for multiobjective integer and mixed-integer programming ⋮ A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs ⋮ Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ Network Models for Multiobjective Discrete Optimization ⋮ Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs ⋮ Branch-and-bound and objective branching with three or more objectives ⋮ Optimization of a linear function over an integer efficient set ⋮ A multiobjective approach for maximizing the reach or GRP of different brands in TV advertising ⋮ Effective anytime algorithm for multiobjective combinatorial optimization problems ⋮ Optimization of a quadratic programming problem over an Integer efficient set ⋮ Optimising a nonlinear utility function in multi-objective integer programming ⋮ Bicriteria integer quadratic programming problems ⋮ Disjunctive Programming for Multiobjective Discrete Optimisation ⋮ Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets ⋮ An exact and polynomial approach for a bi-objective integer programming problem regarding network flow routing ⋮ A survey of recent developments in multiobjective optimization ⋮ Efficient computation of the search region in multi-objective optimization ⋮ Multi-objective integer programming: an improved recursive algorithm ⋮ Bicriteria network flow problems: Integer case ⋮ A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems ⋮ Efficiency status of a feasible solution in the multi-objective integer linear programming problems: a DEA methodology ⋮ An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems ⋮ Optimizing a linear function over an integer efficient set ⋮ Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations ⋮ Solving the Multiple Objective Integer Linear Programming Problem ⋮ A bicriteria approach to the two-machine flow shop scheduling problem ⋮ An Algorithm For Solving Multiple Objective Integer Linear Programming Problem ⋮ A method for finding the set of non-dominated vectors for multiple objective integer linear programs ⋮ Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems ⋮ Multi-objective integer programming: a general approach for generating all non-dominated solutions ⋮ A branch and bound algorithm for mixed zero-one multiple objective linear programming ⋮ Cutting plane method for multiple objective stochastic integer linear programming ⋮ A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems ⋮ An interactive procedure for multiple objective integer linear programming problems ⋮ New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach ⋮ Multiobjective solution of the uncapacitated plant location problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multicriteria dynamic programming with an application to the integer case
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• Discrete right hand side parametrization for linear integer programs
• Theory and algorithms for linear multiple objective programs with zero–one variables
• Integer Programming Post-Optimal Analysis with Cutting Planes
• Duality, Indifference and Sensitivity Analysis inr Multiple Objective Linear Programming
• Implicit enumeration based algorithms for postoptimizing zero-one programs
• Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
• Linear multiple objective programs with zero–one variables
• Using Duality Theory for Identification of Primal Efficient Points and for Sensitivity Analysis in Multiple Objective Linear Programming
• Finding all efficient extreme points for multiple objective linear programs
• A revised simplex method for linear multiple objective programs
• Algorithms for the vector maximization problem
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables
• Multiparametric Linear Programming
• Problems and methods with multiple objective functions
• Postoptimality analysis in zero‐one programming by implicit enumeration

This page was built for publication: An algorithm for the multiple objective integer linear programming problem