LAST NAME: ________

FIRST NAME: ________

Industrial Engineering
Department
STUDENT ID: ________

IE 341:
Operations Research I
Fall 2021

Date: November 14, 2021 (Sunday)

Time & Duration: 10:00-11:00 (1 hour)
MAXIMUM MARKS: 25
Weight: 25%
INSTRUCTIONS:
 Answer the questions on the space provided.
 This is a closed-book and closed-notes examination.
 Non-programmable calculator and dictionaries are permitted.
 Show your detailed work for full or partial credit.
 This examination booklet should contain 6 pages in total.

Questions Q1 (8) Q2 (8) Q3 (9) TOTAL

(Max. Marks) Q1-Q3(25)

Marks
Obtained
Question # 1

A company makes four juice product using orange, grapefruit and pineapple juice.

Product Price/Liter
Orange Juice $1.00
Grapefruit Juice $0.90
Pineapple Juice $0.80
All-in-one Juice $1.10

The all-in-one juice has equal parts of orange, grapefruit and pineapple juice. Each product is produced
in a one-liter size container. On hand are 1,600 liters of orange juice, 1,200 liters of grapefruit juice and
800 liters of pineapple juice. The cost per liter is $0.5 for orange juice, $0.4 for grapefruit juice and $0.35
for Pineapple juice. In addition, the manager wants grapefruit juice to be used for no more than 30
percent of the number of containers produced. She wants the ratio of the number of containers of
orange juice to the number of containers of pineapple juice to be at least 7 to 5? Formulate a linear
programming model to determine how many containers of each product to produce tomorrow to
maximize profits.

Solution:

Let
X1 be the number of orange Juice containers produced
X2 be the number of grapefruit Juice containers produced
X3 be the number of Pineapple Juice containers produced
X3 be the number of All-in-One Juice containers

Product Price/Liter Profit

Orange Juice $1.00 (1-0.5)=$0.5
Grapefruit $0.90 (0.9-0.4)=$0.5
Juice
Pineapple Juice $0.80 (0.8-0.35)=$0.45
All-in-one Juice $1.10 (1.1-(0.5+0.4+0.35)/3=$0.683

Maximize Z= 0.5 X1 + 0.5 X2+0.45 X3+0.683 X4

Subject to

X1 +(1/3) X4≤1,600
X2 +(1/3) X4≤1,200
X3 +(1/3) X4≤800
X2 /( X1 + X2+ X3+X4) ≤0.3
X2 /X3≥ (7/5)
X1 , X2, X3, X4≥ 0
Question # 2

Consider the following linear programming model and answer the following questions.

Maximize Z = 2X 1+4X2
Subject to:
-1.4X1-X2 ≤ -70
1.4X1+X2 ≤112
X1 ≥20
X2 ≥18
X1, X2 ≥0

1- Solve the above linear programming model using graphical solution method.

For the first constraint:

When X1 =0 then X2 = 70  (0,70)
When X2 =0 then X1 = 50  (50,0)

For the second constraint:

When X1 =0 then X2 = 112  (0,112)
When X2 =0 then X1 = 80  (80,0)

For the third constraint:

X2 is always 0 and X1=20  (20,0)

For the fourth constraint:

X1 is always 0 and X2=18  (0,18)
Check the graph in the next page for the graphical solution.

2- Find the optimality range for the objective function coefficients C1 and C2.

Binding constraints are 2 & 3

0 ≤C1/C2≤1.4
If C2 is fixed to 4  0 ≤C1≤5.6
If C1 is fixed to 2  1.43≤C2≤∞

3- Compute the shadow price for -1.4X1-X2 ≤ -70? Since this constraint is not binding then the
shadow price is 0
4- List all redundant constraints. NON of them
 Optimal solution ( 20,84) and Z=$376

Feasible
Question #3

Solve the following linear programming model (Don’t use graphical solution method)

Maximize Z = 2X 1+X2
Subject to:
X 2 -X1 ≤1
X 1-2X2 ≤2
X 1, X2 ≥0

entering
variable
  x1 x2 x3 x4 RHS ratio
Z -2 -1 0 0 0  
X3 -1 1 1 0 1 -1
leaving
X4 1 -2 0 1 2 2 variable

  x1 x2 x3 x4 RHS ratio
Z 0 -5 0 0 4  
X3 0 -1 1 1 3 -3
X1 1 -2 0 1 2 -2

solution is
unbounded