APPLICATION OF GRAPHICAL METHOD IN REAL LIFE

NAME : BOOMIKA. S
ROLL NO : 22BBA119
CLASS : BBA CA (A)
SUBJECT : OPERATION RESEARCH FOR MANAGEMENT STUDIES
DEPARTMENT : MANAGEMENT SCIENCE
INTRODUCTION

A Brief introduction to linear programmin:-

Linear programming is not a programming language like C++, Java, or Visual Basic. Linear programming
can be defined as:
 “A mathematical method to allocate scarce resources to competing activities in an optimal manner when the
problem can be expressed using a linear objective function and linear inequality constraints.
 A linear program consists of a set of variables, a linear objective function indicating the contribution of each variable to the desired
outcome, and a set of linear constraints describing the limits on the values of the variables. The “answer” to a linear program is a set
of values for the problem variables that results in the best-largest or smallest value of the objective function and yet is consistent with
all the constraints. Formulation is the process of translating a real-world problem into a linear program. Once a problem has been
formulated as a linear program, a computer program can be used to solve the problem. In this regard, solving a linear program is
relatively easy. The hardest part about applying linear programming is formulating the problem and interpreting the solution.
DEFINITION & HISTORY

 Definition:-
 Linear programming is the name of a branch of applied mathematics that deals with solving optimization problems
of a particular form. Linear programming problems consist of a linear cost function (consisting of a certain number
of variables) which is to be minimized or maximized subject to a certain number of constraints. The constraints are
linear inequalities of the variables used in the cost function. The cost function is also sometimes called the
objective function. Linear programming is closely related to linear algebra, the most noticeable difference is that
linear programming often uses inequalities in the problem statement rather than equequalitie

History:-
 Linear programming is a relatively young mathematical discipline, dating from the invention of the simplex
method by G. B. Dantzig in 1947. Historically, development in linear programming is driven by its applications in
economics and management. Dantzig initially developed the simplex method to solve US Air Force planning
problems, and planning and scheduling problems still dominate the applications of linear programming. One reason
that linear programming is a relatively new field is that only the smallest linear programming problems can be
solved without a computer.
PRINCIPLES & AIMS

 Principles
 Following principles are assumed in L.P.P
 Proportionality: There exist proportional relationships between
 objectives and constraints.
 Additivity: Total resources are equal to the sum of the resources
used in individual activities.
Divisibility: Solution need not be a whole number viz decision
variable can be in fractional form.
Certainty: Coefficients of objective function and constraints are known constants and do not change viz parameters remain unaltered.
Finiteness: Activities and constraints are finite in number. Optimality: The ultimate objective is to obtain an optimum solution viz ‘maximization’ or
‘minimization’.
 Aim:-
 1. To find and know more about the importance and uses of “linear programming”.
2. To formulate a linear programming problem and solve in simplex method and dual problem
GRAPHICAL METHOD

 GRAPHICAL METHODS
 Graphical methods are useful aids to portray the results of formal statistical tests of trends. In general, the formal test procedures
can be viewed as methods that assign a probability level to the validity of the trends observed in graphs. Hence, we encourage the
use of graphics to display time series. Spreadsheet programs provide easy to use graphics, and skill with their use should be
acquired.
 The process phases of problems solving by Graphical method are:
 Draw a Cartesian coordinate system in which each decision variable is represented by an axis.
 Establish a measurement scale for each axis suitable to its associated variable.
 Draw in the coordinate system the constraints of the problem, including non-negativity (which will be the
axes themelves). Note that an inequality defines a region which will be the half plane limited by the straight
line you have to consider the restriction as an equality, while an equation defines a region that is the straight
line itself.
 The intersection of all regions determines the feasible region or solution space (which is a convex set). If this
region is not empty, it will continue with the next step. Otherwise, there is no point that satisfies all
constraints simultaneously, so the problem will not be solved, denominating not feasible
GRAPHICAL METHOD

Determine the extreme points (polygon or polyhedron vertices) that shape the feasible region. These points will be the
candidates for the optimal solution.
 Evaluate the objective function at each vertex and the optimal solution will be that (or those) which maximize (or
minimize) the resulting value
Problem-1

PROBLEM-1
A manufacturer produces two different models-X and Y of the same product Model X makes a contribution of a 50 per unit
and model Y, Rs 30 per unit, towards total profit. Raw materials, and are required for production At least 18 kg of, and 12 kg
of r must be used daily Also at most 34 hours of labour are to be utilized A quantity of 2kgofrancoded for model X and 1 kg
of, for model Y. For each of X and V, 1 kg of, it required. It takes hours to manufacture model X and 2 hours to manufacture
model Y. How many units of each model should be produced in order to maximize the profic

Solution Let us define the following desirable variables X1 and X2 number of units of model X and Y to be produced,
respectively. Then the LP model of the given problem can be written as
Maximize (total profit) Z=50X1 + 30X2
Subject to the constraints
(i) 2X1 + 4X2 ≥18
X1 + X2 ≥ 12
{These are raw materials}
ii) 3X1 + 2X2 ≤ 34
X1 + X2 ≥ 0
{Labour hours}
For solving this LP problem graphically, plotting on a graph each constraint by treating it as a linear equation. Then use
the inequality sign of each constraint to mark the feasible region (shaded area) as shown in
 Graph
 The coordinates of extreme points of the feasible region are: A = (6, 6), B = (2, 14), and C = (10, 2). The value of
the objective function at each of these points is given in Table
Extreme Point Coordinates Objective Function Value
(x1, x2) Z = 50x1 + 30x2

A (6, 6) 50(6) + 30(6) = 480

B (2, 14) 50(2) + 30(14) = 520

C (10, 2) 50(10) + 30(2) = 560

Since the maximum (optimal) value of Z = 560 occurs at the point C (10, 2), the manufacturer should produce x1 = 10
units of model X and x2 = 2 units of Y in order to yield the maximum profit of Rs 560.

 Problem 2
An advertising agency wishes to reach two types of audiences – customers with annual income greater than one lakh
rupees (target audience A) and customers with annual income of less than one lakh rupees (target audience B). The total
advertising budget is Rs 2,00,000. One programme of TV advertising costs Rs 50,000; one programme of radio
advertising costs Rs 20,000. For contract reasons, at least three programmes ought to be on TV and the number of radio
programmes must be limited to [Link] indicate that a single TV programme reaches 4,50,000 prospective customers
in target audience A and 50,000 in target audience B. One radio programme reaches 20,000 prospective customers in
target audience A and 80,000 in target audience B. Determine the media mix so as to maximize the total reach.
 Let us define the following decision variables:
 X1 and x2 = number of programmes to be released on TV and radio, [Link] the LP model
of the given problem can be expressed as:
Maximize Z = (4,50,000 + 50,000) x1 + (20,000 + 80,000) x2
Subject to the constraints
(i) 50,000x1 + 20,000x2 ≤ 2,00,000 or 5x1 + 2x2 ≤ 20 (Budget available)
(ii) x1 ≥ 3; x2 ≤ 5 (Programmes)
and x1, x2 ≥ 0
For solving this LP problem by graphical method, plot each constraint on a graph first treating it as a liner
equation. Then use inequality sign of each constraint to mark feasible solution region (shaded area) as
shown in diagram
 Graph
 The coordinates of the extreme points of feasible region are: A = (3, 0), B = (4, 0), and C = (3, 5/2). The value
of the objective function at each of these three corner points is given in Table

Extreme Point Coordinates Objective Function Value

(x1, x2) Z = 5,00,000x1 +
1,00,000x2

A (3, 0) 5,00,000(3) + 1,00,000(0)

= 15,00,000
B (4, 0) 5,00,000(4) + 1,00,000(0)
= 20,00,000
C (3, 5/2) 5,00,000(3) +
1,00,000(5/2) = 17,50,000
CONCLUSION

Since the maximum (optimal) value of Z = 20,00,000 occurs at the point B (4, 0), the agency must release, x2 = 4
programmes on TV and x2 = 0 (no programme on radio) in order to achieve the maximum reach of Z = 20,00,000
audiences.
 CONCLUSION
1. Linear programming uses a mathematical or graphical technique to find the optimal way to use limited resources.
When we have a problem that involves a variety of resource constraints, linear programming can generate the best
possible solution.
2. The linear programming technique helps to make the best possible use of available productive resources (such as
time, labour, machines etc.) In a production process, bottle necks may occur. For example, in a factory some
machines may be in great demand while others may lie idle for some time.
3. Linear programming is heavily used in microeconomics and company management, such as planning, production,
transportation, technology and other issues, either to maximize the income or minimize the costs of a production
scheme. In the real world the problem is to find the maximum profit for a certain production.