Holiday Meal Turkey Ranch

Slides:



Advertisements
Similar presentations
PowerPoint Slides by Robert F. BrookerCopyright (c) 2001 by Harcourt, Inc. All rights reserved. Linear Programming Mathematical Technique for Solving Constrained.
Advertisements

© 2003 Anita Lee-Post Linear Programming Part 2 By Anita Lee-Post.
LIAL HORNSBY SCHNEIDER
Special Variables: 1- Slack Variable (s1): represents the amount by which the available amount of the resources exceeds its usage by the activities.
Linear Programming (LP) Decision Variables Objective (MIN or MAX) Constraints Graphical Solution.
Linear Programming Models: Graphical Methods
Chapter 7 Linear Programming Models Part One n Basis of Linear Programming n Linear Program formulati on.
© 2008 Prentice-Hall, Inc. Chapter 7 To accompany Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna Power Point slides created.
Managerial Decision Modeling with Spreadsheets
Chapter 7 Linear Programming Models: Graphical and Computer Methods
LP Extra Issues and Examples. Special Cases in LP Infeasibility Unbounded Solutions Redundancy Degeneracy More Than One Optimal Solution 2.
B Linear Programming PowerPoint presentation to accompany
The Simplex Method: Standard Maximization Problems
Linear Programming Models: Graphical and Computer Methods
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 7-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 7 Linear.
Linear Programming Solution Techniques: Graphical and Computer Methods
Linear Programming Models: Graphical and Computer Methods
Linear Programming Econ Outline  Review the basic concepts of Linear Programming  Illustrate some problems which can be solved by linear programming.
Objectives: Set up a Linear Programming Problem Solve a Linear Programming Problem.
LINEAR PROGRAMMING SOLUTION TECHNIQUES: GRAPHICAL AND COMPUTER METHODS
Linear Programming Operations Research – Engineering and Math Management Sciences – Business Goals for this section  Modeling situations in a linear environment.
Linear Programming Models: Graphical and Computer Methods
3.4 Linear Programming.
1 The Role of Sensitivity Analysis of the Optimal Solution Is the optimal solution sensitive to changes in input parameters? Possible reasons for asking.
Linear Programming - Standard Form
Linear Programming A Summary. What??  Linear Programming is an algebraic strategy used to find optimal solutions. –Uses linear inequalities called constraints.
MATH 527 Deterministic OR Graphical Solution Method for Linear Programs.
B Linear Programming PowerPoint presentation to accompany
Linear Programming 1.3 M Warm-Up Graph the system.
Management Science – MNG221 Linear Programming: Graphical Solution.
Linear Programming Introduction: Linear programming(LP) is a mathematical optimization technique. By “Optimization” technique we mean a method which attempts.
Solving Quadratic Equations by Factoring. Solution by factoring Example 1 Find the roots of each quadratic by factoring. factoring a) x² − 3x + 2 b) x².
PowerPoint Slides by Robert F. BrookerHarcourt, Inc. items and derived items copyright © 2001 by Harcourt, Inc. Managerial Economics in a Global Economy.
Notes 7.5 – Systems of Inequalities. I. Half-Planes A.) Given the inequality, the line is the boundary, and the half- plane “below” the boundary is the.
Linear Programming Problem. Definition A linear programming problem is the problem of optimizing (maximizing or minimizing) a linear function (a function.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 7 Algebra: Graphs, Functions, and Linear Systems.
Introduction to linear programming:- - Linear programming (LP) applies to optimization models in which the objective and constraints functions are strictly.
Monday WARM-UP: TrueFalseStatementCorrected Statement F 1. Constraints are conditions written as a system of equations Constraints are conditions written.
© 2008 Prentice Hall, Inc.B – 1 Operations Management Module B – Linear Programming PowerPoint presentation to accompany Heizer/Render Principles of Operations.
Warm-upWarm-up Sketch the region bounded by the system of inequalities: 1) 2) Sketch the region bounded by the system of inequalities: 1) 2)
Linear Programming (LP) Problems MAX (or MIN): c 1 X 1 + c 2 X 2 + … + c n X n Subject to:a 11 X 1 + a 12 X 2 + … + a 1n X n
Solving Systems of Equations
Linear Programming Graphical Solution. Graphical Solution to an LP Problem This is easiest way to solve a LP problem with two decision variables. If there.
© 2008 Prentice-Hall, Inc. Chapter 7 To accompany Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna Power Point slides created.
© 2009 Prentice-Hall, Inc. 7 – 1 Decision Science Chapter 3 Linear Programming: Maximization and Minimization.
3-5: Linear Programming. Learning Target I can solve linear programing problem.
Copyright © 2006 Brooks/Cole, a division of Thomson Learning, Inc. Linear Programming: An Algebraic Approach 4 The Simplex Method with Standard Maximization.
3.3 Linear Programming. Vocabulary Constraints: linear inequalities; boundary lines Objective Function: Equation in standard form used to determine the.
Sullivan Algebra and Trigonometry: Section 12.9 Objectives of this Section Set Up a Linear Programming Problem Solve a Linear Programming Problem.
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 7-1 1© 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 7 Linear.
Linear Programming Models: Graphical and Computer Methods 7 To accompany Quantitative Analysis for Management, Twelfth Edition, by Render, Stair, Hanna.
3.4 Linear Programming p Optimization - Finding the minimum or maximum value of some quantity. Linear programming is a form of optimization where.
Chapter 2 Linear Programming Models: Graphical and Computer Methods
Linear Programming Models: Graphical and Computer Methods
Micro Economics in a Global Economy
Ardavan Asef-Vaziri Systems and Operations Management
A seminar talk on “SOLVING LINEAR PROGRAMMING PROBLEM BY GRAPHICAL METHOD” By S K Indrajitsingha M.Sc.
Linear Programming: The Graphical Method
Linear Programming Models: Graphical and Computer Methods
Managerial Economics in a Global Economy
Linear Programming Models: Graphical and Computer Methods
3-3 Optimization with Linear Programming
Linear Programming Objectives: Set up a Linear Programming Problem
Algebra: Graphs, Functions, and Linear Systems
Solving Linear Programming Problems: Asst. Prof. Dr. Nergiz Kasımbeyli
Warm Up Solve for x:
LINEARPROGRAMMING 4/26/2019 9:23 AM 4/26/2019 9:23 AM 1.
Module B Linear Programming.
Section Linear Programming
Presentation transcript:

Holiday Meal Turkey Ranch Presented by: Olivia Ortega Jen Kakacek Nikole Ellison

Holiday Meal Turkey Ranch The Holiday Meal Turkey Ranch is considering buying two different brands of turkey feed and blending them to provide a good, low-cost diet for its turkeys Let X1 = number of pounds of brand 1 feed purchased X2 = number of pounds of brand 2 feed purchased Minimize cost (in cents) = 2X1 + 3X2 subject to: 5X1 + 10X2 ≥ 90 ounces (ingredient constraint A) 4X1+ 3X2 ≥ 48 ounces (ingredient constraint B) 0.5X1 ≥ 1.5 ounces (ingredient constraint C) X1≥ 0 (nonnegativity constraint) X2 ≥ 0 (nonnegativity constraint)

Holiday Meal Turkey Ranch Holiday Meal Turkey Ranch data INGREDIENT INGREDIENT COMPOSITION OF EACH POUND OF FEED (OZ.) MINIMUM MONTHLY REQUIREMENT PER TURKEY (OZ.) BRAND 1 FEED BRAND 2 FEED A 5 10 90 B 4 3 48 C 0.5 1.5 Cost per pound 2 cents 3 cents

Holiday Meal Turkey Ranch – 20 – 15 – 10 – 5 – 0 – X2 | | | | | | 5 10 15 20 25 X1 Pounds of Brand 2 Pounds of Brand 1 Using the corner point method First we construct the feasible solution region The optimal solution will lie at on of the corners as it would in a maximization problem Ingredient C Constraint Feasible Region Ingredient B Constraint Ingredient A Constraint

Holiday Meal Turkey Ranch We solve for the values of the three corner points Point a is the intersection of ingredient constraints C and B 4X1 + 3X2 = 48 X1 = 3 Substituting 3 in the first equation, we find X2 = 12 Solving for point b with basic algebra we find X1 = 8.4 and X2 = 4.8 Solving for point c we find X1 = 18 and X2 = 0

Holiday Meal Turkey Ranch Substituting these value back into the objective function we find Cost = 2X1 + 3X2 Cost at point a = 2(3) + 3(12) = 42 Cost at point b = 2(8.4) + 3(4.8) = 31.2 Cost at point c = 2(18) + 3(0) = 36 The lowest cost solution is to purchase 8.4 pounds of brand 1 feed and 4.8 pounds of brand 2 feed for a total cost of 31.2 cents per turkey

Holiday Meal Turkey Ranch – 20 – 15 – 10 – 5 – 0 – X2 | | | | | | 5 10 15 20 25 X1 Pounds of Brand 2 Pounds of Brand 1 Using the isocost approach Choosing an initial cost of 54 cents, it is clear improvement is possible Feasible Region 54¢ = 2X1 + 3X2 Isocost Line Direction of Decreasing Cost 31.2¢ = 2X1 + 3X2 (X1 = 8.4, X2 = 4.8)

Holiday Meal Turkey Ranch Setting up Solver to solve the Holiday Meal Turkey Ranch problem

Holiday Meal Turkey Ranch   Brand 1 Brand 2 Left Handside Right Hand Side Surplus Objective Function 2 3 Ingredient A 5 10 >= 90 Ingredient B 4 48 -48 Ingredient C 0.5 1.5 -1.5 Solution Values

Holiday Meal Turkey Ranch Questions?