- Alan R. Andreasen, Charles Eugene Blair, Charles R. Schwenk, Cheng F. Lee, David Morgan Gardner, Frank K. Reilly, Hans Brems, Jan K. Brueckner, Jane H. Leuthold, John E. Gilster, John Fitzgerald Due, Lanny David Arvan, Paul J. Uselding, Seymour Sudman, Walter J. Primeaux, Wayne J. Davis, William S. Hopwood
· 1981
- Anthony Vannelli, Charles D. Kolstad, Charles Eugene Blair, Clifton Brown, Florence C. Sharp, Gilbert W. Bassett, Jane H. Leuthold, Joseph E. Finnerty, K. C. Chen, K. Ravi Kumar, Karen E. Fletcher, M. Ali Khan, M. Zubaidur Rahman, Marvin Frankel, Neil A. Doherty, Ronald Clifton Rogers, Yoon Dokko
· 1984
No image available
No image available
Charles Eugene Blair, University of Illinois at Urbana-Champaign. College of Commerce and Business Administration, University of Illinois at Urbana-Champaign. Bureau of Economic and Business Research· 1982
We give simple examples of linear programs which use many iterations for the simplex algorithm, emphasizing an algebraic point of view.
No image available
No image available
It is shown that every minimal valid inequality is generated by a subadditive function which must also be additive in certain places. (Author).
No image available
Charles Eugene Blair, R. G. Jeroslow, CARNEGIE-MELLON UNIV PITTSBURGH PA MANAGEMENT SCIENCES RESEARCH GROUP.· 1976
A necessary and sufficient condition is given, for the disjunctive constraints construction to provide all valid cuts for a system of logical constraints on linear inequalities. (Author).