A C K NOWLE D G E M E NT

With much pride & delight acknowledgement my heartfelt

sense of gratitude and indebtness to Mr. P.K Samal, H.O.D., Dept. Of
Mathematics, of U.N. College of Sc. & Tech. Adaspur for this
valuable guidance, supervision & inseparable encouragement. He has
spare most of his invaluable time on discussion, pertaining to various
aspects of study report.
I am thankful to other facuilty members of the department for
their help, in sightful comments & helpful research method.
I am equally thankful to my friends for their help, co-
operation & encouragement.
I am deeply thankful to my parents for their support,
guidance & encouragement, which enable me to carry out this study.

I am also thankful to Mr. Daitary Singh, Principal of

College for giving me opportunity to prepare the project.

Signature of the Student

 Certificate
This is to certify that Chinmayee Mohapatra a
student of +3 III year Science bearing Roll No. UNMAT14019
of U.N. (Auto) College Of Science & Technology , Adaspur,
Cuttack has successfully prepared her project paper on
“Graphical Solution L.P.P.” under my guidance for partial
fulfillment of her requirement for the +3 III year Mathematics
VI semester exam in U.N. (Auto) college of Science & Tech. ,
Adaspur, Cuttack .

This report is testimony of the work done by

her. I personally wish to get all success in her life.

Place: Adaspur

Date:13-02-17 Signature Of The Guide

 COVERING LETTER OF THE PROJECT
TO

The controller of the examination

U.N. (Auto) College of Sc. & Tech.

Adsaspur, Cuttack-754011

Sir,

I am submitting my project for 6th semester examination. Details of my

registration and postal address are given below:

Registration no. : 1402010620350341

Name : Chinmayee Mohapatra

Father’s name : Chittaranjan Mohapatra

Address : At-Kulakapada

Po-Kalapada

Ps-Bentkar

Dist-Cuttack

Pin-754112
 DECLAIRATION

I Chinmayee Mohapatra, do here by declare that the study report

submitted by me to the Department of Mathematics, U.N(Auto)
college of Science & Technology, Adaspur, Cuttack is nothing. But
the outcome of my science work study on “Graphical Solution of
L.P.P.” .

All the data and analytical statement being stated in the project
that is submitted by me accepted as fully authenticate and genuine.
The findings and observation are a part of authenticates work.

Chinmayee Mohapatra

+3 3rd Year Science

Mathematics honours

Roll no.-UNMAT14019

Regd no.-1402010620350341
 CONTENTS

1. DEFINITION

2. INTRODUCTION

3. DEFINITION OF DIFERENT TERMS

4. TYPES OF L.P.P.

5. ABOUT GRAPHICAL METHOD

6. PROCEDURE

7. METHODS TO DRAW LINE

8. EXAMPLES
Graphical
Solution of
L.P.P.
DEFINITION:

A L.P.P. include a set of simultaneous linear equation or inequalities

represent the conditions of the problem and linear function with expresses the
objective function of the problem.

 The linear function which is to be optimized is called the objective

function and the condition of the problem expressed as simultaneous.
Linear equation or inequality as known as constraints.

INTRODUCTION

The development L.P.P. has been ranked among the most important scientific
advances of the mid 20th century. Today it is a standard tool that has saved
many thousand or millions of dollars for most companies or business of even
moderate size in the various industrialize countries of the world and its use in
other sectors of society has been spreading rapidly. The L.P.P. was formulated
by the scientist George Dantzig. The term ‘Linear’ means that all the
relationship in the term ‘programming’ refers to the process of determining a
particular programming or plan or action.

A major proportion of all scientific computation on computer is

devoted to the use of L.P.P.

DEFINITIONS OF DIFFERENT TERMS THAT ARE USE IN L.P.P.

(a) Feasible Solution:

Case-I: A Feasible solution to a system of Linea equation is the set of Non-

negative values of the variables which satisfies the given equations.

Case-II: A feasible solution to L.P.P. is the set up Non -ve of the variables
which satisfies the constraints of the L.P.P.
 (b) Optimum Solution:

It’s also called as optimal solution. A feasible solution to a L.P. problem is said
to be optimum or optimal solution. If it is also optimizes the objective function
of the problem.

(c) Basic Feasible Solution:

A feasible to a L.P.P. in which the vector associated to the non-zero variables

are L.I. is called a Basic Feasible solution.

TYPES OF LINEAR PROGRAMMING PROBLEM

There are two methods which are used in L.P.P.:

(i) Graphical Method

(ii) Simplex Method

ABOUT GRAPHICAL METHOD

If the objective function z is a function of two variables only then the problem
can be solved by using Graphical Method.

Procedure of Graphical method:

Step-I:

First of all we consider the constraints as equalities.

Step-II:

Then we draw the lines in the plane corresponding to each equation

obtained in Step-I and non-restrictions.

Methods to Draw the Line:

Putting x0=0 in the equation of a line find x1 and then putting x1=0, find
x2. Thus we get two points on the axis the line is drawn by jointing these points.
Step-III:

The we find the Feasible region or permissible region for the values of
the variables which is the region bounded by the lines drawn in the Step-II. For
which we produced as follows. Substitutiong the origin(i.e. x1=0, x2=0) in the
in equality. If it is satisfied then the origin starting from the line and containing
the origin, we find the regions corresponding to all the inequalities. Then the
region common to all the regions as the feasible region or permissible region.
For this value of the variables. The Feasible region as shaded (III).

Step-IV:

In the last step we find a point to the F.R. obtained in the Step-III
which gave the optimum value of z. For this we draw the line through the origin
corresponding to z=0. Then for the maximization problem, the extreme point of
the permissible region which is at most distance from the line z=0 and for the
minimization problem the extreme point of Feasible region which is nearest to
the line z=0 gives the optimum value of z. To obtain this extreme point of the
feasible region which gives the optimum value of z, we draw lines parallel to
the line z=, the farthest extreme point is the vertex of the feasible region through
which one of the parallel lines passes gives the omptimum value of z.

* If there is no feasible solution in a problem then the problem has no solution.

EXAMPLES:

Solve the L.P.P. by graphical method:

max(𝑧) = 5𝑥1 + 7𝑥2
𝑠. 𝑡. 𝑥1 + 𝑥2 ≤ 4

3𝑥1 + 8𝑥2 ≤ 24

10𝑥1 + 7𝑥2 ≥ 35
& 𝑥1 , 𝑥2 ≤ 0
Solution:

Given that the L.P.P is;

max(𝑧) = 5𝑥1 + 7𝑥2

𝑠. 𝑡. 𝑥1 + 𝑥2 ≤ 4

3𝑥1 + 8𝑥2 ≤ 24

10𝑥1 + 7𝑥2 ≥ 35

& 𝑥1 , 𝑥2 ≤ 0

We solve the L.P.P. by using Graphical method as follows.

Step-I:

First of all we consider the constraint as equalities,

𝑥1 + 𝑥2 = 4 … … … (1)

3𝑥1 + 8𝑥2 = 24 … … (2)

10𝑥1 + 7𝑥2 = 35 … … (3)

Step-II:

Now we draw the lines obtained in Step-II in two dimensional plane.

Method to Draw Lines:

It can be seen that the points (4,0), (0,4) lies on line-1.

Similarly the points (8,0), (0,3) lies on the line-2.

The points (3.5,0), (0,5) lies on line-3.

The line is draw by joining these points on the axises.

Step-III:

The shaded region in the figure is the permissible region for the values
of the variables x1 & x2.

Step-IV:

From the figure, It’s cleared region with vertices.

0(0,0), A(3.5,0), B(2.3, 1.7), C(1.5, 2.4) & D (0,3) respectively.

At origin 0(0,0)

Z=(5.0) + (7.0) = 0

At A(3.5,0)

Z= (5 X 3.5) + (7 X 0) = 17.5

At B(2.3, 1.7)

Z= (5 X 2.3) + (7 X 1.7) = 23.7

At C(1.5, 2.4)

Z= (5 X 1.5) + (7 X 2.4) = 22.2

At D(0, 3)

Z= (5 X 0) + (7 X 3) = 21

∴ z is maximum at (2.3, 1.7) i.e. z is maximum at Bx1 = 2.3, x2=1.7,

max(z)=23.7