OPTIMALIZATION OF LINEAR PROGRAM WITH REVISED SIMPLEX METHOD AND DUAL SIMPLEX METHOD

Abstract

To solve problems, operation research suggests formulation into mathematical form so-called mathematical programming where one of them is Linear Programming. Usage of standard model can lead to exact solution method guarantying solution would be fisible and optimal. Simplex method is one of exact method which is widely applicable, so there are effort revises it to make it more efficient. Variation of simplex method are revised simplex method and dual simplex method.Variation of simplex method is a modification of simplex calculation to solve problems of linear program. This project discusses variation of simplex method to solve problems of linear program standard model. Beside that, this project also compare them to see which method is the most efficient in terms of multiplication operation