LAB REPORT 3

OPTIMIZATION TECHNIQUES (OT)

SUBMITTED TO: Dr. Rakhshanda

SUBMITTED BY: Registration No:

2021-IM-34

EXPERIMENT 3
TITLE

Obtain the graphical solution of the minimization type linear programming problem

using software.

THEORETICAL BACKGROUND

Linear programming (LP)

Linear Optimization may be defined as the problem of maximizing or minimizing a

linear function that is subjected to linear constraints. The constraints may be equalities
or inequalities. The optimization problems involve the calculation of profit and
loss. Linear programming problems are an important class of optimization problems,
that helps to find the feasible region and optimize the solution to have the highest or
lowest value of the function.

In other words, linear programming is considered as an optimization method to

maximize or minimize the objective function of the given mathematical model with the
set of some requirements which are represented in the linear relationship. The main aim
of the linear programming problem is to find the optimal solution.

Linear programming is the method of considering different inequalities relevant to a

situation and calculating the best value that is required to be obtained in those
conditions. Some of the assumptions taken while working with linear programming are:

The number of constraints should be expressed in the quantitative terms

The relationship between the constraints and the objective function should be linear

The linear function (i.e., objective function) is to be optimized

Components of Linear Programming

The basic components of the LP are as follows:

 Decision Variables
 Constraints
 Data
  Objective Functions

Characteristics of Linear Programming

The following are the five characteristics of the linear programming problem:

Constraints – The limitations should be expressed in the mathematical form,

regarding the resource.

Objective Function – In a problem, the objective function should be specified

quantitatively.

Linearity – The relationship between two or more variables in the function must be
linear. It means that the degree of the variable is one. [1]

Minimization Type Problem

Minimization in Linear Programming refers to optimizing the objective function to find

the smallest possible value. This could involve minimizing costs, waste, distance, or any
other quantity that needs to be reduced. For example, in a production scenario, if the
objective is to minimize production costs while meeting demand and resource
constraints, the objective function would represent the total cost of production (e.g., cost
per unit multiplied by the number of units produced for each product). The constraints
would include limitations on available resources (e.g., raw materials, labor hours) and
production capacity

PROBLEM STATEMENT

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.

SOLUTION
Decision Variables

Compost cost = x

Sewage cost = y

Objective Function

Min z = 5x + 4y

Constraints

x >= 30

y <= 40

x, y >=0

GRAPHS
COMMENTS

1. The LP model demonstrated the effectiveness of mathematical optimization

techniques in solving real-world problems. By using LP, we could efficiently
determine the least-cost blend of compost and sewage while ensuring the quality
of the fertilizer product.
2. The experiment successfully optimized the blending process of fertilizer at the
Sweet Smell Fertilizer Company. By employing LP techniques and TORA
software, we achieved a cost-effective solution that meets quality constraints.

REFERENCES

[1] https://byjus.com/maths/linear-programming/