MENYELESAIKAN PROGRAM PECAHAN LINEAR DENGAN MENGGUNAKAN PROGRAM DINAMIS MAJU

Simple item page
dc.contributor.authorLiandra, Suci Oktavi
dc.date.accessioned2025-01-17T08:00:06Z
dc.date.available2025-01-17T08:00:06Z
dc.date.issued2023-12
dc.description.abstractThis final project discusses the solution of fractional linear programming using dynamic programming forward methods. The solution to this problem is to find the optimal solution of the fractional linear programing by changing the fractional objective function to an approximation function using the simplified method, followed by using the simplex method until the optimal solution is obtained. Then, the optimal solution is found using the dynamic programming forward method. It can be concluded that the dynamic programming forward method produces better solution compared to the approximation of objection function methods.
dc.description.sponsorshipFakultas Matematika dan Ilmu Pengetahuan Alam Universitas Riau
dc.identifier.citationPerpustakaan
dc.identifier.otherElfitra
dc.identifier.urihttps://repository.unri.ac.id/handle/123456789/11531
dc.language.isoen
dc.publisherElfitra
dc.subjectFractional linear programming
dc.subjectsimplex method
dc.subjectdynamic programming
dc.titleMENYELESAIKAN PROGRAM PECAHAN LINEAR DENGAN MENGGUNAKAN PROGRAM DINAMIS MAJU
dc.typeArticle

Files

Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Suci Oktavi Liandra_compressed.pdf
Size:
160.98 KB
Format:
Unknown data format
Download

Collections

Mathematics