Agenda of Week VI. LP IV LP Application 3 Time assignment Beggar family LINGO illustration Understanding LP LP Interpretation 2 Objective function Decision.

Slides:



Advertisements
Similar presentations
Agenda of Week VII. LP V LP Application 2 Time assignment Beggar family LINGO illustration Understanding LP LP interpretation Week 6 1 LP Sensitivity Analysis.
Advertisements

Agenda of Week III. LP I LP Standardization Optimization LP intro Week Definition Basic assumptions Example General form Standard form Objective.
February 14, 2002 Putting Linear Programs into standard form
IEOR 4004 Midterm Review (part I)
Strategic Allocation of Resources (Linear Programming)
Geometry and Theory of LP Standard (Inequality) Primal Problem: Dual Problem:
IEOR 4004 Midterm review (Part II) March 12, 2014.
Lecture 3 Linear Programming: Tutorial Simplex Method
IENG442 LINGO LAB3.
Understanding optimum solution
Linear programming: lp_solve, max flow, dual CSC 282 Fall 2013.
Introduction to Sensitivity Analysis Graphical Sensitivity Analysis
Linear Programming Models & Case Studies
Notes 4IE 3121 Why Sensitivity Analysis So far: find an optimium solution given certain constant parameters (costs, demand, etc) How well do we know these.
Sensitivity Analysis Sensitivity analysis examines how the optimal solution will be impacted by changes in the model coefficients due to uncertainty, error.
Copyright (c) 2003 Brooks/Cole, a division of Thomson Learning, Inc
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 9-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 9 Linear.
1/53 Slide Linear Programming: Sensitivity Analysis and Interpretation of Solution n Introduction to Sensitivity Analysis n Graphical Sensitivity Analysis.
IENG313 Operation Research I
SENSITIVITY ANALYSIS.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or.
Linear Programming: Simplex Method and Sensitivity Analysis
SOLVING LINEAR PROGRAMS USING EXCEL Dr. Ron Lembke.
LP EXAMPLES.
Operation Research Chapter 3 Simplex Method.
Basic Linear Programming Concepts Lecture 2 (4/1/2015)
INFM 718A / LBSC 705 Information For Decision Making Lecture 4.
Linear Programming. Linear programming A technique that allows decision makers to solve maximization and minimization problems where there are certain.
Lecture outline Support vector machines. Support Vector Machines Find a linear hyperplane (decision boundary) that will separate the data.
1 1 Slide LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
5.6 Maximization and Minimization with Mixed Problem Constraints
MIT and James Orlin © Chapter 3. The simplex algorithm Putting Linear Programs into standard form Introduction to Simplex Algorithm.
1 1 Slides by John Loucks St. Edward’s University Modifications by A. Asef-Vaziri.
John Loucks Modifications by A. Asef-Vaziri Slides by St. Edward’s
Linear Programming.
Solver Linear Problem Solving MAN Micro-computers & Their Applications.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
Kerimcan OzcanMNGT 379 Operations Research1 LP: Sensitivity Analysis and Interpretation of Solution Chapter 3.
LINEAR PROGRAMMING SIMPLEX METHOD.
Computational Methods for Management and Economics Carla Gomes
Linear Programming Chapter 13 Supplement.
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
1 Chapter 10 The primal linear program solution answers the tactical question when it tells us how much to produce. But the dual can have far greater impact.
Public Policy Modeling Simplex Method Tuesday, October 13, 2015 Hun Myoung Park, Ph.D. Public Management & Policy Analysis Program Graduate School of International.
1 LINEAR PROGRAMMING Introduction to Sensitivity Analysis Professor Ahmadi.
1 Chapter 7 Linear Programming. 2 Linear Programming (LP) Problems Both objective function and constraints are linear. Solutions are highly structured.
Chapter 6 Supplement Linear Programming.
Chapter 7 Introduction to Linear Programming
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
1 The Dual in Linear Programming In LP the solution for the profit- maximizing combination of outputs automatically determines the input amounts that must.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or.
Chapter 2 Introduction to Linear Programming n Linear Programming Problem n Problem Formulation n A Maximization Problem n Graphical Solution Procedure.
Professional software packages such as The WinQSB and LINDO provide the following LP information: Information about the objective function: –its optimal.
Chapter 6 Simplex-Based Sensitivity Analysis and Duality
 Minimization Problem  First Approach  Introduce the basis variable  To solve minimization problem we simple reverse the rule that is we select the.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Supplement 6 Linear Programming.
Kerimcan OzcanMNGT 379 Operations Research1 Linear Programming Chapter 2.
Sensitivity Analysis Introduction to Sensitivity Analysis
1 1 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole.
1 LP-3 Symplex Method. 2  When decision variables are more than 2, it is always advisable to use Simplex Method to avoid lengthy graphical procedure.
6s-1Linear Programming William J. Stevenson Operations Management 8 th edition.
1 2 Linear Programming Chapter 3 3 Chapter Objectives –Requirements for a linear programming model. –Graphical representation of linear models. –Linear.
Chapter 5 Sensitivity Analysis: An Applied Approach
Basic Linear Programming Concepts
INFM 718A / LBSC 705 Information For Decision Making
Integer Programming with LINGO
Linear Programming – Sensitivity Analysis
Applied Statistical and Optimization Models
Presentation transcript:

Agenda of Week VI. LP IV LP Application 3 Time assignment Beggar family LINGO illustration Understanding LP LP Interpretation 2 Objective function Decision variables Slack and surplus Shadow price Shadow cost Solving Week 5 1

Week 5 Review LP Solution 1 Examples Understanding LP

LINGO Illustration o Time assignment problem Modeling the minimization problem Transformation to standard form Solution

LP Interpretation o Optimal objective function value o Optimal decision variable values o Reduced/Shadow cost Negative effects of decision variable 1 whose current value is 0. (-) reduced cost means the improvement of obj. func.

LP Interpretation o Slack Amount of resources remaining after optimal solution What kinds of resources should be paid more attention to when multiple resources are o Surplus Amount of provisions over minimum requirement in optimal solution What kinds of provisions should be paid more attention to?

LP Interpretation o Dual/Shadow Price Positive effect of additional 1 to obj, func. of resource whose slack is 0 Resources whose slack is greater than 0 shadow price is 0 Upper bound of willingness-to-pay for additional resources

Beggar Family Problem Maximization of Income from Collecting by Adjusting the Frequency of Collecting Activities by 3 Sons

Beggar Family Problem Global optimal solution found. Objective value: Total solver iterations: 2 Variable Value Reduced Cost F S T Row Slack or Surplus Dual Price OBJECTIVE T-money Lunchbox

Time Assignment Problem

Global optimal solution found. Objective value: Total solver iterations: 2 Variable Value Reduced Cost S D A E G Row Slack or Surplus Dual Price TIME UTILITY

Lingo Illustration o Beggar family problem Solving and interpretation o Time assignment problem Solving and interpretation