论文信息 - Modified big-M method to recognize the infeasibility of linear programming models

Modified big-M method to recognize the infeasibility of linear programming models

This paper provides an effective modification to the big-M method which leads to reducing the iterations of this method, when it is used to recognize the infeasibility of linear systems.

Majid Soleimani-Damaneh | M. Soleimani-damaneh

[1] István Maros. A general Phase-I method in linear programming☆ , 1983 .

[2] Hanif D. Sherali,et al. Linear programming and network flows (2nd ed.) , 1990 .

[3] V. Klee,et al. HOW GOOD IS THE SIMPLEX ALGORITHM , 1970 .

[4] O. H. Brownlee,et al. ACTIVITY ANALYSIS OF PRODUCTION AND ALLOCATION , 1952 .

[5] V. Klee. A class of linear programming problems requiring a large number of iterations , 1965 .

[6] Hanif D. Sherali,et al. Linear Programming and Network Flows , 1977 .