MENYELESAIKAN PERSOALAN TRANSPORTASI DENGAN KENDALA CAMPURAN

Simple item page
dc.contributor.authorSari, J. K
dc.contributor.authorKarma, A
dc.contributor.authorGamal, M. D. H
dc.date.accessioned2013-03-26T01:56:47Z
dc.date.available2013-03-26T01:56:47Z
dc.date.issued2013-03-26
dc.description.abstractA new algorithm of transportation that is more-for-less (MFL) algorithm has been used to solve transportation problems with mixed constraints. The proposed of this transportation problem is to determine how many product that should shipped from each sources to each destination. Hence each demand from each destination can be fulflled with minimum total shipping costen_US
dc.description.sponsorshipKarma, A., Gamal, M. D. Hen_US
dc.identifier.otherRangga Dwijunanda Putra
dc.identifier.urihttp://repository.unri.ac.id:80/handle/123456789/2688
dc.language.isootheren_US
dc.subjecttransportation problemen_US
dc.subjectmixed constrainten_US
dc.subjectmore-for-lessen_US
dc.titleMENYELESAIKAN PERSOALAN TRANSPORTASI DENGAN KENDALA CAMPURANen_US
dc.typeOtheren_US

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
karya ilmiah juni kartika sari.pdf
Size:
138 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Mathematics