Scribd
Upload
23 views

Bop Midterm - Solutions

The optimal solution to the linear program is: 1) X1 = 0, X2 = 4, X3 = 2, S1 = 0, S2 = 0, S3 = 1, with an optimal objective value of 14. 2) Constraints 1 and 2 are binding at optimality, while constraint 3 is inactive.

Uploaded by

Amine Benattouch
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
23 views

Bop Midterm - Solutions

The optimal solution to the linear program is: 1) X1 = 0, X2 = 4, X3 = 2, S1 = 0, S2 = 0, S3 = 1, with an optimal objective value of 14. 2) Constraints 1 and 2 are binding at optimality, while constraint 3 is inactive.

Uploaded by

Amine Benattouch
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Mid-term Solutions-Spring 2022

Question 1:
Q1: two (we can accept “three”)
Q2: B
Q3: Unbounded
Q4: All of the above
Q5: All of the above
Q6: Certainty
Q7: Solution
Q8: Basic feasible solution

Question 2:

6 C2

5
A(0,4)
4

Z=-8
3 Z=-6

2 B(2,2)
Z=-3
1

0 O(0,0) C1 0
0 1 2 3 C(3,0) 4 5 6 7 8 9

1) The feasible region is OABC


2) The basic feasible solutions are:
3) O: X=0, Y=0
4) A: X=0, Y=4
5) B: X=2, Y=2
6) C: X=3, Y=3
7) The optimal solution is: X=0 and Y=4 , the optimal objective value is Z= -8
8) At optimality, the first constraint is binding and the second constraint is inactive
Question 3:
1)
𝑀𝑎𝑥 𝑍 = 2𝑋1 + 3𝑋2 + 𝑋3 𝑀𝑎𝑥 𝑍 = 2𝑋1 + 3𝑋2 + 𝑋3 + 0𝑆1 + 0𝑆2 + 0𝑆3
𝑋1 + 𝑋2 + 𝑋3 ≤ 6 (1) 𝑋1 + 𝑋2 + 𝑋3 + 𝑆1 = 6 (1)
𝑋1 + 𝑋2 ≤ 4 (2) 𝑋1 + 𝑋2 + 𝑆2 = 4 (2)
𝑋3 ≤ 3 (3) 𝑋3 + 𝑆3 = 3 (3)
𝑋1 , 𝑋2 , 𝑋3 ≥ 0 𝑋1 , 𝑋2 , 𝑋3 , 𝑆1 , 𝑆2 , 𝑆3 ≥ 0

TAB 0:

CB Basis X1 X2 X3 S1 S2 S3 Value Ratio


0 S1 1 1 1 1 0 0 6 6
0 S2 1 1 0 0 1 0 4 4
0 S3 0 0 1 0 0 1 3 -
c_bar 2 3 1 0 0 0 Z=0

TAB 1:

CB Basis X1 X2 X3 S1 S2 S3 Value Ratio


0 S1 0 0 1 1 -1 0 2 2
3 X2 1 1 0 0 1 0 4 -
0 S3 0 0 1 0 0 1 3 3
c_bar -1 0 1 0 -3 0 12

TAB2

CB Basis X1 X2 X3 S1 S2 S3 Value Ratio


1 X3 0 0 1 1 1 0 2
3 X2 1 1 0 0 1 0 4
0 S3 0 0 0 -1 1 1 1
c_bar -1 0 0 -1 -2 0 14

The optimal solution:


𝑋1 0
𝑋2 4
𝑋3 2
𝑆1 0
𝑆2 0
𝑆3 1
𝑍 14

2) Constraints 1 and 2 are binding, constraint 3 is inactive


Question 4:
1) Let:
* 𝑥1 , 𝑥2 , 𝑥3 𝑎𝑛𝑑 𝑥4 for the number of workers (who work 2 days) hired on days 1, 2, 3 and 4.
* 𝑦1 , 𝑦2 𝑎𝑛𝑑 𝑦3 for the number of workers (who work 3 days) hired on days 1, 2, 3.
The LP:
𝑀𝑖𝑛 250 ∗ (𝑥1 + 𝑥2 + 𝑥3 + 𝑥4 ) + 300 ∗ (𝑦1 + 𝑦2 + 𝑦3 )

Subject to :
𝑥 1 + 𝑦1 ≥ 10
𝑥 1 + 𝑥2 + 𝑦1 + 𝑦2 ≥ 15
𝑥2 + 𝑥3 + 𝑦1 + 𝑦2 + 𝑦3 ≥ 10
𝑥3 + 𝑥4 + 𝑦2 + 𝑦3 ≥ 15
𝑥4 + 𝑦3 ≥ 10
{𝑎𝑙𝑙 𝑣𝑎𝑟𝑖𝑏𝑎𝑙𝑒𝑠 ≥ 0

2) The modifications :
𝑥 1 + 𝑦1 ≤ 10
𝑥2 + 𝑦2 ≤ 10
𝑥3 + 𝑦3 ≤ 10
𝑥4 ≤ 10
{ 𝑎𝑙𝑙 𝑣𝑎𝑟𝑖𝑏𝑎𝑙𝑒𝑠 ≥ 0
3) The modifications: 250 ∗ (𝑥1 + 𝑥2 + 𝑥3 + 𝑥4 ) ≤ 300 ∗ (𝑦1 + 𝑦2 + 𝑦3 )
4) We obtain (we only change the original problem):
𝑀𝑖𝑛 250 ∗ (𝑥1 + 𝑥2 + 𝑥3 + 𝑥4 ) + 300 ∗ (𝑦1 + 𝑦2 + 𝑦3 + 4)

Subject to :
𝑥 1 + 𝑦1 + 4 ≥ 10
𝑥 1 + 𝑥2 + 𝑦1 + 𝑦2 + 4 ≥ 15
𝑥2 + 𝑥3 + 𝑦1 + 𝑦2 + 𝑦3 ≥ 10
𝑥3 + 𝑥4 + 𝑦2 + 𝑦3 ≥ 15
𝑥4 + 𝑦3 + 4 ≥ 10
{ 𝑎𝑙𝑙 𝑣𝑎𝑟𝑖𝑏𝑎𝑙𝑒𝑠 ≥ 0

You might also like