OPTIMIZATION TECHNIQUES LAB

SUBMITTED TO:
Dr. Rakhshanda Naveed
SUBMITTED BY:
Reg. No: 2021-IM-02

EXPERIMENT: 03

Department of Industrial & Manufacturing Engineering

University of Engineering & Technology Lahore

1
 EXPERIMENT # 03
To determine the graphical solution of minimization, type linear programing
problem using software.

Minimization
Minimization in optimization techniques of linear programming refers to the process of finding
the smallest or minimum value of an objective function while satisfying a set of constraints. In
linear programming, minimization involves minimizing costs, time, or other factors to achieve an
optimal solution. This is typically done by formulating an objective function that needs to be
minimized, subject to certain constraints. By using mathematical methods like the simplex method,
minimization problems in linear programming can be efficiently solved.

Minimization Problem:
The Sweet Smell Fertilizer Company markets bags of manure labeled "not less than 60 lb
dry weight." The packaged manure is a combination of compost and sewage wastes. To
provide good- quality fertilizer, each bag should contain at least 30 lb of compost but no more
than 40 lb of sewage. Each pound of compost costs Sweet Smell 5$ and each pound of sewage
costs 4$. Use a graphical LP method to determine the least-cost blend of compost and sewage
in each bag.

Theory:

Problem Model:
X1 = Compost
X2 = Sewage Waste

Objective Function:
Minimization Z = 5x1 + 4x2

Constrains:
x1 + x2 >= 60
x1 >= 30
x2 <= 40

Non- Negative Variables:

x1, x2 >= 0

2
Graphical Solution:

Figure 1 step -01 Figure 1 Step 02

Figure 3 step -03

3
Figure 4 Step-04

Figure 5 Step-05

Figure 6 Step-06

4
Comments:
Overall, utilizing a graphical LP method in this scenario enables the company to make informed
decisions regarding the composition of its fertilizer bags, ensuring a balance between cost-
effectiveness and product quality.

Reference:
https://www.cuemath.com/graphical/linear-programming/