55815 Quantitative Models

Exercise 3

1. A production manager can use two types of machines to produce products: a new model
machine and an old model machine. A new model machine can produce up to 200
products a day and an old model machine, up to 150 products a day. Every product is
sold at NIS 20. The daily wage of a worker who operates a new model machine is 255 NIS,
and the daily wage of a worker who runs an old model machine is 212.5 NIS. Each worker
is attached to their machine during the working day and requires exactly one worker per
machine.
Moreover, it is known that the number of new model machines should be at least like the
number of old model machines. An inspector who inspects the operation of all machines
once a day needs one hour to test each new model machine and 40 minutes to test each
old model machine. The inspector can work up to 8.5 hours a day.

a) Formulate the problem as a linear programming problem.(decision variable, objective

function and constraints)
b) Solve the problem graphically. What is the optimal solution and the optimal value of
the objective function
c) Which constraints are binding and which are non-binding? What is the slack/surplus
of the non-binding constraints?

2. A company produces two types of covers: A and B. One meter of type A cover sells for
12 NIS, and a meter of type B cover sells for NIS 18. It is not possible to produce more
than 700 meters of cover A and more than 500 meters of cover b. In addition, the covers
production machine can not work more than five hours a day.
It is known that the production of 100 meters of type A covers requires one hour of working
time on the machine, and the production of 100 meters of type B covers requires 40 minutes
of working time on the production machine.

a) Formulate the problem as a linear programming problem.(decision variable, objective

function and constraints)
b) Solve the problem graphically. What is the optimal solution and the optimal value of
the objective function
c) Which constraints are binding and which are non-binding? What is the slack/surplus
of the non-binding constraints?

1
 Lecture 3. Introduction to linear programming

3. A factory produces two products. Each of the products goes through three different
processes. Product A requires 6 hours of processing in the first process, 4 hours in the
second process, and 8 hours in the third process. The profit per unit of product A is NIS
1,800.
Product B requires 10 hours of processing in the first process, 12 hours in the second
process, and 8 hours in the third process. The profit per unit B is NIS 2,400.
The factory can run the first process for a maximum of 72 hours a week, the second process
for a maximum of 68 hours per week, and the third process for a maximum of 68 hours
per week.
The factory is interested in a product mix that will maximize the weekly profit from both
products.

a) Formulate the problem as a linear programming problem.(decision variable, objective

function and constraints)
b) Solve the problem graphically. What is the optimal solution and the optimal value of
the objective function
c) Which constraints are binding and which are non-binding? What is the slack/surplus
of the non-binding constraints?

4. Solve the following problems using the graph method. *Problem b has a recorded solution
on the course site. Watch it, but still solve it and submit it:

a)
Max 6𝑥1 + 8𝑥2
s.t. 4𝑥1 + 8𝑥2 ≤ 48
−2𝑥1 + 4𝑥2 ≤ 12
3𝑥1 + 23 𝑥2 ≤ 24
𝑥2 ≤ 7
𝑥1 , 𝑥2 ≥ 0
b) *This problem has a recorded solution

Min 2𝑥1 + 3𝑥2

s.t. 4𝑥1 + 3𝑥2 ≥ 12
𝑥1 + 2𝑥2 ≤ 10
6𝑥 1 − 𝑥2 ≥ 0
𝑥2 ≥ 2
𝑥1 , 𝑥2 ≥ 0

Quantitative models 2 Amir Brudner

 Lecture 3. Introduction to linear programming

c)
Min 𝑥1 + 2𝑥2
s.t. 2𝑥1 + 𝑥2 ≥ 12
2𝑥 1 + 3𝑥2 ≥ 30
2𝑥 1 − 𝑥2 ≥ 0
𝑥 1 − 2𝑥2 ≥ 0
𝑥1 , 𝑥2 ≥ 0

Quantitative models 3 Amir Brudner