A feasibility conjecture related to the Hirsch conjecture

Front Cover
Operations Research Center, Institute of Engineering Research, University of California, 1964 - Mathematics - 28 pages
0 Reviews
A very important unsolved problem in linear programming today is the validity or nonvalidity of the conjecture which follows: Hirsch Conjecture: Let X and Y be feasible bases to the linear programming problem Y > or = O, X > or = O, IY + BX = b and let m be the rank of this system. Then the conjecture is that there exists a sequence of m feasible pivot operations that transforms the system into Y > or = O , X > or = O, (1/B)Y + IX = (1/B)b. That is to say a sequence such that each of the m - l intermediate bases is feasible.

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.

Common terms and phrases

Bibliographic information