Lecture 6: Algorithm Approach to LP Soln AGEC 352 Fall 2012 – Sep 12 R. Keeney.

Slides:



Advertisements
Similar presentations
February 14, 2002 Putting Linear Programs into standard form
Advertisements

Chapter 5: Linear Programming: The Simplex Method
Lecture 3 Linear Programming: Tutorial Simplex Method
Standard Minimization Problems with the Dual
Simplex Method Example 4.2 # 17 Produced by E. Gretchen Gascon.
Linear Programming – Simplex Method
SIMPLEX METHOD FOR LP LP Model.
Assignment (6) Simplex Method for solving LP problems with two variables.
Nonstandard Problmes Produced by E. Gretchen Gascon.
Chapter 6 Linear Programming: The Simplex Method
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Dr. Sana’a Wafa Al-Sayegh
Copyright (c) 2003 Brooks/Cole, a division of Thomson Learning, Inc
Computational Methods for Management and Economics Carla Gomes Module 6a Introduction to Simplex (Textbook – Hillier and Lieberman)
Sections 4.1 and 4.2 The Simplex Method: Solving Maximization and Minimization Problems.
Chapter 6 Linear Programming: The Simplex Method Section 3 The Dual Problem: Minimization with Problem Constraints of the Form ≥
Linear Inequalities and Linear Programming Chapter 5
Chapter 7 LINEAR PROGRAMMING.
The Simplex Method: Standard Maximization Problems
5.4 Simplex method: maximization with problem constraints of the form
The Simplex Algorithm An Algorithm for solving Linear Programming Problems.
Introduction to the Simplex Algorithm Active Learning – Module 3
Operation Research Chapter 3 Simplex Method.
1 Linear programming simplex method This presentation will help you to solve linear programming problems using the Simplex tableau.
Lecture 7: Linear Programming in Excel AGEC 352 Spring 2011 – February 9, 2011 R. Keeney.
Lecture 8: LP in Excel (Review Assign. 1) AGEC 352 Spring 2011 – February 14 R. Keeney.
Lecture 1: Basics of Math and Economics AGEC 352 Spring 2011 – January 12 R. Keeney.
Linear Programming (LP)
MIT and James Orlin © Chapter 3. The simplex algorithm Putting Linear Programs into standard form Introduction to Simplex Algorithm.
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
LINEAR PROGRAMMING SIMPLEX METHOD.
Linear Programming - Standard Form
Learning Objectives for Section 6.2
Lecture 6: Algorithm Approach to LP Soln AGEC 352 Fall 2012 – Sep 12 R. Keeney.
8. Linear Programming (Simplex Method) Objectives: 1.Simplex Method- Standard Maximum problem 2. (i) Greedy Rule (ii) Ratio Test (iii) Pivot Operation.
Simplex Algorithm.Big M Method
Chapter 6 Linear Programming: The Simplex Method Section 2 The Simplex Method: Maximization with Problem Constraints of the Form ≤
This presentation shows how the tableau method is used to solve a simple linear programming problem in two variables: Maximising subject to two  constraints.
Setting Up the Initial Simplex Tableau and Finding the Pivot Element Example 4.2 # 17 Produced by E. Gretchen Gascon.
Business Mathematics MTH-367 Lecture 15. Chapter 11 The Simplex and Computer Solutions Methods continued.
Linear Programming – Simplex Method
4  The Simplex Method: Standard Maximization Problems  The Simplex Method: Standard Minimization Problems  The Simplex Method: Nonstandard Problems.
Chapter 6 Linear Programming: The Simplex Method Section 3 The Dual Problem: Minimization with Problem Constraints of the Form ≥
Mechanical Engineering Department 1 سورة النحل (78)
This presentation shows how the tableau method is used to solve a simple linear programming problem in two variables: Maximising subject to three  constraints.
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’
Linear Inequalities and Linear Programming Chapter 5 Dr.Hayk Melikyan/ Department of Mathematics and CS/ 5.5 Dual problem: minimization.
Simplex Method for solving LP problems with two variables.
Simplex Method Simplex: a linear-programming algorithm that can solve problems having more than two decision variables. The simplex technique involves.
 LP graphical solution is always associated with a corner point of the solution space.  The transition from the geometric corner point solution to the.
Multiply one equation, then add
Copyright © 2006 Brooks/Cole, a division of Thomson Learning, Inc. Linear Programming: An Algebraic Approach 4 The Simplex Method with Standard Maximization.
Slide Copyright © 2009 Pearson Education, Inc. 7.4 Solving Systems of Equations by Using Matrices.
Business Mathematics MTH-367 Lecture 14. Last Lecture Summary: Finished Sec and Sec.10.3 Alternative Optimal Solutions No Feasible Solution and.
1 Simplex algorithm. 2 The Aim of Linear Programming A Linear Programming model seeks to maximize or minimize a linear function, subject to a set of linear.
Decision Support Systems INF421 & IS Simplex: a linear-programming algorithm that can solve problems having more than two decision variables.
GOOD MORNING CLASS! In Operation Research Class, WE MEET AGAIN WITH A TOPIC OF :
College Algebra Chapter 6 Matrices and Determinants and Applications
LINEAR PROGRAMMING.
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Linear programming Simplex method.
Agricultural Economic Students and Faculty!
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Linear programming Simplex method.
LINEAR PROGRAMMING Example 1 Maximise I = x + 0.8y
3.3 Using the Properties Together
Solving Systems of Linear Equations by Elimination
Simplex Tableau Method
Presentation transcript:

Lecture 6: Algorithm Approach to LP Soln AGEC 352 Fall 2012 – Sep 12 R. Keeney

Linear Programming Corner Point Identification ◦ Solution must occur at a corner point ◦ Solve for all corners and find the best solution What if there were many (thousands) of corner points? ◦ Want a way to intelligently identify candidate corner points and check when we have found the best Simplex Algorithm does this…

Assigned Reading 5 page handout posted on the class website ◦ Spreadsheet that goes with the handout Lecture today will point out the most important items from that handout

Problem Setup Let: C = corn production (measured in acres) B = soybean production (measured in acres) The decision maker has the following limited resources: 320 acres of land 20,000 dollars in cash 19,200 bushels of storage The decision maker wants to maximize profits and estimates the following per acre net returns: C = $60 per acre B = $90 per acre

Problem Setup (cont) The two crops the decision maker produces use limited resources at the following per acre rates: ResourceCornSoybeans Land11 Cash50100 Storage10040

Algebraic Form of Problem

Problem Setup in Simplex Note the correspondence between algebraic form and rows/columns

Simplex Procedure: Perform some algebra that is consistent with equation manipulation ◦ Multiply by a constant ◦ Add/subtract a value from both sides of an equation Goal: Each activity column to have one cell with a 1 and the rest of its cells with 0 Result: A solution to the LP can be read from the manipulated tableau

Simplex Steps The simplex conversion steps are as follows: 1)Identify the pivot column: the column with the most negative element in the objective row. 2)Identify the pivot cell in that column: the cell with the smallest RHS/column value. 3)Convert the pivot cell to a value of 1 by dividing the entire row by the coefficient in the pivot cell. 4)Convert all other elements of the pivot column to 0 by adding a multiple of the pivot row to that row.

Step 1 B has the most negative ‘obj’ coefficient ◦ Most profitable activity

Step 2 ID pivot cell: Divide RHS by elements in B column Most limiting resource identifcation 320/1 20K/ /40

Step 3 Convert pivot cell to value of 1 (*1/100)

Step 4 Convert other elements of pivot col to 0, by multiplying the new cash row and adding to the other rows Multiplying factor for land row ◦ -1  (-1*1 + 1 = 0) Multiplying factor for stor row ◦ -40  (-40* = 0)

Example