Revised Simplex Method

Author(s):  
Asoke Kumar Bhunia ◽  
Laxminarayan Sahoo ◽  
Ali Akbar Shaikh
Author(s):  
Y. Wang ◽  
E. Sandgren

Abstract A new linear programming algorithm is proposed which has significant advantages compared to the traditional simplex method. The search direction generated which is always along a common edge of the active constraint set, is used to locate candidate constraints, and can be used to modify the current basis. The dimension of the basis begins at one and dynamically increases but remains less than or equal to the number of design variables. This is true regardless of the number of inequality constraints present including upper and lower bounds. The proposed method can operate equally well from a feasible or infeasible point. The pivot operation and artificial variable strategy of the simplex method are not used. Examples are presented and results are compared with a traditional revised simplex method.


2017 ◽  
Vol 10 (1) ◽  
pp. 119-142 ◽  
Author(s):  
Q. Huangfu ◽  
J. A. J. Hall

1993 ◽  
Vol 13 (2) ◽  
pp. 67-73 ◽  
Author(s):  
James K Ho ◽  
R.P Sundarraj

Author(s):  
Shashi Kant Mishra ◽  
Bhagwat Ram

2011 ◽  
Vol 22 (10) ◽  
pp. 1650-1661 ◽  
Author(s):  
C. Sentelle ◽  
G. C. Anagnostopoulos ◽  
M. Georgiopoulos

2014 ◽  
Vol 60 (3) ◽  
pp. 587-608 ◽  
Author(s):  
Qi Huangfu ◽  
J. A. Julian Hall

Sign in / Sign up

Export Citation Format

Share Document