ON THE AVERAGE NUMBER OF STEPS OF THE SIMPLEX-METHOD OF LINEAR-PROGRAMMING

[1] ADLER I, 1981, ORC814 U CAL OP RES

[2] The Gauss-Bonnet theorem for Riemannian polyhedra [J]. TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1943, 53 (1-3) : 101 - 129

[3] BORGWARDT KH, UNPUB Z OPERATIONS R

[4] COTTLE R. W., 1968, MATH DECISION SCI, P115

[5] DANTZIG GB, 1980, SOL803 STANF U DEP O

[6] Eaves B. C., 1976, Mathematics of Operations Research, V1, P1, DOI 10.1287/moor.1.1.1

[7] Feller W., 1957, INTRO PROBABILITY TH, V1

[8] Gale D., 1951, ACTIVITY ANAL PRODUC, P317

[9] ALGORITHMS FOR SOLVING F(X)=0 [J]. COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, 1979, 32 (03) : 281 - 312

[10] HOWE R, 1980, 452 YAL U COWL F DIS

[1] ADLER I, 1981, ORC814 U CAL OP RES

[2] The Gauss-Bonnet theorem for Riemannian polyhedra [J]. TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1943, 53 (1-3) : 101 - 129

[3] BORGWARDT KH, UNPUB Z OPERATIONS R

[4] COTTLE R. W., 1968, MATH DECISION SCI, P115

[5] DANTZIG GB, 1980, SOL803 STANF U DEP O

[6] Eaves B. C., 1976, Mathematics of Operations Research, V1, P1, DOI 10.1287/moor.1.1.1

[7] Feller W., 1957, INTRO PROBABILITY TH, V1

[8] Gale D., 1951, ACTIVITY ANAL PRODUC, P317

[9] ALGORITHMS FOR SOLVING F(X)=0 [J]. COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, 1979, 32 (03) : 281 - 312

[10] HOWE R, 1980, 452 YAL U COWL F DIS