Question 1

A company produces interior and exterior paint from two basic products M1 and M2;

Used quantity/ ton available quantity

exterior interior /day
M1 6 4 24
M2 1 2 6
Profit/ton 5 4
Additional constraint:

• Maximum demand for interior paint: 2 tons/day.

• The production of interior paint does not exceed that of exterior by one ton.

Give a linear program (LP) which serves to maximize profit.

Question 2

Consider the following linear program:

𝑀𝑎𝑥𝑍 = 300𝑥1 + 500 𝑥2

𝑥1 + 𝟐𝑥2 ≤ 20
2𝑥 + 𝑥2 ≤ 22
ST{ 1
𝑥1 + 𝑥2 ≤ 𝟏2
𝑥1 , 𝑥2 ≥ 0

Solve the following LP using Simplex method and specify all basic feasible solutions. Also
determine binding constraints.
Check the results graphically

Question 3
Consider the following linear program:
𝑀𝑎𝑥𝑍 = 2𝑥1 + 5𝑥2

𝑥1 = 5
2𝑥2 = 12
ST{
3𝑥1 + 2𝑥2 ≥ 18
𝑥1 , 𝑥2 ≥ 0

1. Solve the LP graphically.

2. Specify the nature of each constraint.
Question 4

The following tableau is one of the simplex tableaus obtained when maximizing the objective
function 𝑍 = 3𝑋1 + 2𝑋2 + 2𝑋3 subject to 2 technological “≤” constraints:

Cj ……… ……… ……… ……… ……… -

CB Basis X1 X2 X3 S1 S2 R.H.S
……… ……… 1 ……… 0.5 ……… 0 12.5
……… ……… ……… ……… 0.75 -0.25 0.5 ………
Zj ……… ……… ……… 1 ……… 65
C_bar ……… ……… ……… ……… ………

1) The Cj row contains:

□ [3; 2; 2; 0; 2] □ [3; 2; 2; 0; 0] □ [3; 2; 0; 0; 0]

2) C_bar (S2) is equal to:

□0 □1 □-1
3) This tableau is optimal:
□ True □ False
4) The first missing value in S1 column is:
□ 0.25 □ -1 □ 0.5
5) The optimal solution is:
□ (12.5,0) □ (12.5, 13.75) □ (12.5, 12.5)

6) The Basis column contains:

□ 𝑋1
𝑋2
□ 𝑋2
𝑋3
□ 𝑋2
𝑋1