A characterisation of all feasible solutions to an integer program

DOI10.1016/0166-218X(83)90024-0zbMath0498.90062MaRDI QIDQ1171507

H. Paul Williams

Publication date: 1983

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

integer linear programmingcharacterisation of all feasible solutionsdual of Fourier-Motzkin eliminationelimination of constraintsextreme continuous solutionsreduction to single Diophantine equationseries of linear homogeneous congruences

Mathematics Subject Classification ID

Integer programming (90C10) Linear Diophantine equations (11D04)

Related Items (2)

A duality property for the set of all feasible solutions to an integer program ⋮ Duality in mathematics and linear and integer programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A duality theorem for linear congruences
• Fourier-Motzkin elimination extension to integer programming problems
• An application of mathematical logic to the integer linear programming problem
• Fourier-Motzkin elimination and its dual
• Solvability and Consistency for Linear Equations and Inequalities
• An Enumeration Algorithm for Knapsack Problems
• An Algorithm for Integer Linear Programming: A Combined Algebraic and Enumeration Approach

This page was built for publication: A characterisation of all feasible solutions to an integer program