SlideShare a Scribd company logo
LP Quizzes 4 to 8
Professor Ed Dansereau
Decision Variables
The two decision variables are the number of social media and newspaper ads.
Decision variables represent what management control. We can decide how
many of each to run.
X1 = Newspaper
X2 = Social Media
All other expressions (OF and Constraints are defined in terms of decision
variables).
Objective Function
Objective: Maximize Profit
Objective Function: How much profit from each of our decision variables.
$4 profit from Newspapers
$2 profit from Social Media
So
Zmax = 4X1 + 2X2
Constraints
Constraints are limitations, we can only dream of having unlimited resources
such as time and money.
For Budget Constraint
We have a maximum of 240 dollars, we could use 200 dollars but can not
spend 250. Our limitation is less than or equal to 240 dollars.
Each newspaper ad consumes $3 and each social media $1
Budget → 3X1 + 1X1 <= 240
Constraints continued
Work-Hour constraint
A maximum of 100 hours are available. Each Newspaper consumes 1 hour and
each social media 2.5 hours.
X1 + 2.5X2 <= 100
Graph
Each constraint is Linear - a straight line. To graph we take advantage of the
straight lines and that the axis of any variable equals zero. The horizontal axis
is X1 and the Vertical is X2.
Budget
X1 → set X2 = 0, X1 + 2.5(0) <= 100, solve for X1, X1 = 100
X2 → set X1 = 0, 1(0) + 2.5X2 = 100, X2 = 40
Work Hours
Graph
Feasible Region
Feasible Region - the area limited by the
constraints.
Since our constraints are less than or equal to,
the feasible region is area below both lines.
Note that for most of the graph the binding
constraint is the blue line, after the point (76.9,
9.2) the binding constraint is the red line. All LP
problems assume greater than zero, so the axis
represents the other boundaries (you would not
do a project if your profits were negative).
Feasible Region
Extreme Points
Extreme Points are the points at the edges of
the feasible region. With two constraints there
are four extreme points, there can be more if
there are additional constraints.
Our extreme points are (the labels are arbitrary)
A: (0,0)
B: (0,40)
C: (76.9, 9.2)
Extreme Points
Optimal Solution
Any point within the feasible area is a solution
and will provide some measure of profit or at
least break-even
The Optimal Solution is the point that provides
the maximum profit given our constraints. In
Linear Programming it will always be one of the
extreme points regardless if the objective is to
maximizing profit or minimizing costs.
Put Coordinates of extreme points into
Objective Function to determine Maximum
Profit or Minimum Cost (Max profit in our
example).
Zmax = 4X1 + 2X2
Za (0,0) = 4(0)+ 2(0) = 0
Zb (0,40) = 4(0) +2(40) =40
Zc (76.9, 9.2) = 4(76.9) + 2(9.2) = 326Optimal Solution
Binding and Slack
A BINDING constraints limits the optimal
solution.
Slack is extra capacity.
For example the Budget constraint has slack up
until it intersects with the Work Hour constraint.
After that point, the Budget constraint is
binding.
Finding the intersection of two lines
There are three ways to determine the
intersection of two lines:
1. Estimate, take your best guess by looking
at graph, for our example I would guess
(77,10).
2. Simultaneous Solution
3. Mathematical Method
Simultaneous Solution
1. Write out the two linear lines, the constraint equations
2. Solve for one variable in terms of the other for first equation
3. Substitute solution into second equation, which will result a solution for
one variable
4. Solve for second variable
Simultaneous Solution
1. Write out two linear lines
a. Work Hours → X1 + 2.5X2 <= 100
b. Budget → 3X1 + X2 <= 240
2. Solve for one variable in terms of the other for first equation
a. X1 + 2.5X2 = 100, so X1 = 100 - 2.5X2
b. Solve for any variable in either equation. I choose Work Hours and the variable X1 because
the math was easy. With a coefficient of 1, (240-2.5X2)/1 = (240-2.5X2). You do not even
need a calculator for that!
Simultaneous Solution
3. Substitute solution into second equation, which will result a solution for one
variable
a. Budget → 3X1 + X2 <= 240
b. Work Hours → X1 = 100 - 2.5X2
c. Sub work hours into Budget → 3(100-2.5X2) + X2 = 240
i. 300 - 7.5X2 +x2 =240
ii. -6.5X2 = 240 - 300
Simultaneous Solution
4. Solve for second variable
X2 = 9.27
3X1 + X2 = 240 (either equation will work)
3X1 + 9.27 = 240
X1 = (240 - 9.27) / 3
X1 = 76.92, solution for second variable
Multiplication Method
In this method we try to eliminate one variable but multiplying by an inverse
(negative number).
1. Look at your two linear lines (constraints) and choose a variable to
eliminate. I look for a number that is easy to multiple.
2. Multiple the other equation by the inverse.
3. Add two equations together and solve for first variable.
4. Solve for second variable
Multiplication Method
1. Look at your two linear lines (constraints) and choose a variable to
eliminate
a. Budget → 3X1 + 1X2 <= 240
b. Hours → 1X1 + 2.5X2 <= 100
c. The X1 in budget is three times the X1 in hours, so I choose to multiple the Work Hours
constraint by inverse, or simply -3.
2. Multiple the other equation by the inverse
a. Hours → -3(1X1 +2.5X2 = 100),
Multiplication Method
3. Add two equations together and solve for first variable.
3X1 + 1X2 = 240
+ -3X1 - 7.5X2 = -300
= 0X1 - 6.5X2 = -60
X2 = (-60)/(-6.5)
X2 = 9.23 (Does this number look familiar?)
Multiplication Method
4. Solve for second variable
X2 = 9.23
Budget → 3X1 + 1X2 <= 240, you may choose either equation
3X1 + 9.23 = 240
X1 = (240 -9.23) / 3
X1 = 76.92
Finding the intersection of two lines
Both the Simultaneous Solution and Mathematical Method produce the same
solution for X1 and X2 (76.92, 9.23).
These coordinates are the point on the graph where the two lines intersect.
Yes, you need to learn both methods.
We will use the Mathematical Method in the next section.

More Related Content

PPTX
Linear programming - Model formulation, Graphical Method
PPT
Chapter 6 annuity
PPTX
CABT SHS Statistics & Probability - Mean and Variance of Sampling Distributio...
DOCX
Bicol regional march
PPTX
Linear programing
PPTX
Real Applications of Normal Distributions
PPTX
Idyomatikong Pagsasalin
PPTX
Operations management forecasting
Linear programming - Model formulation, Graphical Method
Chapter 6 annuity
CABT SHS Statistics & Probability - Mean and Variance of Sampling Distributio...
Bicol regional march
Linear programing
Real Applications of Normal Distributions
Idyomatikong Pagsasalin
Operations management forecasting

What's hot (20)

PDF
Salient features of linear programming and its applications
PPTX
PAGKAKAIBA NG TAGALOG, PILIPINO, AT FILIPINO by Angela.pptx
PPTX
Financial management 2
PPTX
Ppt on decision theory
PPTX
Diskurso at komunikasyon
PPTX
Pagsasalita
PPTX
Module 3 Game Theory (1).pptx
PDF
Linear Programming Problems {Operation Research}
PPT
Sulating pananaliksik1
PPTX
Business Mathematics ( 1st and 2nd years )
PPT
Business Forecasting
PDF
3. linear programming senstivity analysis
PPT
Antas ng wika
PPTX
Editoryal o pangulong tudling
PPT
Linear Programming 1
PPTX
Filipino 101
PDF
linear programming
DOCX
Ibigay ang pagkakaiba at pagkakatulad ng tagalog, pilipino at filipino
PPTX
Calculus: Real World Application of Limits
Salient features of linear programming and its applications
PAGKAKAIBA NG TAGALOG, PILIPINO, AT FILIPINO by Angela.pptx
Financial management 2
Ppt on decision theory
Diskurso at komunikasyon
Pagsasalita
Module 3 Game Theory (1).pptx
Linear Programming Problems {Operation Research}
Sulating pananaliksik1
Business Mathematics ( 1st and 2nd years )
Business Forecasting
3. linear programming senstivity analysis
Antas ng wika
Editoryal o pangulong tudling
Linear Programming 1
Filipino 101
linear programming
Ibigay ang pagkakaiba at pagkakatulad ng tagalog, pilipino at filipino
Calculus: Real World Application of Limits
Ad

Viewers also liked (8)

PPTX
Linear programming
PPTX
Linear Programming Quiz
PDF
Linear Programming Module- A Conceptual Framework
PDF
Price discrimination – Background note – OECD Competition Division - November...
PDF
Price discrimination – Dennis CARLTON – University of Chicago Booth School – ...
PPSX
Linear programing
PPTX
Linear Programming
Linear programming
Linear Programming Quiz
Linear Programming Module- A Conceptual Framework
Price discrimination – Background note – OECD Competition Division - November...
Price discrimination – Dennis CARLTON – University of Chicago Booth School – ...
Linear programing
Linear Programming
Ad

Similar to Linear Programming Quiz Solution (20)

PPTX
Quantitativetechniqueformanagerialdecisionlinearprogramming 090725035417-phpa...
PPTX
Chapter 2 Linear Programming for business (1).pptx
PPTX
PPTX
Introduction to Operations Research/ Management Science
PPTX
Integer Linear Programming
PPSX
Graphical method
PPT
Management Science
PDF
Integer Programming, Goal Programming, and Nonlinear Programming
PPTX
Advance algebra
PPTX
Linear programming manzoor nabi
PPT
Mathematics For Management CHAPTER THREE PART I.PPT
PDF
Mathematical linear programming notes
PDF
Integer programming branch and bound
PPT
OR CHAPTER TWO II.PPT
PPTX
Linear programming ppt on operertion research
PPTX
Graphical Solution in LPP along with graphs and formula
PDF
Chapter 4 Simplex Method ppt
PDF
Unit.2. linear programming
PPTX
Operation research - Chapter 01
PDF
Introduction to Greedy method, 0/1 Knapsack problem
Quantitativetechniqueformanagerialdecisionlinearprogramming 090725035417-phpa...
Chapter 2 Linear Programming for business (1).pptx
Introduction to Operations Research/ Management Science
Integer Linear Programming
Graphical method
Management Science
Integer Programming, Goal Programming, and Nonlinear Programming
Advance algebra
Linear programming manzoor nabi
Mathematics For Management CHAPTER THREE PART I.PPT
Mathematical linear programming notes
Integer programming branch and bound
OR CHAPTER TWO II.PPT
Linear programming ppt on operertion research
Graphical Solution in LPP along with graphs and formula
Chapter 4 Simplex Method ppt
Unit.2. linear programming
Operation research - Chapter 01
Introduction to Greedy method, 0/1 Knapsack problem

More from Ed Dansereau (12)

PPTX
Social media in job search
PPTX
Social media use in job search
PPTX
Marketing management orientation philosophies
PPTX
Basic Business Forecasting
PPTX
Simplex part 3 of 4
PPTX
Simplex part 2 of 4
PPTX
Simplex part 1 of 4
PPTX
Break even and outsource analysis
PPTX
How to set up a Graphical Method Linear Programming Problem - Introduction
PPTX
Integrating Social Media into the Classroom, VSC Presentation
PPTX
Students' expectations of the use of social media in the classroom
PPTX
The influence of permission marketing final version
Social media in job search
Social media use in job search
Marketing management orientation philosophies
Basic Business Forecasting
Simplex part 3 of 4
Simplex part 2 of 4
Simplex part 1 of 4
Break even and outsource analysis
How to set up a Graphical Method Linear Programming Problem - Introduction
Integrating Social Media into the Classroom, VSC Presentation
Students' expectations of the use of social media in the classroom
The influence of permission marketing final version

Recently uploaded (20)

PDF
FourierSeries-QuestionsWithAnswers(Part-A).pdf
PDF
Abdominal Access Techniques with Prof. Dr. R K Mishra
PPTX
IMMUNITY IMMUNITY refers to protection against infection, and the immune syst...
PDF
01-Introduction-to-Information-Management.pdf
PDF
Insiders guide to clinical Medicine.pdf
PPTX
Institutional Correction lecture only . . .
PDF
BÀI TẬP BỔ TRỢ 4 KỸ NĂNG TIẾNG ANH 9 GLOBAL SUCCESS - CẢ NĂM - BÁM SÁT FORM Đ...
PDF
Complications of Minimal Access Surgery at WLH
PPTX
school management -TNTEU- B.Ed., Semester II Unit 1.pptx
PDF
TR - Agricultural Crops Production NC III.pdf
PDF
Chapter 2 Heredity, Prenatal Development, and Birth.pdf
PPTX
Cell Structure & Organelles in detailed.
PDF
RMMM.pdf make it easy to upload and study
PPTX
Pharma ospi slides which help in ospi learning
PPTX
The Healthy Child – Unit II | Child Health Nursing I | B.Sc Nursing 5th Semester
PDF
Module 4: Burden of Disease Tutorial Slides S2 2025
PDF
2.FourierTransform-ShortQuestionswithAnswers.pdf
PDF
102 student loan defaulters named and shamed – Is someone you know on the list?
PDF
Pre independence Education in Inndia.pdf
PPTX
master seminar digital applications in india
FourierSeries-QuestionsWithAnswers(Part-A).pdf
Abdominal Access Techniques with Prof. Dr. R K Mishra
IMMUNITY IMMUNITY refers to protection against infection, and the immune syst...
01-Introduction-to-Information-Management.pdf
Insiders guide to clinical Medicine.pdf
Institutional Correction lecture only . . .
BÀI TẬP BỔ TRỢ 4 KỸ NĂNG TIẾNG ANH 9 GLOBAL SUCCESS - CẢ NĂM - BÁM SÁT FORM Đ...
Complications of Minimal Access Surgery at WLH
school management -TNTEU- B.Ed., Semester II Unit 1.pptx
TR - Agricultural Crops Production NC III.pdf
Chapter 2 Heredity, Prenatal Development, and Birth.pdf
Cell Structure & Organelles in detailed.
RMMM.pdf make it easy to upload and study
Pharma ospi slides which help in ospi learning
The Healthy Child – Unit II | Child Health Nursing I | B.Sc Nursing 5th Semester
Module 4: Burden of Disease Tutorial Slides S2 2025
2.FourierTransform-ShortQuestionswithAnswers.pdf
102 student loan defaulters named and shamed – Is someone you know on the list?
Pre independence Education in Inndia.pdf
master seminar digital applications in india

Linear Programming Quiz Solution

  • 1. LP Quizzes 4 to 8 Professor Ed Dansereau
  • 2. Decision Variables The two decision variables are the number of social media and newspaper ads. Decision variables represent what management control. We can decide how many of each to run. X1 = Newspaper X2 = Social Media All other expressions (OF and Constraints are defined in terms of decision variables).
  • 3. Objective Function Objective: Maximize Profit Objective Function: How much profit from each of our decision variables. $4 profit from Newspapers $2 profit from Social Media So Zmax = 4X1 + 2X2
  • 4. Constraints Constraints are limitations, we can only dream of having unlimited resources such as time and money. For Budget Constraint We have a maximum of 240 dollars, we could use 200 dollars but can not spend 250. Our limitation is less than or equal to 240 dollars. Each newspaper ad consumes $3 and each social media $1 Budget → 3X1 + 1X1 <= 240
  • 5. Constraints continued Work-Hour constraint A maximum of 100 hours are available. Each Newspaper consumes 1 hour and each social media 2.5 hours. X1 + 2.5X2 <= 100
  • 6. Graph Each constraint is Linear - a straight line. To graph we take advantage of the straight lines and that the axis of any variable equals zero. The horizontal axis is X1 and the Vertical is X2. Budget X1 → set X2 = 0, X1 + 2.5(0) <= 100, solve for X1, X1 = 100 X2 → set X1 = 0, 1(0) + 2.5X2 = 100, X2 = 40 Work Hours
  • 8. Feasible Region Feasible Region - the area limited by the constraints. Since our constraints are less than or equal to, the feasible region is area below both lines. Note that for most of the graph the binding constraint is the blue line, after the point (76.9, 9.2) the binding constraint is the red line. All LP problems assume greater than zero, so the axis represents the other boundaries (you would not do a project if your profits were negative). Feasible Region
  • 9. Extreme Points Extreme Points are the points at the edges of the feasible region. With two constraints there are four extreme points, there can be more if there are additional constraints. Our extreme points are (the labels are arbitrary) A: (0,0) B: (0,40) C: (76.9, 9.2) Extreme Points
  • 10. Optimal Solution Any point within the feasible area is a solution and will provide some measure of profit or at least break-even The Optimal Solution is the point that provides the maximum profit given our constraints. In Linear Programming it will always be one of the extreme points regardless if the objective is to maximizing profit or minimizing costs. Put Coordinates of extreme points into Objective Function to determine Maximum Profit or Minimum Cost (Max profit in our example). Zmax = 4X1 + 2X2 Za (0,0) = 4(0)+ 2(0) = 0 Zb (0,40) = 4(0) +2(40) =40 Zc (76.9, 9.2) = 4(76.9) + 2(9.2) = 326Optimal Solution
  • 11. Binding and Slack A BINDING constraints limits the optimal solution. Slack is extra capacity. For example the Budget constraint has slack up until it intersects with the Work Hour constraint. After that point, the Budget constraint is binding.
  • 12. Finding the intersection of two lines There are three ways to determine the intersection of two lines: 1. Estimate, take your best guess by looking at graph, for our example I would guess (77,10). 2. Simultaneous Solution 3. Mathematical Method
  • 13. Simultaneous Solution 1. Write out the two linear lines, the constraint equations 2. Solve for one variable in terms of the other for first equation 3. Substitute solution into second equation, which will result a solution for one variable 4. Solve for second variable
  • 14. Simultaneous Solution 1. Write out two linear lines a. Work Hours → X1 + 2.5X2 <= 100 b. Budget → 3X1 + X2 <= 240 2. Solve for one variable in terms of the other for first equation a. X1 + 2.5X2 = 100, so X1 = 100 - 2.5X2 b. Solve for any variable in either equation. I choose Work Hours and the variable X1 because the math was easy. With a coefficient of 1, (240-2.5X2)/1 = (240-2.5X2). You do not even need a calculator for that!
  • 15. Simultaneous Solution 3. Substitute solution into second equation, which will result a solution for one variable a. Budget → 3X1 + X2 <= 240 b. Work Hours → X1 = 100 - 2.5X2 c. Sub work hours into Budget → 3(100-2.5X2) + X2 = 240 i. 300 - 7.5X2 +x2 =240 ii. -6.5X2 = 240 - 300
  • 16. Simultaneous Solution 4. Solve for second variable X2 = 9.27 3X1 + X2 = 240 (either equation will work) 3X1 + 9.27 = 240 X1 = (240 - 9.27) / 3 X1 = 76.92, solution for second variable
  • 17. Multiplication Method In this method we try to eliminate one variable but multiplying by an inverse (negative number). 1. Look at your two linear lines (constraints) and choose a variable to eliminate. I look for a number that is easy to multiple. 2. Multiple the other equation by the inverse. 3. Add two equations together and solve for first variable. 4. Solve for second variable
  • 18. Multiplication Method 1. Look at your two linear lines (constraints) and choose a variable to eliminate a. Budget → 3X1 + 1X2 <= 240 b. Hours → 1X1 + 2.5X2 <= 100 c. The X1 in budget is three times the X1 in hours, so I choose to multiple the Work Hours constraint by inverse, or simply -3. 2. Multiple the other equation by the inverse a. Hours → -3(1X1 +2.5X2 = 100),
  • 19. Multiplication Method 3. Add two equations together and solve for first variable. 3X1 + 1X2 = 240 + -3X1 - 7.5X2 = -300 = 0X1 - 6.5X2 = -60 X2 = (-60)/(-6.5) X2 = 9.23 (Does this number look familiar?)
  • 20. Multiplication Method 4. Solve for second variable X2 = 9.23 Budget → 3X1 + 1X2 <= 240, you may choose either equation 3X1 + 9.23 = 240 X1 = (240 -9.23) / 3 X1 = 76.92
  • 21. Finding the intersection of two lines Both the Simultaneous Solution and Mathematical Method produce the same solution for X1 and X2 (76.92, 9.23). These coordinates are the point on the graph where the two lines intersect. Yes, you need to learn both methods. We will use the Mathematical Method in the next section.