A reduction algorithm for integer multiple objective linear programs

DOI10.1016/S0377-2217(96)00407-9zbMath0930.90079OpenAlexW1994321639MaRDI QIDQ1278795

P. Neumayer, Dietmar Schweigert

Publication date: 22 February 1999

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(96)00407-9

zbMATH Keywords

lexicographic orderefficient solutionsinteger multiple objective linear program

Mathematics Subject Classification ID

Integer programming (90C10) Multi-objective and goal programming (90C29)

Related Items (5)

Dynamic programming algorithms for the bi-objective integer knapsack problem ⋮ Towards a multi-objective performance assessment and optimization model of a two-echelon supply chain using SCOR metrics ⋮ A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems ⋮ A method for finding the set of non-dominated vectors for multiple objective integer linear programs ⋮ A reduction dynamic programming algorithm for the bi-objective integer knapsack problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for the bi-criterion integer programming problem
• A general method for determining the set of all efficient solutions to a linear vectormaximum problem
• Three algorithms for bicriteria integer linear programs
• The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program

This page was built for publication: A reduction algorithm for integer multiple objective linear programs