Sors 2105 Ga-1
Sors 2105 Ga-1
Sors 2105 Ga-1
i. Formulate a linear programming problem that determine the number of units of each model
that the organization should produce.
ii. Solve this problem graphically to determine the maximum profit, showing all your workings.
2. Use Branch and Bound Method to solve the following integer linear programming problem
𝑀𝑎𝑥 𝑍 = 2𝑋1 + 3𝑋2
Subjected to:
195𝑋1 + 273𝑋2 ≤ 1365
4𝑋1 + 40𝑋2 ≤ 140
𝑋1 ≤ 4
𝑋1 , 𝑋2 ≥ 0
3. The following table shows an assignment problem.
1 2 3 4
M1 10 6 12 8
M2 15 18 5 11
M3 17 10 13 16
M4 14 12 13 10
4. The following table shows demand, supply and transportation cost from the plants to four
demand location.
i. Use the Vogel’s approximation method to find the initial basic feasible solution
ii. Apply U-V Method to optimize the initial basic feasible solution