Chapter 2 – Graphical Solution A171-Exercise

1. Identify the feasible region for the following set of constraints:

3x1 – 2x2 > 0
2 x1 – 1 x2 < 200
1 x1 < 150
x1, x2 > 0

2. Identify the feasible region and optimal solution for the linear program
Max z =2x1 + 3x2
s.t 1x1 + 2x2 < 6
5x1 + 3x2 < 15
x1, x2 > 0

3. Consider the following linear program:

MAX Z = 60A + 50B

s.t. 10A + 20B ≤ 200
8A + 5B ≤ 80
A≥2
B≥5
Solve this linear program graphically and determine the optimal quantities of A, B, and the
value of Z.

4. Worldwide Claims Processors is a company that processes insurance claims for large
national insurance companies. Most claim processing is done by a large pool of computer
operators, some of whom are permanent and some temporary. A permanent operator can
process 16 claims per day, whereas a temporary operator can process 12 per day, and on
average the company processes at least 450 claims each day. The company has 40
computer workstations. A permanent operator will generate about 0.5 claims with errors each
day, whereas a temporary averages about 1.4 defective claims per day. The company wants
to limits claims with errors to 25 per day. A permanent operator is paid $64 per day and a
temporary operator is paid 42 per day. The company wants to determine the number of
permanent and temporary operators to hire in order to minimize costs.

a. Formulate a linear programming model for this problem

b. Solve this model using graphical analysis