NAGA COLLEGE FOUNDATION, INC.

M.T. Villanueva Avenue, Naga City

College of Accountancy and Finance
Management Science

1|Ma n a ge me n t S c i e n c e
LEARNING OUTCOMES:
a. Formulate Linear Programming – Minimization Model

Additional to Maximization Model

SLACK VARIABLE
Is added to a ≤ constraint to convert it to an equation (=).
Represents unused resources.

For the pottery company example, the model constraints are:

x + 2y ≤ 40 hrs of labor
4x + 3y ≤ 120 lb of clay

The addition of a unique slack variable, s1 to the labor constraint and s2 to the constraint
for clay:
x + 2y + s 1 ≤ 40 hrs of labor
4x + 3y + s2 ≤ 120 lb of clay

The slack variables in these equations, s1 and s2 , will take on any value necessary to make
the left-hand side of the equation equal to the right-hand side.

For example, x = 5 and y = 10

x + 2y + s1 = 40 hrs of labor
5 + 2(10) + s1 = 40 hrs of labor
s1 = 15 hrs of labor
and

4x + 3y + s2 = 120 lb of clay
4(5) + 3(10) + s2 = 120 lb of clay
s2 = 70 lb of clay

Slack in Objective Function

Contributes nothing to profit because they represent unused resources. Profit is
only made after the resources are used in production.

Maximize Z = 40x + 50y + 0s1 + 0s2

Slack in decision variable

Slack can only have nonnegative values because negative resources are not
possible.
x, y, s1, s2 ≥ 0

2|Ma n a ge me n t S c i e n c e
The complete linear programming model can be written in what referred to as standard
form with slack variables as follows:
Maximize Z = 40x + 50y + s1 + s2
Subject to
x + 2y + s1 = 40
4x + 3y + s2 = 120
x, y, s1, s2 ≥ 0

Solution Summary with Slack

Point Solution Values Z Slack
A x = 0 bowls, y = 20 mugs P1,000 s1 = 0 hr, s2 = 60lb
B x = 24 bowls, y = 8 mugs P1,360 s1 = 0 hr, s2 = 0 lb
C x = 30 bowls, y = 0 mugs P1,200 s1 = 10 hr, s2 = 0 lb

Minimization Model
formulated the same basic way as a maximization problem, except for a few
minor differences

Model Construction
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.

3|Ma n a ge me n t S c i e n c e
Decision variables
x = bags of Super-ego
y = bags of crop-quick

The Objective Function

minimize Z = P6x + 3y
where
6x = cost of bags of Super-ego
3y = cost of crop-quick

Model Constraints
2x + 4y ≥ 16 lb
4x + 3y ≥ 24 lb
where
2x and 4x = the nitrogen contribution per bag of Super-gro
4y and 3y = the phosphate contribution per bag of Crop-quick

The complete model formulation for this minimization problem is

Min z = 6x + 3y
subject to
2x + 4y ≥ 16 lb of nitrogen
4x + 3y ≥ 24 lb of phosphate
x,y ≥ 0

Graphical Method
We follow the same basic steps in the graphical solution of a minimization model as in a
maximization model
Graph the constraints

4x + 3y = 24

2x + 4y =16

4|Ma n a ge me n t S c i e n c e
The Optimal Solution
a maximization problem, the optimal solution is on the boundary of the feasible
solution area that contains the point(s) farthest from the origin.
The optimal solution point in a minimization problem is also on the boundary of the
feasible solution area; however, the boundary contains the point(s) closest to the
origin (zero being the lowest cost possible)

As the objective function edges toward the origin, the last point it touches in the feasible
solution area is A.
In other words, point A is the closest the objective function can get to the origin without
encompassing infeasible points.
Thus, it corresponds to the lowest cost that can be attained

The final step in the graphical solution approach is to solve for the values of and at point
A. Because point A is on the axis, ; thus,
4(0) + 3y = 24
3y = 24
y=8

z = 6x + 3y
z = 6(0) + 3(8)
z = 24

This means the farmer should not purchase any Super-gro but, instead, should purchase
eight bags of Crop-quick, at a total cost of $24.

Surplus Variables
is subtracted from a ≥ constraint to convert it to an equation (=).
It represents an excess above a constraint requirement level.
2x + 4y – m = 16

5|Ma n a ge me n t S c i e n c e
Hypothetical example: x = 0 and y = 10
Substituting these values into previous equation yields.
2(0) + 4(10) – m = 16
- m = 16 – 40
m = 24 lb of nitrogen
24 is the extra amount of nitrogen above the minimum requirement of 16 pounds that
would be obtained by purchasing 10 bags of Crop-quick fertilizer.

4x + 3y – n = 24
As in the case with slack variables, surplus variables contribute nothing to the overall cost
of a model.
Putting additional nitrogen or phosphate on the field will not affect the farmer’s cost.
Affected → number of fertilizer purchased
Minimize Z = 6x + 3y + m + n
Subject
2x + 4y – m = 16
4x + 3y –n = 24
x,y,m,n ≥ 0

References:
Introduction to Management Science by Taylor III

6|Ma n a ge me n t S c i e n c e