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.
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.
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.
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.
Download as PPT, PDF, TXT or read online from Scribd
Download as ppt, pdf, or txt
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
