#TITLE_ALTERNATIVE#
Transshipment problem is one of the topics in Network Optimization Theory. The problem is to find a method of distribution in a network in order to minimize the <br /> <br /> <br /> total distribution cost. In this final project, an application to solve the transshipment problem...
Saved in:
Main Author: | |
---|---|
Format: | Final Project |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/15378 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |
id |
id-itb.:15378 |
---|---|
spelling |
id-itb.:153782017-09-27T11:43:09Z#TITLE_ALTERNATIVE# ARIYANA (NIM : 10104070); Pembimbing Tugas Akhir ; Dr. Rinovia Simanjuntak, DIAN Indonesia Final Project INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/15378 Transshipment problem is one of the topics in Network Optimization Theory. The problem is to find a method of distribution in a network in order to minimize the <br /> <br /> <br /> total distribution cost. In this final project, an application to solve the transshipment problem is developed. The algorithm used in this final project is Network Simplex, developed from Simplex Method of George Dantzig. The algorithm is chosen based on consideration that transshipment problem can be stated as linear programming and Simplex method is the most popular method in solving linear programming text |
institution |
Institut Teknologi Bandung |
building |
Institut Teknologi Bandung Library |
continent |
Asia |
country |
Indonesia Indonesia |
content_provider |
Institut Teknologi Bandung |
collection |
Digital ITB |
language |
Indonesia |
description |
Transshipment problem is one of the topics in Network Optimization Theory. The problem is to find a method of distribution in a network in order to minimize the <br />
<br />
<br />
total distribution cost. In this final project, an application to solve the transshipment problem is developed. The algorithm used in this final project is Network Simplex, developed from Simplex Method of George Dantzig. The algorithm is chosen based on consideration that transshipment problem can be stated as linear programming and Simplex method is the most popular method in solving linear programming |
format |
Final Project |
author |
ARIYANA (NIM : 10104070); Pembimbing Tugas Akhir ; Dr. Rinovia Simanjuntak, DIAN |
spellingShingle |
ARIYANA (NIM : 10104070); Pembimbing Tugas Akhir ; Dr. Rinovia Simanjuntak, DIAN #TITLE_ALTERNATIVE# |
author_facet |
ARIYANA (NIM : 10104070); Pembimbing Tugas Akhir ; Dr. Rinovia Simanjuntak, DIAN |
author_sort |
ARIYANA (NIM : 10104070); Pembimbing Tugas Akhir ; Dr. Rinovia Simanjuntak, DIAN |
title |
#TITLE_ALTERNATIVE# |
title_short |
#TITLE_ALTERNATIVE# |
title_full |
#TITLE_ALTERNATIVE# |
title_fullStr |
#TITLE_ALTERNATIVE# |
title_full_unstemmed |
#TITLE_ALTERNATIVE# |
title_sort |
#title_alternative# |
url |
https://digilib.itb.ac.id/gdl/view/15378 |
_version_ |
1820737456644816896 |