A reduction algorithm for integer multiple objective linear programs

DOI10.1016/S0377-2217(96)00407-9MaRDI QIDQ1278795zbMATH OpenOpenAlexFDO

Authors Dietmar Schweigert, P. Neumayer

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, https://kluedo.ub.rptu.de/frontdoor/index/index/docId/483

zbMATH Keywords

efficient solutionsinteger multiple objective linear programlexicographic order

Mathematics Subject Classification ID

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

Recommendations

• An enhanced conversion scheme for lexicographic, multiobjective integer programs
• 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
• Identifying efficient solutions in multiple objective integer monotone programs
• A dual-based algorithm for solving lexicographic multiple objective programs

Cites work

• A general method for determining the set of all efficient solutions to a linear vectormaximum problem
• An algorithm for the bi-criterion integer programming problem
• scientific article; zbMATH DE number 4085440 (Why is no real title available?)
• scientific article; zbMATH DE number 44812 (Why is no real title available?)
• scientific article; zbMATH DE number 89084 (Why is no real title available?)
• The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
• Three algorithms for bicriteria integer linear programs

Cited in

(12)

• A note on reducing the number of variables in integer programming problems
• A method for finding the set of non-dominated vectors for multiple objective integer linear programs
• Multi-objective integer programming: an improved recursive algorithm
• A simple augmented \(\epsilon\)-constraint method for multi-objective mathematical integer programming problems
• A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
• On the lexicographic centre of multiple objective optimization
• 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
• scientific article; zbMATH DE number 4137546 (Why is no real title available?)
• scientific article; zbMATH DE number 146430 (Why is no real title available?)
• scientific article; zbMATH DE number 1866915 (Why is no real title available?)
• A dual-based algorithm for solving lexicographic multiple objective programs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1278795)