Scribd
Upload
438 views10 pages

Presentation On: Operation Research

This presentation discusses linear programming and the graphical method for solving two-variable linear programming problems. It provides an example that maximizes profit subject to assembly, inspection, and storage constraints. The constraints are plotted and the feasible region is identified. The objective function is then plotted, showing the optimal solution occurs at the intersection of the inspection and storage constraints, with values of X1=9 and X2=4, yielding maximum profit of $740. Solutions to linear programs occur at corner points of the feasible region.

Uploaded by

vijay
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
438 views10 pages

Presentation On: Operation Research

This presentation discusses linear programming and the graphical method for solving two-variable linear programming problems. It provides an example that maximizes profit subject to assembly, inspection, and storage constraints. The constraints are plotted and the feasible region is identified. The objective function is then plotted, showing the optimal solution occurs at the intersection of the inspection and storage constraints, with values of X1=9 and X2=4, yielding maximum profit of $740. Solutions to linear programs occur at corner points of the feasible region.

Uploaded by

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

Presentation On

Linear Programming - Graphical Method

Presented By - Lohar Vijay Ravindra

Class - BCA -III

Roll No - 17 Sem-VI

Sub - Operation Research

Subject in Charge - Dr.S.V.DESHMUKH


Linear Programming

• Linear programming (LP) techniques consist of a sequence of steps


that will lead to an optimal solution to problems, in cases where
an optimum exists

6S-2
Graphical Linear Programming

Graphical method for finding optimal


solutions to two-variable problems
1.Set up objective function and constraints in mathematical
format
2.Plot the constraints
3.Identify the feasible solution space
4.Plot the objective function
5.Determine the optimum solution

6S-3
Linear Programming Example

• Objective - profit
Maximize Z=60X1 + 50X2
• Subject to
Assembly 4X1 + 10X2 <= 100 hours
Inspection 2X1 + 1X2 <= 22 hours
Storage 3X1 + 3X2 <= 39 cubic feet
X1, X2 >= 0

6S-4
Linear Programming Example

Assembly Constraint
4X1 +10X2 = 100

12
10
Product X2

8
6
4
2
0
0 2 4 6 8 10 12 14 16 18 20 22 24
Product X1

6S-5
Linear Programming Example

Add Inspection Constraint


2X1 + 1X2 = 22

25
20
Product X2

15
10
5
0
0 2 4 6 8 10 12 14 16 18 20 22 24
Product X1

6S-6
Linear Programming Example

Add Storage Constraint


3X1 + 3X2 = 39

25
Inspection
20
Product X2

15
Storage
Assembly
10
5
0
0 2 4 6 8 10 12 14 16 18 20 22 24
Feasible solution space Product X1

6S-7
Linear Programming Example

Add Profit Lines

25

20
Z=900
Product X2

15

10
5

0
0

14
10

12

16

18

20

22

24
Product X1
Z=300 Z=600

6S-8
Solution

• The intersection of inspection and storage


• Solve two equations in two unknowns
2X1 + 1X2 = 22
3X1 + 3X2 = 39

X1 = 9
X2 = 4
Z = $740

6S-9
Solutions and Corner Points
• Feasible solution space is usually a polygon
• Solution will be at one of the corner points

• Enumeration approach: Substituting the coordinates of each corner point


into the objective function to determine which corner point is optimal.

6S-10

You might also like