Scribd
Upload
17 views

Example: Maximization: Z X X X X M X X M X X X X, X

Uploaded by

Elif Patlak
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
17 views

Example: Maximization: Z X X X X M X X M X X X X, X

Uploaded by

Elif Patlak
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

Handout #2 – IND315 Operations Research, Fall 2022 1

1. Example: Maximization
We use the Reddy Mikks model to illustrate the two steps of the graphical procedure.
Recall the model:

Maximize (max) z = 5x1 + 4x2

Subject to (s.t.) 6x1 + 4x2 ≤ 24 (Raw material M1)


x1 + 2x2 ≤ 6 (Raw material M2)
−x1 + x2 ≤ 1 (Production relationship)
x2 ≤ 2 (Demand constraint)
x1,x2 ≥ 0 (Sign restriction)
Handout #2 – IND315 Operations Research, Fall 2022 2

2. Example: Minimization
We use the Ozark Farms Diet Problem model to illustrate the graphical procedure for a
minimization problem.
Recall the model:

min z = 0.3x1+0.9x2

s.t . x1 + x2 ≥ 800 (Demand constraint)


−0.21x1 + 0.30x2 ≥ 0 (Protein requirement)
0.03x1− 0.01x2 ≥ 0 (Fiber requirement)
x1,x2 ≥ 0 (Sign restriction)
Handout #2 – IND315 Operations Research, Fall 2022 3

3. Example: Alternative or Multiple Optimal Solutions


An auto company manufactures cars and trucks. Each vehicle must be processed in the paint shop
and body assembly shop. If the paint shop were only painting trucks, then 40 per day could be
painted. If the paint shop were only painting cars, then 60 per day could be painted. If the body
shop were only producing trucks, then it could process 50 per day. If the body shop were only
producing cars, then it could process 50 per day. Each truck contributes $300 to profit, and each
car contributes $200 to profit. Use linear programming to determine a daily production schedule
that will maximize the company’s profit.
Handout #2 – IND315 Operations Research, Fall 2022 4

4. Example: Infeasible LP
Suppose that auto dealers require that the auto company in the previous example produce at least
30 trucks and 20 cars. Find the optimal solution to the new LP.
Handout #2 – IND315 Operations Research, Fall 2022 5

5. Unbounded LP
Graphically solve the following LP:

max z = 2x1− x2

s.t. x1− x2 ≤ 1

−2x1− x2 ≥ 6 x1,x2 ≥ 0
Handout #2 – IND315 Operations Research, Fall 2022 6

6. Example:Graphic Solution LP
Figure 1 shows the graphical model of a linear program. The numbers 1,2, and 3 indicate the
constraints, and the shaded region shows the feasible region. The variables are restricted to
nonnegative values. The letters A, B, C, and D indicate four feasible corner points. Three objective
functions are under consideration, as indicated by the three lines labeled X, Y, and Z. The arrows
represent the directions of increasing objective function. Objective Y is parallel to constraint 3. In
each case, specify the location of the optimal solution. If there is more than one optimal solution,
characterize all of them.

a. Maximize X

b. Maximize Y

c. Maximize Z

d. Minimize X

e. Minimize Y

f. Minimize Z

g. Drop x1 ≥ 0 and minimize Z.

x2

3
Z 2
D
Y
1
X
C

A B
x1
Handout #2 – IND315 Operations Research, Fall 2022 7

Figure 1: Figure for Graphic Solution LP


7. Example: Reverse Graphic LP Solution
Write the constraints of the LP model whose feasible region is shown in Figure 2. (Note: Write the
constraint numbers next to each inequality)

x
2

(0,8)
4

3
1 (0,3)

2 (0,1)
x1
(5,0) (2,0) (3,0) (4,0)

(0,-5)

Figure 2: Figure for Reverse Graphic LP Solution


Handout #2 – IND315 Operations Research, Fall 2022 8

8. Example: Optimal Solutions


Consider the following LP model:

Minimize z = ax1 + bx2


Subject to − x1 + 2x2 ≤ 10 (1)
x1− 2x2 ≤ 4 (2)

x1 + x2 ≥ 4 (3)

x1 + 2x2 ≥ 12 (4)

x1 ≥ 0,x2 ≥ 0 (5)

a. Graph the feasible region of the above model.

b. Show the direction of z when a = 2 and b = 1, and find the optimum solution.

c. Show the direction of z when a = 1 and b = 3, and find the optimum solution.
Handout #2 – IND315 Operations Research, Fall 2022 9

9. Consider the following problem, where the value of k is not known for certain.

Maximize z = 2x1−x2
Subject to x1− 2x2 ≤ 2 (6)
x1 ≤ 4 (7)
kx1 + x2 ≤ 5, where k ≥ 0 (8)
x1 ≥ 0,x2 ≥ 0 (9)

Use graphical analysis to determine the values of k such that the solution x1 = 4, x2 = 1 is
optimal.

You might also like