Algoritma simpleks p0aa masalah generalized network flow

Purwanto , Seto Eko (2003) Algoritma simpleks p0aa masalah generalized network flow. Undergraduate thesis, FMIPA UNDIP.

[img]PDF
Restricted to Repository staff only

1957Kb
[img]
Preview
PDF
18Kb
[img]
Preview
PDF
226Kb
[img]
Preview
PDF
220Kb
[img]
Preview
PDF
261Kb
[img]
Preview
PDF
738Kb
[img]PDF
Restricted to Repository staff only

862Kb
[img]
Preview
PDF
211Kb
[img]
Preview
PDF
220Kb

Abstract

Permasalahan aliran biaya minimal pada sebuah jaringan merupakan pennasalahan program linier yang disajikan dalam bentuk graph yang telah diketahui bobot masing-masing arcnya. Algorittna simpleks merupakan modifikasi dari metode simpleks untuk masalah program linier umum. Modifikasi disini adalah dalam proses perhitungan tidak menggunakan tabel simpleks, tetapi langsung pada struktur jaringannya. Masalah ini dapat diselesaikan dengan algoritma simpleks dengan cara melakukan iterasi secara berturut-turut hingga solusi optirnahwa tercapai Minimum cost flow problem at a network is linear program problems presented in the form of graph which the weight of each arc have been known . Simplex algoritlun represent the modification from simplex method for the common linear program problem. In this modification, the process of calculation do not use the simplex tables, but direct at its network structure. This problem can be finished with the simplex algorithm by doing iteration until the optimum solution reached.

Item Type:Thesis (Undergraduate)
Subjects:Q Science > QA Mathematics
Divisions:Faculty of Science and Mathematics > Department of Mathematics
ID Code:31632
Deposited By:Mr UPT Perpus 1
Deposited On:23 Nov 2011 15:45
Last Modified:23 Nov 2011 15:45

Repository Staff Only: item control page