National University of Modern Languages

(NUML)
Rawalpindi Campus
Department of Engineering and Computer Sciences

Operation Research

Lab. Manual

Prepared by:

Engr. Mazahir Hussain

mazahir.hussain@numl.edu.pk

Operational Research Lab Manual Page 1

Lab Experiment No. 2
Introduction to Linear Programming Problems (LPP) and its examples
using Tora.

Literature Review:

INTRODUCTION TO LINEAR PROGRAMMING PROBLEMS

Linear programming uses a mathematical model to describe the problem of concern. The
adjective linear means that all the mathematical functions in this model are required to be linear
functions. The word programming does not refer here to computer programming; rather, it is
essentially a synonym for planning. Thus, linear programming involves the planning of activities
to obtain an optimal result, i.e., a result that reaches the specified goal best (according to the
mathematical model) among all feasible alternatives.
Introduction:
The mathematical model which tells to optimize (minimize or maximize) the objective function
Z subject to certain condition on the variables is called a Linear programming problem (LPP).
Linear Programming Problems (LPP)

The standard form of the linear programming problem is used to develop the procedure for
solving a general programming problem.

A general LPP is of the form

Max (or min) Z = c1x1 + c2x2 + … +cnxn
x1, x2, ....xn are called decision variable.

MATHEMATICAL FORMULATION OF LINEAR PROGRAMMING

PROBLEMS

There are mainly four steps in the mathematical formulation of linear programming problem as a
mathematical model. We will discuss formulation of those problems which involve only two
variables.

Operational Research Lab Manual Page 2

 i. Identify the decision variables and assign symbols x and y to them. These decision
variables are those quantities whose values we wish to determine.
ii. Identify the set of constraints and express them as linear equations/inequations in terms
of the decision variables. These constraints are the given conditions.
iii. Identify the objective function and express it as a linear function of decision variables. It
might take the form of maximizing profit or production or minimizing cost.
iv. Add the non-negativity restrictions on the decision variables, as in the physical
problems, negative values of decision variables have no valid interpretation.

GRAPHICAL METHOD SOLUTION OF LINEAR PROGRAMMING

PROBLEMS

The graphical method is applicable to solve the LPP involving two decision variables x1, and x2,
we usually take these decision variables as x, y instead of x1, x2. To solve an LPP, the graphical
method includes two major steps.

i. The determination of the solution space that defines the feasible solution (Note that the
set of values of the variable x1, x2, x3,....xn which satisfy all the constraints and also the
non-negative conditions is called the feasible solution of the LPP).
ii. The determination of the optimal solution from the feasible region.
iii. There are two techniques to find the optimal solution of an LPP. Corner Point Method
and ISO- PROFIT (OR ISO-COST).

Some Exceptional Cases

We may come across LPP which may have no feasible (infeasible) solution or may have
unbounded solution. If the intersection of the constraints is empty and the problem has no
feasible solution. Therefore the given L.P.P has no solution.

COMMENTS, OBSERVATIONS & REMARKS:

Operations research proved to be quite difficult at the beginning, after the first lab session a
much clearer picture regarding operations Research and the methods used in Operations

Operational Research Lab Manual Page 3

Research was presented. Lab session 2 proved to be extremely helpful as this lab reinforced all
the ideas presented in lab session 1.
The Graphical solution proved to be challenging at first but then after solving problems it
became very clear that Graphical solution of a Linear Programming Problem is an efficient way
to find the optimum solution to a problem.
CONCLUSIONS:
The graphical method of solving an LPP is possible only if there are two decision variables (say
x and y). This method is not suitable if there are three or more decision variables. In this case,
there is a powerful method called 'simplex method'. The wide usage of liner programming helps
in business and economics, to use the resources available in a planned and economical way. We
have just learnt the basics of LPP; there is in fact a lot to learn. A lot of research work is carried
all over the world which is based on LPP.
There are a few limitations of linear programming

i. Linear programming is applicable only to problems where the constraints and objective
function are linear i.e., where they can be expressed as equations which represent straight
lines. In real life situations, when constraints or objective functions are not linear, this
technique cannot be used.
ii. Factors such as uncertainty, weather conditions etc. are not taken into consideration.

Example:
A company owns a small paint factory that produces both interior and exterior paints for whole
sale distribution; Basic raw material A & B are used. The daily requirements are shown in the
table.
Market survey shows that the daily demand for I.P cannot exceed the E.P by more than 1 ton.
The survey also revealed that the maximum demand for I.P is limited to 2 ton only. The whole
sale price per Ton is 3000 for exterior paint and 2000 for interior paint.

Exterior Paint Interior Paint Maximum daily

(E.P) (I.P) availability (Tons)
Raw Material, M1 1 2 6
Raw Material, M2 2 1 8
Profit Per ton 3000 2000

Operational Research Lab Manual Page 4

Solution:
1- Assume that X1 = Exterior paint & X2 = Interior paint

2- Objective Function:

Maximize Profit: Z= 3000 Xe + 2000 Xi

3- Constraints:

X1 + 2X2 ≤ 6 --- 1
2X1 + X2 ≤ 8 --- 2
X2 ≤ X1 + 1 --- 3
X2 ≤ 2 --- 4

4- Applying Non-Negativity Restrictions

X1, X2 ≥ 0

5- Solving equations 1 & 2 simultaneously to get

X1 = 10/3, X2 = 4/3

6- Maximum Profit:

Substituting values into Z to get

Z= 3000(10/3) + 2000(4/3) = 12666.67

Solution Steps by using Tora:

Open Tora Software
Click on “Click Here” as shown below.

Operational Research Lab Manual Page 5

 Then click on “Linear Programming”
Set values of Decimal notation as per your requirement as shown below and click “Go to Input
Screen ”

Set “Problem Title”, “No of variables” and “No. of Constraints” as per your requirement and
press “Enter”
As per data of Example 1,we have to Enter following values in Tora as shown below:

Operational Research Lab Manual Page 6

 After putting values, click on “Solve menu” and “Save the Data”.
Further click on “Solve Problem” and select “Graphical”
Click on “Go to Output Screen”
Click on “Click here to graph LP in one stroke”.
It will calculate and give you optimal Solution!

Lab Task: Find Optimal Solution of the following problem using Tora and prepare a lab report
on it!

Problem: “Al-Hussain Leather Manufacturers Limited” produces two types of belts, Belt A &
Belt B, Each type requires 1 square yard of leather. Belt B requires 1 hour of labor and Belt A
requires 2 Hour of labor.
Each week 40 Sq-Yd of Leather and 60 hours of labor are available.
Maximize the Profit if profit on B = 3 rupees and profit on A = 4 rupees.

Operational Research Lab Manual Page 7