Scribd
Upload
4 views3 pages

Optimization Usi

The document explains the Graphical Method for solving Linear Programming Problems (LPP) with two decision variables, detailing the procedure from problem formulation to identifying the optimal solution. It includes a mathematical formulation and a practical example involving a company producing two products to maximize profit. The conclusion emphasizes the method's utility in various decision-making scenarios.

Uploaded by

tanisha.verma.070121
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
4 views3 pages

Optimization Usi

The document explains the Graphical Method for solving Linear Programming Problems (LPP) with two decision variables, detailing the procedure from problem formulation to identifying the optimal solution. It includes a mathematical formulation and a practical example involving a company producing two products to maximize profit. The conclusion emphasizes the method's utility in various decision-making scenarios.

Uploaded by

tanisha.verma.070121
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Optimization Using Graphical Method in Linear

Programming (LPP)
1. Definition
Linear Programming (LP) is a mathematical technique used to maximize or minimize a linear
objective function subject to linear constraints. The Graphical Method is applicable when there
are two decision variables, allowing us to visualize constraints and determine the feasible
region.

2. Procedure for Solving LPP Using Graphical


Method
1. Formulate the Problem

o Identify the decision variables (e.g., x 1 , x 2).


o Define the objective function (maximize or minimize).
o List the constraints in the form of linear inequalities.
2. Plot the Constraints on a Graph

o Convert inequalities into equalities and plot the boundary lines.


o Identify whether each inequality represents a region above or below the line.
3. Determine the Feasible Region

o The intersection of all constraint regions forms the feasible region, which
represents all possible solutions.
4. Identify Corner Points (Vertices)

o Find the points where constraint lines intersect. These are the corner points of
the feasible region.
5. Evaluate the Objective Function at Each Corner Point

o Compute the objective function value at each vertex of the feasible region.
6. Choose the Optimal Solution

o Maximization: The point with the highest objective function value is optimal.
o Minimization: The point with the lowest objective function value is optimal.
7. Check Special Cases

o If the feasible region is unbounded, check if an optimal solution exists.


o If the constraints are infeasible, there is no solution.
o If multiple points give the same optimal value, there are multiple optimal
solutions.

3. Mathematical Formulation
A standard Linear Programming Problem (LPP) is given by:

Objective Function
Z=c 1 x 1 +c 2 x 2

where c 1 , c2 are coefficients to be optimized (maximize or minimize).

Constraints
a 1 x 1+ b1 x 2 ≤C 1 a 2 x 1+ b2 x2 ≤C 2 x 1 , x 2 ≥ 0 ( Non-negativity constraints )

4. Example of Graphical LPP


Problem Statement
A company produces two products: P1 and P2.
 Each unit of P1 requires 2 hours of labor and 3 kg of material.
 Each unit of P2 requires 4 hours of labor and 2 kg of material.
 The company has 16 hours of labor and 12 kg of material available.
 Profit per unit: P1 = ₹3, P2 = ₹5.
Formulate and solve the LPP to maximize profit.

Step 1: Define Decision Variables


Let:
 x 1 = number of units of P1
 x 2 = number of units of P2

Step 2: Write the Objective Function


Maximize:
Z=3 x1 +5 x 2

Step 3: Define the Constraints


1. Labor Constraint: 2 x1 + 4 x 2 ≤ 16
2. Material Constraint: 3 x 1+2 x 2 ≤ 12
3. Non-Negativity Constraints: x 1 ≥ 0 , x 2 ≥ 0
Step 4: Plot the Constraints on a Graph
 Convert inequalities into equalities and plot:
o 2 x1 + 4 x 2=16 ⟹ (x-intercept = 8, y-intercept = 4)
o 3 x 1+2 x 2=12 ⟹ (x-intercept = 4, y-intercept = 6)

Step 5: Find the Feasible Region


 The intersection of shaded areas from the constraints forms the feasible region.
Step 6: Identify the Corner Points
Corner points are:
1. (0, 4) from 2 x1 + 4 x 2=16.
2. (4, 0) from 3 x 1+2 x 2=12.
3. (3, 2) (intersection of both constraint lines).
Step 7: Evaluate the Objective Function
Z=3 x1 +5 x 2

 At (0,4): Z=3 ( 0 ) +5 ( 4 )=20 .


 At (4,0): Z=3 ( 4 ) +5 ( 0 )=12.
 At (3,2): Z=3 ( 3 ) +5 ( 2 )=19.

Step 8: Choose the Optimal Solution


The maximum profit is ₹20 at (0,4), meaning the company should produce 4 units of P2 and 0
units of P1 for maximum profit.

5. Conclusion
 Graphical LPP is a simple method to find the optimal solution for two-variable linear
programming problems.
 It involves plotting constraints, identifying the feasible region, and evaluating the
objective function at corner points.
 The method helps in decision-making problems in manufacturing, finance,
transportation, and resource allocation. 🚀

You might also like