A strongly polynomial algorithm for a special class of linear programs

A strongly polynomial algorithm for a special class of linear programs

0.00 Avg rating0 Votes
Article ID: iaor19931548
Country: United States
Volume: 39
Issue: 6
Start Page Number: 955
End Page Number: 960
Publication Date: Nov 1991
Journal: Operations Research
Authors: ,
Keywords: computational analysis
Abstract:

The authors extend the list of linear programming problems that are known to be solvable in strongly polynomial time to include a class of LPs which contains special cases of the generalized transshipment problem. The result is facilitated by exploiting some special properties associated with Leontief substitution systems and observing that a feasible solution to the system, Ax=b, x≥0, in which no variable appears in more than two equations, can be found in strongly polynomial time for b belonging to some set ¦[.

Reviews

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