Operations 4P41 Homework I (FALL 2021)

Due : Sunday, OCTOBER 24, 2021 at 8:00 pm (St. Catharines time)

1. Consider the following linear programming problem:

Max 3 A +3 B
s . t .2 A+ 4 B≤ 12
6 A+ 4 B≤ 24
A, B ≥ 0
a) Find the optimal solution using the graphical solution procedure.
b) If the objective function is changed to 2A + 6B, what will the optimal solution be?
c) How many extreme points are there? What are the values of A and Bat each extreme
point?

2. The St. Catharines Hardcore Company desires to blend a new mixture comprising 40% tin, 35%
zinc, and 25% lead from several available alloys having the following properties:

Alloy
Property 1 2 3 4 5
% of Tin 60 25 45 20 30
% of Zinc 10 15 45 40 50
% of Lead 30 60 10 40 20
Cost ($/lb) $22 $20 $25 $24 $27

The objective is to determine the proportions of these mixtures that should be blended to
produce the new mixture at a minimum cost.

a) Formulate a linear programming model for this problem.

b) Put your formulation into standard form.

3. Given the system of equations

X 1 + X 2+ X 3 + X 4 =8

2 X 1− X 2+ 3 X 3+ 2 X 4=17

4 X 1 + X 2−5 X 3+ 3 X 4 =7

Set X 4=0 and solve for X 1 , X 2 , X 3 using the identity matrix method (Gauss-
Jordan).
 4. Solve the following problems and draw conclusions based on your results.

Max Z=x 1 +2 x2 +3 x 3
s . t .2 x 1+ x2 + x 3 ≤ 1
5 x 1+7 x 2 +4 x 3 ≥15
5 x 1+7 x 2 +4 x 3 ≥2
x1, x2 , x3≥ 0

5. Consider the linear programming problem given below.

Max Z=5 x 1 +6 x 2+ 4 x 3
s . t .3 x 1 +4 x 2 +2 x3 ≤ 120
x 1+ 2 x 2 + x 3 ≥ 50
x 1+ 2 x 2 +3 x3 ≥ 30

x1 , x2 , x3 ≥ 0

The optimal simplex tableau is as follows:

X1 X2 X3 S1 S2 S3
Basic CB 5 6 4 0 0 0
S3 0 0 4 0 -2 7 1 80
X3 4 0 2 1 -1 3 0 30
X1 5 1 0 0 1 -2 0 20
Zj 5 8 4 1 2 0 220
C j−Z j 0 -2 0 -1 -2 0
Note: The A j’s are not needed to solve this problem.

a) Find the range of c 1∧c 2

b) Find the range of b 1
c) Suppose b 1 is increased to 130, what would the optimal solution and optimal
value be.
 6. Given the following linear program:

Max Z=10 x 1 +8 x2
s . t . x 1 +3 x 2 ≤ 15
4 x1 + x 2 ≤ 16
x1 , x2 ≥ 0

a) Formulate the dual linear program

b) Solve both the primal and dual graphically.
c) Solve the primal by the simplex method. Show that the optimal value of the
dual variables are, in fact, those determined in (b).