Metode Simpleks (Contoh soal untuk kasus maksimisasi)

This video discusses how to solve a Linear Programming example problem using the simplex method manually (without using software). The problem is: Maximize z = 8x1 + 5x2, i.e., x1 + x2 is less than or equal to 6, 9x1 + 5x2 is less than or equal to 45, x1 and x2 are nonnegative. (taken from the book Operations Research by Wayne L. Winston, page 548) Please also watch the following video: Minimum simplex method:    • Metode Simpleks (Kasus Minimisasi)   Big M method for the minimum case (involving constraints greater than or equal to)    • Metode Big M (Contoh Kasus Minimisasi)   Regards: Ramya Rachmawati, lecturer in the Mathematics Department, Faculty of Mathematics and Natural Sciences, University of Bengkulu #OnlineLectures #AtHome #FreeLearning #FreeCampus