0% found this document useful (0 votes)
11 views9 pages

Introduction To Linear Programming Sayak

good

Uploaded by

Sayak Jana
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
Download as pptx, pdf, or txt
0% found this document useful (0 votes)
11 views9 pages

Introduction To Linear Programming Sayak

good

Uploaded by

Sayak Jana
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1/ 9

Introduction to

Linear
Programming
Linear programming is a mathematical optimization
technique used to find the best solution to a problem with a
specific set of constraints. It involves maximizing or
minimizing a linear objective function while satisfying a set
of linear inequalities.
by Sayak Jana
Graphical Method Overview

1 Plot Constraints
Visualize the feasible region by graphing the linear
constraints as lines or inequalities.

2 Identify Feasible Region


The feasible region is the area where all constraints
are satisfied, usually a polygon.

3 Optimize Objective
Determine the optimal solution by finding the point in
the feasible region that maximizes or minimizes the
objective function.
Identifying the Feasible Region
Constraints Graphical Representation Corner Points

The feasible region is defined The corner points of the


by the set of linear Each constraint is represented feasible region are the
constraints, such as resource as a line or inequality on the potential optimal solutions
limitations or production graph, and the feasible region that must be evaluated to find
requirements. is the area where all the true optimum.
constraints intersect.
Determining the
Objective Function
1 Objective Function 2 Coefficients
The coefficients in the
The objective function objective function
is a linear equation represent the
that represents the contribution of each
quantity to be variable to the overall
maximized or objective.
minimized, such as
profit or cost.

3 Optimization
The goal is to find the point within the feasible region
that results in the highest (or lowest) value of the
objective function.
Locating the Optimal
Solution
Feasible Region
Identify the feasible region by graphing the constraints.

Objective Function
Determine the objective function to be maximized or minimiz

Optimal Point
The optimal solution is the point in the feasible
region that optimizes the objective function.
Sensitivity Analysis
Changing Varying Coefficients
Constraints
Sensitivity analysis It also looks at how the
examines how the objective function value
optimal solution changes when the
changes when the coefficients in the
constraints are objective function are
modified. altered.

Robust Solutions
Sensitivity analysis helps identify solutions that are
stable and resilient to changes in the problem
parameters.
Advantages of the Graphical
Method

Visual Representation
The graphical method provides a visual representation of the problem, making it
easier to understand and interpret.

Intuitive Approach
The graphical method is an intuitive approach that allows for easy identification of the optimal solution.

Simplicity
The graphical method is a relatively simple technique that can be applied to
problems with two or three variables.
Limitations and Extensions

Limitation Extension

Applicable only to problems For higher-dimensional


with two or three variables problems, the simplex
method or other numerical
techniques are required
Graphical analysis can be Computer-based
challenging for complex optimization software can
problems handle more complex
problems
Limited to linear Extensions exist for
programming problems nonlinear programming,
integer programming, and
other optimization
techniques
Conclusion
1 Powerful 2 Limitations and
Technique Extensions
The graphical method While the graphical
is a powerful method has its
technique for solving limitations, it can be
linear programming extended and
problems, providing a combined with other
visual and intuitive optimization
approach. techniques for more
Ongoing Importance complex problems.
3
Linear programming and optimization techniques
remain crucial tools in various fields, from business to
engineering, to solve real-world problems.

You might also like