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

Agny Rosalia, Bestary (2009) OPTIMALIZATION OF LINEAR PROGRAM WITH REVISED SIMPLEX METHOD AND DUAL SIMPLEX METHOD. Undergraduate thesis, UNIVERSITAS DIPONEGORO.

Full text not available from this repository.

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

Item Type:Thesis (Undergraduate)
Subjects:Q Science > QA Mathematics
Divisions:Faculty of Science and Mathematics > Department of Mathematics
ID Code:1938
Deposited By:Mr. Matematika Admin
Deposited On:30 Nov 2009 16:13
Last Modified:30 Nov 2009 16:13

Repository Staff Only: item control page