Submitted by: Submitted to:

Manalansan, Clahrisse S. Maam Roma

Rivo, Lester Jay P.

LINEAR PROGRAMMING

 Linear- used to describe a relationship between two or more

variables; directly and precisely proportional.
 Programming- means making schedules or plans of activities to
undertake in the future.
 Optimum solution- solution that makes the object function as
large as possible in maximization process and small as possible in
minimization process.
 Feasible solution- set of all points in the graph satisfying the
constraint.
 Feasible Region- all points in feasible solution are located in this.

MAJOR CHARACTERISTIC:

1. objective (maximize or minimize)

2. alternative course of action
3. limited resources (constraints)
4. Relationship of variables could be expressed in terms of equation or
inequalities.

I. GRAPHICAL METHOD
Steps:

1. Represent the unknown in the problem.

2. Tabulate the data about the unknown.
3. formulate the objective function and constraint
4. Graph the constraint. Always solve for the coordinate at the point of
intersection of lines.
5. Substitute the coordinates at the vertices in the feasible region in the
objective function.
6. Formulate your decision by selecting the highest value of object if
maximization and lowest if minimization.
EXAMPLE: Pink Jin makes two products: apron and potholder. It takes
10 minutes to make an apron and 12 minutes to make a potholder. Each
apron uses 5 yards of cloth and each potholder uses 2 yard of cloth. He
has 360 minutes available for making apron and potholder and has 80
yards of cloth available. She makes P60 on each apron and P40 on each
potholder. How many apron and potholder should she make in order to
maximize profit?

STEP 1:
x= number of apron pink jin makes
y=number of potholder pink jin makes

STEP 2:

Let: Time Cloth Profit

X=no. of apron 10x 5x P60
Y=no. of potholder 12y 2y P40
360 80

STEP 3:
Maximize: Z=60x+40y

Subject to: 10x+12y ≤ 360

5x+2y ≤ 80
x ≥ 0, y ≥ 0

STEP 4:
(1) 10x+12y=360 (0,30) (36,0)
(2) 5x+2y=80 (0,40) (16,0)

COMMON SOLUTION BY ELIMINATION:

(1) 10x+12y=360 (1) 10x+2y=360
(2) 5x+2y=80 (2) -10x-4y=-160
8y= 200
y= 25
SUBSTITUTE THE VALUE OF Y:
(2) 5x+2y=80
5x+2(25) =80
5x+50= 80
5x=30
x=6
Common solution: (6,25)
STEP 5:
VERTICES Z=60x+40Yy PROFIT
(0,30) 60(0)+40(30) P1200
(16,0) 60(16)+40(0) P960
(6,25) 60(6)+40(25) P1360

STEP 6:

Decision: x=6 and y=25 and maximum z=P1360

 II. SIMPEX METHOD

Maximization Process
STEPS:

1. Set up the constraints from the conditions of the problem.

2. Convert inequality explicit constraints to equations by adding slack
variables.
3. Enter numerical coefficients and variables in the simplex table.
4. Calculate Cj and Zj values.
5. Determine the optimum column or entering variable by choosing the
most positive value in the Cj and Zj row.
6. Divide the quantity column values by the non-zero and non-negative
entries in the optimum column. The smallest quotient belongs to the
pivotal row.
7. Compute the values for the replacing row by dividing all entries by the
pivot. Enter the result in the next table.
8. Compute the new entries for the remaining rows by reducing the optimum
column entries to zero (entries in the constraint rows.)
9. Calculate Cj and Zj values. Compute also for Cj - Zj row.
10. If there is a positive entry in the Cj - Zj row, return to the step 5. The
final solution has been obtained if there is no positive value in the Cj - Zj
row.

Example as above:

Maximize: Z = 60x + 40y

Subject to: 10x + 12y ≤ 360
5x + 2y ≤ 80
x ≥ 0, y ≥ 0

Maximize: Z = 60x + 40y

Subject to: 5x + 6y ≤ 180
5x + 2y ≤ 80
x ≥ 0, y ≥ 0

Before we convert the explicit constraints to equations, we may have the option of
removing first the greatest common factor in each inequality whenever possible.

Maximize: Z = 60x + 40y + 0S1 + 0S2

Subject to: 10x + 12y + S1 = 360
5x + 2y + S2 = 80
Initial Table

Cj 60 40 0 0 Entering column - variable

Prod Qty x y S1 S2 found at the top of the optimum
0 S1 360 10 40 1 0 column
0 S2 80 5 2 0 1 Outgoing variable – variable
Zj 0 0 0 0 0 to the left of the pivotal row
Cj - Zj 60 40 0 0 Pivot – entry encircled twice
Zj = 1st row Cj ( Qty x y S1 S2)
2nd row + Cj ( Qty x y S1 S2)

Second Table
Pivotal Row Entries
Replacing Row =
Pivot
Replacing row is the row to be entered first in the second table.
To reduce the entry below the pivot to zero:
Row to be replaced = Replacing row x (-) entry above the
pivot + row to be replaced

Cj 60 60 0 0
Prod Qty x y S1 S2
0 S1 200 0 8 1 -2
60 x 16 1 2/5 0 1/5
Zj 0 60 24 0 0
Cj - Zj 0 16 0 0

Third Table

Cj 60 40 0 0
Prod Qty x y S1 S2
40 y 25 0 1 1/8 -1/4
60 x 6 1 0
Zj 0 0 0 0 0
Cj - Zj 60 40 0 0

Since the last row (Cj - Zj) has no more positive entry, then the table
III is optimum

Optimum Solution:
X=6
Y = 25
Maximum Z = 1,360