Application of Quick Simplex Method on the Dual Simplex Method (A New Approach)
N. V. Vaidya *
G. H. Raisoni College of Engineering, Nagpur, Maharashtra, India.
*Author to whom correspondence should be addressed.
Abstract
In this article, we suggest a new approach while solving Dual simplex method using Quick Simplex Method. Quick Simplex Method attempts to replace more than one basic variable simultaneously so it involves less iteration or at the most equal number than in the standard Dual Simplex Method.
This has been illustrated by giving the solution of solving Dual Simplex Method Problems.
It is also shown that either the iterations required are the same or less but iterations required are never more than those of the Dual Simplex Method.
Keywords: Basic solution, optimum solution, feasible solution, dual simplex method, key determinant, constraints, net evaluation