Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
28 views

LPP-Linear Programming Problem

This document provides an introduction to linear programming problems. It explains that linear programming involves optimizing a linear objective function subject to linear constraints, in order to allocate limited resources. It describes the requirements and procedure for forming a linear programming model. It also discusses the graphical solution method for problems with two variables, and lists some advantages and limitations of linear programming.

Uploaded by

Vasanth Kumar Boniface
Copyright
© © All Rights Reserved
28 views

LPP-Linear Programming Problem

This document provides an introduction to linear programming problems. It explains that linear programming involves optimizing a linear objective function subject to linear constraints, in order to allocate limited resources. It describes the requirements and procedure for forming a linear programming model. It also discusses the graphical solution method for problems with two variables, and lists some advantages and limitations of linear programming.

Uploaded by

Vasanth Kumar Boniface
Copyright
© © All Rights Reserved
You are on page 1/ 10

LINEAR PROGRAMMING

PROBLEM
Prepared by

VASANTH KUMAR BONIFACE


Associate Professor in Mathematics
Sri Ramakrishna College of Arts and Science
Coimbatore – 641006.
INTRODUCTION

Linear Programming Problem deal with finding the optimal allocations of


limited resources to meet given objectives. The resources may be in the form
of men, raw materials, market demand, money machines etc. The objective is
To minimize the total cost andmaximize the profit.

Linear Programming Problem deals with the optimization (Maximization or


Minimization) of a function of decision variables known as objective function, subject
To a set of linear equations or inequalities known as constraints.

Linear programming techniques are used in many industrial and economic problems.
They are applied in product mix, blending, diet, transportation and assignment problems.
Oil refineries, airlines, railways, textile industries, chemical industries, steel industries,
Food processing industries and defence establishments are also the users of this technique.
Requirements for employing LPP Techniques:

1. There should be a well defined objective function.

2. There should be alternative courses of action to choose.

3. At least some of the resources must be in a limited amount of supply, which give rise to constraints

4. Both the constraints and objective function must be linear equations or inequalitie (≤ or ≥)
Procedure for forming a LPP Model :

Step 1: Identify the unknown decision variables to be determined and assign symbols to them.

Step 2: Identify all the restrictions or constraints in the problem and express them as linear equations
or inequalities of decision variables

Step 3: Identify the objective or aim and represent it also a linear function of decision variables.

Step 4: Express the complete formulation of LPP as a general mathematical model.


Graphical method of solving a L.P.P ( Graphical solution )

LPPinvolving only two variables can be effectively solved by a


Graphical method which provides a pictorial representation of the problems and its solutions
And which gives the basic concepts used in solving general L.P.P. which may involve any finite
Variables. This method is simple to understand and easy to use.

Graphical method is not a powerful tool of linear programming as most of the practical situations
do involve more than two variables. Though graphical method can deal with any number of constraints
But since each constraint is shown as a line on a graph, a large number of lines make the graph difficult
To read.
Working Procedure for Graphical Method :

Step 1: Consider the inequality constraints as equalities. Draw the straight lines in the XOY
Plane corresponding to each equality and non – negativity restrictions.

Step 2: Find the feasible region or solution space for the variables which is the region bounded
By the lines drawn in step 1.

Step 3: Find the points of intersection of the bounded lines by solving the equations of the
Corresponding lines.

Step 4: Find the values of Z at all vertices of the permissible region.

Step 5: (i) For maximization problem, choose the vertex for which Z is maximum.
(ii) For minimization problem, choose vertex for which Z is minimum
Some more cases

The constraints generally, give region of feasible region which may be bounded or unbounded.
However, it may not be true for every problem. In general, a linear programming problem may have:

(i) a unique optimal solution

(ii) an infinite number of optimal solution.

(iii) an unbounded solution

(iv) no solution.
Advantages of Linear Programming :

1. It provides an insight and perspective into the problem environment.

2. It makes a scientific and mathematical analysis of the problem situations.

3. It gives an opportunity to the decision maker to formulate his strategies consistent with the
constraints and the objectives.

4. It deals with changing situations. Once a plan is arrived through the linear programming it can be
revaluated for changing conditions.

5. By using linear programming the decision maker makes sure that he is considering the best solution.
Limitations of Linear Programming :

1. The major limitation of linear programming is that it treats all the relationships as linear.

2. The decision variables in some LPP would be meaningful only if they have integer values..
But some times we have fractional values to the optimal solution, where only integer
values are meaningful.

3. All the parameters in the linear programming model are assumed to be constraints. But in real life
they may not be known completely or they may be probabilistic and they may be liable for changes
from time to time.

4. The problems are complex if the number of variables and constraints are quite large.

5. Linear Programming deals with only a single objective problems, whereas in real life situations,
there may be more than one objective.
THANK YOU

You might also like