Application of Linear
Programming
Optimizing real-world problems
through mathematical models
What is Linear Programming?
• • A mathematical method to optimize
(maximize or minimize) a linear objective
function.
• • Subject to constraints represented by linear
inequalities.
• • Used in decision-making processes.
Components of Linear
Programming
• • Objective Function: A formula to optimize
(e.g., profit, cost).
• • Constraints: Limitations or restrictions (e.g.,
resources, budget).
• • Decision Variables: Variables to determine
the solution.
Applications of Linear
Programming
• • Business: Resource allocation, production
planning.
• • Logistics: Supply chain optimization,
transportation.
• • Agriculture: Crop yield maximization.
• • Finance: Investment portfolio optimization.
• • Healthcare: Staff scheduling, resource
allocation.
Example 1 - Production Planning
• Scenario: A factory produces two products
with limited resources. LP helps maximize
profit.
• Steps:
• 1. Define objective function (profit).
• 2. Set constraints (raw materials, time).
• 3. Solve graphically or using software.
Example 2 - Transportation
Problem
• Scenario: Minimize transportation costs
between warehouses and stores.
• Steps:
• 1. Define cost matrix.
• 2. Apply LP to find the least-cost solution.
Tools for Solving LP Problems
• • Manual Methods: Graphical method (2
variables only).
• • Software Tools:
• - Microsoft Excel Solver
• - MATLAB
• - Python (e.g., PuLP library)
Advantages of Linear Programming
• • Helps in optimal resource utilization.
• • Provides a structured approach to problem-
solving.
• • Applicable across various industries.
Limitations of Linear Programming
• • Assumes linearity in relationships.
• • Cannot handle non-linear problems.
• • Solutions may not always be practical.
Conclusion
• • LP is a powerful tool for optimization.
• • Widely applicable in industries to improve
efficiency.
• • Advances in technology make LP easier to
implement.