IJPAM: Volume 52, No. 5 (2009)


Namdeo W. Khobragade$^1$, Navneet K. Lamba$^2$, Pradeep G. Khot$^3$
$^{1,2}$Post Graduate Teaching Department of Mathematics
RTM Nagpur University
Nagpur (MS), 440 033, INDIA
$^1$e-mail: [email protected]
$^3$Post Graduate Teaching Department of Statistics
RTM Nagpur University
Nagpur (MS), 440 033, INDIA
e-mail: [email protected]

Abstract.In this paper, an alternative approach to the revised simplex method of linear programming is suggested. The method sometimes involves less or at the most equal number of iterations as compared to computational procedure for solving LPP on digital computer. We observed that there is change in the rule of selecting pivot vector at initial stage and thereby for some LPP it takes more number of iterations to achieve optimality. Here at the initial step we choose the pivot vector on the basis of new rules of method described below. This powerful technique is better understood by resolving a cycling problem.

Received: March 24, 2009

AMS Subject Classification: 90C05, 90C90

Key Words and Phrases: basic feasible solution, optimum solution, conventional revised simplex method

Source: International Journal of Pure and Applied Mathematics
ISSN: 1311-8080
Year: 2009
Volume: 52
Issue: 5