Lecture 8: LP in Excel (Review Assign. 1) AGEC 352 Spring 2011 – February 14 R. Keeney.

Slides:



Advertisements
Similar presentations
Solving LP Problems in a Spreadsheet
Advertisements

With Vegetable Farm Example
Understanding optimum solution
Wyndor Example; Enter data Organize the data for the model on the spreadsheet. Type in the coefficients of the constraints and the objective function.
Assignment 2 Question 7 Farmer Leary.
LINEAR PROGRAMMING (LP)
Lecture 13: Transportation ‘Autopower Co. Case’ AGEC 352 Spring 2011 – March 9 R. Keeney.
Linear Programming Sensitivity of the Right Hand Side Coefficients.
Optimization Models Module 9. MODEL OUTPUT EXTERNAL INPUTS DECISION INPUTS Optimization models answer the question, “What decision values give the best.
SOLVING LINEAR PROGRAMS USING EXCEL Dr. Ron Lembke.
Lecture 12: Sensitivity Examples (Shadow Price Interpreted) AGEC 352 Spring 2012 – February 29 R. Keeney.
Systems of Equations Matrix Methods.
19 Linear Programming CHAPTER
Lecture 6: Algorithm Approach to LP Soln AGEC 352 Fall 2012 – Sep 12 R. Keeney.
Lecture 7: Linear Programming in Excel AGEC 352 Spring 2011 – February 9, 2011 R. Keeney.
Lecture 10: Sensitivity Part I: General AGEC 352 Spring 2011 – February 28 R. Keeney.
Lecture 9: Optimization with a Min objective AGEC 352 Spring 2011 – February 16 R. Keeney.
BASIC FUNCTIONS OF EXCEL. Addition The formula for addition is: =SUM( insert cells desired to sum up ) This returns the sum of the selected cells.
Operations Management Dr. Ron Lembke
Lecture 12: Transportation Introduction AGEC 352 Spring 2011 – March 7 R. Keeney.
Lecture 11: Sensitivity Part II: Prices AGEC 352 Spring 2011 – March 2 R. Keeney.
Lecture 16: Network Models/ Scheduling Assignments AGEC 352 Spring 2011 – March 28 R. Keeney.
Lecture 1: Basics of Math and Economics AGEC 352 Spring 2011 – January 12 R. Keeney.
Sensitivity analysis BSAD 30 Dave Novak
Linear Programming Excel Solver. MAX8X 1 + 5X 2 s.t.2X 1 + 1X 2 ≤ 1000 (Plastic) 3X 1 + 4X 2 ≤ 2400 (Prod. Time) X 1 + X 2 ≤ 700 (Total Prod.) X 1 - X.
QM B Linear Programming
1 5. Linear Programming 1.Introduction to Constrained Optimization –Three elements: objective, constraints, decisions –General formulation –Terminology.
Chapter 3 Section 2 Linear Programming I. Fundamental Theorem of Linear Programming The maximum (or minimum) value of the objective function is achieved.
Linear Programming Econ Outline  Review the basic concepts of Linear Programming  Illustrate some problems which can be solved by linear programming.
Linear Programming ISQA 459/559. Getting Started with LP Game problem Terms Algebraic & Graphical Illustration LP with Excel.
QM B Lego Simplex. Scenario You manufacture tables and chairs. Tables and chairs are manufactured from small and large bricks. Small brick Large brick.
9/1 More Linear Programming Collect homework Roll call Review homework Lecture - More LP Small Groups Lecture - Start using MS Excel Assign Homework.
3.4 Linear Programming.
Chapter 19 Linear Programming McGraw-Hill/Irwin
Common formulas An Excel formula always begins with an equal sign (=). Create a formula by combining numbers, cell references, arithmetic operators, and/or.
Lecture 6: Algorithm Approach to LP Soln AGEC 352 Fall 2012 – Sep 12 R. Keeney.
Spreadsheet Modeling of Linear Programming (LP). Spreadsheet Modeling There is no exact one way to develop an LP spreadsheet model. We will work through.
Linear Programming Joseph Mark November 3, What is Linear Programming Linear Programming – a management science technique that helps a business.
We can make Product1 and Product2. There are 3 resources; Resource1, Resource2, Resource3. Product1 needs one hour of Resource1, nothing of Resource2,
CDAE Class 11 Oct. 3 Last class: Result of Quiz 2 2. Review of economic and business concepts Today: Result of Quiz 2 3. Linear programming and applications.
Linear Programming. What is Linear Programming? Say you own a 500 square acre farm. On this farm you can grow wheat, barley, corn or some combination.
Opener. Notes: 3.4 Linear Programming Optimization  Many real-life problems involve a process called optimization.  This means finding a maximum or.
OPSM 301 Operations Management Class 10: Introduction to Linear Programming Koç University Zeynep Aksin
CDAE Class 12 Oct. 5 Last class: Quiz 3 3. Linear programming and applications Today: Result of Quiz 3 3. Linear programming and applications Next.
CDAE Class 17 Oct. 23 Last class: Result of Quiz 4 3. Linear programming and applications Today: 3. Linear programming and applications Review for.
QMB 4701 MANAGERIAL OPERATIONS ANALYSIS
In The Name Of Allah Lab 07 ins. Tahani Aldweesh.
Wiley Supplement B Linear Programming Operations Management by R. Dan Reid & Nada R. Sanders 4th Edition © Wiley 2010.
1 The Dual in Linear Programming In LP the solution for the profit- maximizing combination of outputs automatically determines the input amounts that must.
10/2 The simplex algorithm. In an augmented matrix, if a column has a 1 and all other entries 0, it is said to be ‘in solution’. The 1 is called a ‘pivot’
3 Characteristics of an Optimization Problem General descriptionKPiller Illustration Decisions that must be made; represented by decision variables How.
CDAE Class 13 Oct. 10 Last class: Result of Quiz 3 3. Linear programming and applications Class exercise 5 Today: 3. Linear programming and applications.
Lab 3 Solver Add-In In Excel ► Lab 2 Review ► Solver Add-in Introduction ► Practice Solver following Instructor » Saferly Inc.
Making Money. Planting a Field What affects how much money Farmer Bruce earns form his field?
Monday WARM-UP: TrueFalseStatementCorrected Statement F 1. Constraints are conditions written as a system of equations Constraints are conditions written.
Linear Programming (LP): Model Formulation & Graphical Solution Chapter 13.
Lecture 8: Optimization with a Min objective AGEC 352 Spring 2012 – February 8 R. Keeney.
Linear Programming. Graph the following system of inequalities.
3 Components for a Spreadsheet Optimization Problem  There is one cell which can be identified as the Target or Set Cell, the single objective of the.
Plant Science Crop ID. Cotton Flower Cotton Leaf.
CDAE Class 15 Oct. 16 Last class: Result of group project 1 3. Linear programming and applications Class Exercise 7 Today: 3. Linear programming.
CDAE Class 16 Oct. 18 Last class: 3. Linear programming and applications Quiz 4 Today: Result of Quiz 4 3. Linear programming and applications Group.
The Canonical Form and Null Spaces Lecture III. The Canonical Form ä A canonical form is a solution to an underidentified system of equations. ä For example.
1. Solve this system and find the product of its solutions. x + y = 7 2x – y =8 2. The feasible region for a set of constraints has vertices (2,0), (8,2)
Chapter 12: Kay and Edwards
MATH143 Lec 4 Quantitative Methods
Agricultural Economic Students and Faculty!
GENERAL MATHS – UNIT TWO
GENERAL MATHS – UNIT TWO
Presentation transcript:

Lecture 8: LP in Excel (Review Assign. 1) AGEC 352 Spring 2011 – February 14 R. Keeney

The 3 Crop Problem

Excel Setup of 3 Crop Problem (Show Formulas) Note the use of absolute cell references (e.g. $B$3), which allows copying of the formulas down the LHS column.

Question 1: Why split up the labor? When given a question like this, you should always feel free to solve the model again as part of you answer. VariableLabor Separated Labor Combined Profits18,31521,200 Corn planted Wheat planted Oats planted1050 Labor used (total)3, Labor used (J-A)1,600??

Question 1: Labor modeling The model without the labor split would have us overplanting corn relative to seasonal labor availability. That model also shows us that if we could move labor around in time or get more than 1600 hours in Jan-Apr we could earn more profits.

Questions 2-4. Planting ◦ Corn = 275 ◦ Wheat = 120 ◦ Oats = 105 Profits = 18,315 Binding Constraints (LHS = RHS) ◦ Total Land (500) ◦ Wheat allotment (120) ◦ Jan-Apr labor (1600)

Q4: Binding Constraints Why do we identify these? 1) While all of the constraints are part of the problem, only the constraints that bind are meaningful. ◦ They define the corner point of the solution. 2) Having more of the resource in a binding constraint would make us better off. ◦ Without solving the model you can say that removing wheat allotment will increase profits. Solve the model to know how much…

Questions 5 and 6: More land and what is it worth? Solve the model again assuming we have 501 acres of total land. ◦ Corn = ◦ Wheat = 120 ◦ Oats =  Increase oats by 1.25 while reducing corn by 0.25  Add’l land lets us use more of our labor Same constraints bind Profits = ◦ – = ~14.00 is the maximum amount of rent that can be paid for land.

Question 7: No wheat allotment Constraint binds so we know profits should increase ◦ Only reason we produce oats is the wheat allotment VariableWheat Allotment No Wheat Allotment Profits18,31519,575 Corn planted275 Wheat planted Oats planted1050 Cost of the wheat program 19,575 – 18,315 =1,260

Question 8: Corn Only Set Corn to its max value and compare ◦ The value of the crop mix is that we use resources more fully… VariableOptimal PlanCorn Only Plan Profits18,31514,400 Corn planted Wheat planted1200 Oats planted1050 Binding ConstraintsLand, Wheat Allotment, Jan-Apr Labor Jan-Apr Labor Return to Crop Mix 18,315 – 14,400 =3,915

Time for Quiz