eduzhai > Physical Sciences > Physics Sciences >

Easy Simplex (AHA Simplex) Algorithm

  • Save

... pages left unread,continue reading

Document pages: 8 pages

Abstract: The purpose of this research paperis to introduce Easy Simplex Algorithm which is developed by author. Thesimplex algorithm first presented by G. B. Dantzing, is generally used forsolving a Linear programming problem (LPP). One of the important steps of thesimplex algorithm is to convert all unequal constraints into equal form byadding slack variables then proceeds to basic solution. Our new algorithm i) solves the LPP without equalize the constraints and ii) leads to optimal solution definitely in lesser time. The goal ofsuggested algorithm is to improve the simplex algorithm so that the time ofsolving an LPP will be definitely lesser than the simplex algorithm. Accordingto this Easy Simplex (AHA Simplex) Algorithm the use of Big M method is not required.

Please select stars to rate!

         

0 comments Sign in to leave a comment.

    Data loading, please wait...
×