Development of New Technique to Solve Degeneracy in Linear Programming

R. SHAIKH, A. A. SHAIKH, S. F. SHAH

Abstract


This Paper Leads To A Technique To Solve Degeneracy Occurring In Simplex Method In Linear Programming Problems  By Presenting A   New Algorithm To Choose The Particular Leaving Variable. This Method Involves Lesser Time Than The Existing Simplex Method To Get The Exact  Required Results Of All The Non-Basic Variables Whereas, The Existing Simplex Method Doesn’t Always Show All The Required Results. Proposed  Technique  Ue/Algorithm Is Better Choice To Avoid The Confusions Of Taking Arbitrary Values To Choose Leaving Variables And Hence The Proposed Technique Is  Robust To Solve Degeneracy Linear Programming Problems


Full Text:

PDF

Refbacks

  • There are currently no refbacks.


Copyright (c) 2017 Sindh University Research Journal - SURJ (Science Series)

 Copyright © University of Sindh, Jamshoro. 2017 All Rights Reserved.
Printing and Publication by: Sindh University Press.