DID YOU KNOW? DTIC has over 3.5 million final reports on DoD funded research, development, test, and evaluation activities available to our registered users. Click
HERE to register or log in.
Accession Number:
AD0610951
Title:
A FEASIBILITY CONJECTURE RELATED TO THE HIRSCH CONJECTURE,
Corporate Author:
CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER
Report Date:
1964-10-23
Abstract:
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, 1BY IX 1Bb. That is to say a sequence such that each of the m - l intermediate bases is feasible.
Supplementary Note:
DOI: 10.21236/AD0610951
Pages:
0030
Distribution Statement:
Approved for public release; distribution is unlimited. Document partially illegible.
Contract Number:
NONR-222(83)
Contract Number 2:
NSF-GP-2633
File Size:
0.92MB
