Linear Programming Part 2

CHAPTER 2
LINEAR PROGRAMMING: GRAPHICAL

SOLUTION
PROBLEM #1
 ABC, Inc. creates 2 types of toys: car and boat. The
car is priced at P550, and the boat at P700. The wood cost of the car
is P50, while P70 for the boat. The car needs 1 hour of woodwork
labor and 1 hour of painting and assembling labor. The boat requires
2 hours of woodwork labor and1 hour of painting and assembling
labor. Cost of woodwork labor is P30 per hour, worth of painting
and assembling labor is P20 per hour. Monthly, ABC has 5000
existing hours of woodwork labor and 3000 hours of painting and
assembling labor. There is an unlimited demand for boat, while an
average demand for car is at most 2000. ABC wants to get the best
out of monthly profit.
Linear Programming Model
Maximize Z= 450+ 550
Subject to
+2
+
PROBLEM #2
A farmer is preparing to plant a crop in the spring and needs to fertilize a
field. There are two brands of fertilizer to choose from, Super-gro and Crop-quick.
Each brand yields a specific amount of nitrogen and phosphate per bag, as follows:
The farmer’s field requires at least 16 pounds of nitrogen and at least 24 pounds of
phosphate. Super-gro costs $6 per bag, and Crop-quick costs $3. The farmer wants to know
how many bags of each brand to purchase in order to minimize the total cost of fertilizing.
Graphical Solution:
The first step is to graph the equations of the two model constraints, as shown in
Figure 2.16.
Graphical Solution:
The first step is to graph the equations of the two model constraints, as shown in
Figure 2.16.
PROBLEM #3
Beaver Creek Pottery Company is a small crafts operation run by a Native
American tribal council. The company employs skilled artisans to produce clay bowls and
mugs with authentic Native American designs and colors. The two primary resources used
by the company are special pottery clay and skilled labor. Given these limited resources, the
company desires to know how many bowls and mugs to produce each day in order to
maximize profit. This is generally referred to as a product mix problem type. This scenario
is illustrated in Figure 2.1.
Graphical Solution:
Figure 2.2 is a set of coordinates for the decision variables and , on which the graph of our model
will be drawn. Note that only the positive quadrant is drawn (i.e., the quadrant where x1 and x2
will always be positive) because of the nonnegativity constraints.
Graphical Solution:
The line on the graph representing this equation is drawn by connecting these two points, as
shown in Figure 2.3. However, this is only the graph of the constraint line and does not reflect the
entire constraint.
Graphical Solution:
The area representing the entire constraint is shown in Figure 2.4.

Graphical Solution:
Plotting these points on the graph and connecting them with a line gives the
constraint line and area for clay, as shown in Figure 2.5.
Graphical Solution:
Combining the two individual graphs for both labor and clay (Figures 2.4 and 2.5) produces a graph of the
model constraints, as shown in Figure 2.6. The shaded area in Figure 2.6 is the area that is common to both
model constraints. Therefore, this is the only area on the graph that contains points (i.e., values for x1 and
x2 ) that will satisfy both constraints simultaneously.
Graphical Solution:
For example, consider the, points R S, and T in Figure 2.7. Point R satisfies both constraints; thus,
we say it is a feasible solution point. Point S satisfies the clay constraint but exceeds the labor
constraint; thus, it is infeasible. Point T satisfies neither constraint; thus, it is also infeasible.
Graphical Solution:
The solution point will be on the boundary of the feasible solution area and at one of the corners
of the boundary where two constraint lines intersect. These corners (points A, B, and C in Figure
2.11) are protrusions, or extremes, in the feasible solution area; they are called extreme points.
Graphical Solution:
Figure 2.12 shows the solution values for all three points, A, B, and C, and the
amount of profit, Z, at each point.
Summary of Graphical Solution Step
 Plot the model constraints as equations on the graph; then,

considering the inequalities of the constraints, indicate the
feasible solution area.
 Solve simultaneous equations at each corner point to find
the solution values at each point.
 Substitute these values into the objective function to find
the set of values that results in the maximum Z value.

Linear Programming Part 2

Uploaded by

Linear Programming Part 2

Uploaded by

CHAPTER 2

LINEAR PROGRAMMING: GRAPHICAL

The area representing the entire constraint is shown in Figure 2.4.

 Plot the model constraints as equations on the graph; then,

You might also like