Scribd
Upload
3 views12 pages

Linear Programming Presentation

Linear Programming (LP) is a method used to optimize outcomes based on constraints, involving an objective function and constraints, commonly applied in various fields. A real-life scenario illustrates product optimization for two products with specific labor and material requirements, leading to the formulation of an LP problem and its graphical solution. The Simplex method is introduced for more complex problems, and the dual linear program provides additional economic insights.

Uploaded by

Samuel Sianamate
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
3 views12 pages

Linear Programming Presentation

Linear Programming (LP) is a method used to optimize outcomes based on constraints, involving an objective function and constraints, commonly applied in various fields. A real-life scenario illustrates product optimization for two products with specific labor and material requirements, leading to the formulation of an LP problem and its graphical solution. The Simplex method is introduced for more complex problems, and the dual linear program provides additional economic insights.

Uploaded by

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

Introduction to Linear

Programming
Group One Presentation
Operations Research
Introduction to Linear
Programming
• • Linear Programming (LP) is used to optimize
outcomes based on constraints.
• • It involves an objective function and a set of
constraints.
• • Widely used in business, economics,
logistics, and more.
Real-Life Scenario: Product
Optimization
• • Company produces Product A and B.
• • Product A: 2 labor hours, 4 kg material → $6
profit
• • Product B: 3 labor hours, 2 kg material → $5
profit
• • Available: 60 labor hours, 48 kg material
Formulation of LP Problem
• • Let x = units of Product A, y = units of
Product B
• • Maximize Z = 6x + 5y
• • Subject to:
• • 2x + 3y ≤ 60 (Labor Constraint)
• • 4x + 2y ≤ 48 (Material Constraint)
• • x, y ≥ 0 (Non-negativity)
Graphical Solution
• Plot constraints and shade the feasible region.
• Find corner points and evaluate Z = 6x + 5y.
• Insert graph image below.
Corner Points & Objective Values
• • (0, 0): Z = 0
• • (0, 16): Z = 80
• • (6, 12): Z = 96 (Optimal)
• • (15, 0): Z = 90
Simplex Method Overview
• • Used for problems with more than two
variables.
• • Starts from an initial feasible solution.
• • Iteratively moves to optimal vertex of
feasible region.
Initial Simplex Tableau
• • Maximize Z = 6x + 5y
• • Subject to:
• • 2x + 3y + s1 = 60
• • 4x + 2y + s2 = 48
• • Initial tableau includes slack variables s1 and
s2.
Final Simplex Tableau
• • After iterations, optimal solution found at:
• • x = 6, y = 12
• • Z = 96 (maximum profit)
The Dual Linear Program
• • Dual provides resource valuation (shadow
prices).
• • Primal: Max Z = 6x + 5y
• • Subject to: 2x + 3y ≤ 60, 4x + 2y ≤ 48
• • Dual: Min W = 60u + 48v
• • Subject to: 2u + 4v ≥ 6, 3u + 2v ≥ 5
Summary & Key Takeaways
• • LP helps in optimizing decisions under
constraints.
• • Graphical method works for two-variable
problems.
• • Simplex method extends LP to higher
dimensions.
• • Dual problems provide economic
interpretations.
Questions & Discussion
• • Thank you for your attention!
• • We welcome any questions or feedback.

You might also like