Finding a bounded mixed-integer solution to a system of dual network inequalities

Finding a bounded mixed-integer solution to a system of dual network inequalities

0.00 Avg rating—0 Votes
Article ID: iaor20102874
Volume: 36
Issue: 5
Start Page Number: 623
End Page Number: 627
Publication Date: Sep 2008
Journal: Operations Research Letters
Authors:
Abstract:

We show that using max-algebraic techniques it is possible to generate the set of all solutions to a system of inequalities xi-xj≥bij, i, j=1,…,n using n generators. This efficient description enables us to develop a pseudopolynomial algorithm which either finds a bounded mixed-integer solution, or decides that no such solution exists.

Reviews

Required fields are marked *. Your email address will not be published.