University of Juba
School of Computer Science & Information Technology
Fourth Year- Degree Program
Assignment one
Course: Operation Research
Submission Date 13th December, 2024
Attempt all Questions
1. Use the Simplex method to solve the Linear Programming Problem; (5 Marks)
Maximize Xo = 2x1 + 5x2
Subject x1 + 4x2 ≤ 24
3x1 + x2 ≤ 21
x1 + x2 ≤ 9
x1, x2 ≥ 0
2. Use the two phase method to solve the Linear Programming Problem; (5 Marks)
Minimize Xo = 5x1 + 3x2
Subject 2x1 + 2x2 ≤ 1
x1 + 4x2 ≥ 6
x1, x2 ≥ 0
3. Use the M-Techniques method to solve the Linear Programming Problem (5 Marks)
Minimize Xo = -3x1 + x2 + x3
Subject x1 - 2x2 + x3 ≤ 11
-4x1 + x2 + 2x3 ≥ 3
2x1 – x3 =-1
x1, x2 , x3 ≥ 0
1|Page
4. Use the graphical solution technique to find the optimal solution to the model (5 Marks)
Max Xo = 3x1 + 2x2
Subject 2x1 + 2x2 ≤ 5
2x1 + x2 ≤ 4
x1 + 2x2 ≤ 4
x1 , x2 ≥ 0
5. Malakia Police Station employs 30 police officers. Each officer works for 5 days per week.
The crime rate fluctuates with the day of week, so the number of the police officers required
each day depends on which day of the week it is: Monday, 18; Tuesday, 24; Wednesday, 25;
Thursday, 16; Friday, 21; Saturday, 28; Sunday, 18. The Police Station wants to schedule
police officers to minimize the number whose days off are not consecutive. Formulate an LP
that will accomplish this goal (5 Marks).
6. Use the Dual Simplex method to solve the Linear Programming Problem (5 Marks)
Max Xo = -2x1 - x2
Subject -3x1 - x2 ≤ -3
-4x1 - 3x2 ≤ -6
-x1 - 2x2 ≤ -3
x1 , x2 ≥ 0
2|Page
