Prediction of real life phenomena For model to be reliable, model validation is necessary Judgement, Experience Model Simplify Real World Is performance,

Slides:



Advertisements
Similar presentations
Optimization problems using excel solver
Advertisements

Example 2.2 Estimating the Relationship between Price and Demand.
With Vegetable Farm Example
Chapter 19 – Linear Programming
Standard Minimization Problems with the Dual
Introduction to Mathematical Programming Matthew J. Liberatore John F. Connelly Chair in Management Professor, Decision and Information Technologies.
Linear Programming. Introduction: Linear Programming deals with the optimization (max. or min.) of a function of variables, known as ‘objective function’,
Linear Programming (LP) (Chap.29)
OPSM 301 Operations Management
Linear Programming.
Linear Programming Models & Case Studies
Operations Management Linear Programming Module B - Part 2
Chapter 2 Matrices Finite Mathematics & Its Applications, 11/e by Goldstein/Schneider/Siegel Copyright © 2014 Pearson Education, Inc.
19 Linear Programming CHAPTER
Goldstein/Schnieder/Lay: Finite Math & Its Applications, 9e 1 of 86 Chapter 2 Matrices.
Operations Management Capacity Planning Supplement 7
Operations Management
BUS 2420 Management Science
6s-1Linear Programming CHAPTER 6s Linear Programming.
© 2000 by Prentice-Hall Inc Russell/Taylor Oper Mgt 3/e Chapter 11 Capacity Planning And Aggregate Production Planning.
INTRODUCTION TO LINEAR PROGRAMMING
Regression Analysis In regression analysis we analyze the relationship between two or more variables. The relationship between two or more variables could.
Finite Mathematics & Its Applications, 10/e by Goldstein/Schneider/SiegelCopyright © 2010 Pearson Education, Inc. 1 of 86 Chapter 2 Matrices.
McGraw-Hill/Irwin © 2006 The McGraw-Hill Companies, Inc., All Rights Reserved. 1.
Modeling Traffic in St. Louis By Julia Greenberger.
Chapter 4 An Introduction to Optimization
By Saparila Worokinasih
Product Mix Problem Monet company makes four types of frames.
Robert Delgado Chris Mui Amanda Smith Presented to: Dr. Sima Parisay Due: October 20 th, 2011 California State Polytechnic University, Pomona.
Linear Programming Topics General optimization model LP model and assumptions Manufacturing example Characteristics of solutions Sensitivity analysis Excel.
1 DSCI 3023 Linear Programming Developed by Dantzig in the late 1940’s A mathematical method of allocating scarce resources to achieve a single objective.
TEMPLATE DESIGN © The economic impact of a limitation on production in a linear programming input-output model Wolfgang.
1 Chapter 7 Linear Programming. 2 Linear Programming (LP) Problems Both objective function and constraints are linear. Solutions are highly structured.
1. Inverse of A 2. Inverse of a 2x2 Matrix 3. Matrix With No Inverse 4. Solving a Matrix Equation 1.
Goal: Solve a system of linear equations in two variables by the linear combination method.
CH.8 Forecasting Learning objectives: After completing this chapter, you should be able to: 1.Explain the importance of forecasting in organization. 2.Describe.
2  Systems of Linear Equations: ✦ An Introduction ✦ Unique Solutions ✦ Underdetermined and Overdetermined Systems  Multiplication of Matrices  The Inverse.
1 The Dual in Linear Programming In LP the solution for the profit- maximizing combination of outputs automatically determines the input amounts that must.
Advanced Operations Research Models Instructor: Dr. A. Seifi Teaching Assistant: Golbarg Kazemi 1.
Chapter 1 Introduction n Introduction: Problem Solving and Decision Making n Quantitative Analysis and Decision Making n Quantitative Analysis n Model.
Do Now (3x + y) – (2x + y) 4(2x + 3y) – (8x – y)
Integer Programming. Programming = Planning in this context Origins go back to military logistics in WWII (1940s). In a survey of Fortune 500 firms, 85%
LINEAR PROGRAMMING.
Linear Programming.  Linear Programming provides methods for allocating limited resources among competing activities in an optimal way.  Linear → All.
1 Optimization Techniques Constrained Optimization by Linear Programming updated NTU SY-521-N SMU EMIS 5300/7300 Systems Analysis Methods Dr.
Introduction to Linear Programming and Formulation Meeting 2 Course: D Deterministic Optimization Year: 2009.
MCCARL AND SPREEN TEXT CH. 2 T Y/MCCARL-BRUCE/BOOKS.HTM Lecture 2: Basic LP Formulation.
EMGT 5412 Operations Management Science Nonlinear Programming: Introduction Dincer Konur Engineering Management and Systems Engineering 1.
Linear Programming McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Operations Research.  Operations Research (OR) aims to having the optimization solution for some administrative problems, such as transportation, decision-making,
Gestão de Sistemas Energéticos 2015/2016 Energy Analysis: Input-Output Prof. Tânia Sousa
Supply Chain Management By Dr. Asif Mahmood Chapter 9: Aggregate Planning.
SALES AND OPERATIONS PLANNING AGGREGATE PLANNING PRODUCTION PLANNING OPERATIONS PLANNING How to meet effectively and efficiently forecasted requirements.
Matrices When data from a table (or tables) needs to be manipulated, easier to deal with info in form of a matrix. Fresh Soph Jun Sen A B 7 C 1 6.
Linear Programming – Introduction
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
19 Profit-Maximization.
EMIS 8373: Integer Programming
Introduction to linear programming (LP): Minimization
Capacity Planning.
Functions Introduction.
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Solve Linear Equations by Elimination
Chapter 8 Goal Programming.
Linear Programming I: Simplex method
4-5 Scatter Plots and Lines of Best Fit
Integer Programming.
Input-output tables THE CONTRACTOR IS ACTING UNDER A FRAMEWORK CONTRACT CONCLUDED WITH THE COMMISSION.
Input-output tables Robin Lynch
Forecasting 3 Regression Analysis Ardavan Asef-Vaziri
Presentation transcript:

Prediction of real life phenomena For model to be reliable, model validation is necessary Judgement, Experience Model Simplify Real World Is performance, prediction O.K? Revise Model Continue using model No Yes ? Try different simplifying assumptions

PICTORIAL Visual pictures, Cartoons, Road signs SCHEMATIC Organization chart with authority relationships, information flow, current flow + VARIETY OF MODELS

JFMAMJJ x x x x x x x Ft = a + bt Month Demand FORECASTING MODEL Regression (Descriptive) EXAMPLES OF SYMBOLIC MODELS

INVENTORY MODEL EOQ =  2d C ordering / iC Time Inventory Approximation, d actual

PRESCRIPTIVE MODEL Time Annual Costs Ordering Cost/annum = C o d /q Carrying Cost /annum = q  iC 2

A B C D E Ideal Capacity Profit Sales Representation x 1 (desk) x 2 (tables) x 1  6 x 2  8 PROFIT = 80x x 2 Pt. Profit O(0,0) = 0 A(0,8) = 320 B(2,8) = 480 C(6,8) = 800 D(6,4) = 640 E(6,0) = 480 O

FOR STATED PRIORITIES : BEST SOLUTION IS x 1 = 6, x 2 = 8, d 1 = 4 d 1 = d 2 = d 3 = 0 First two goals not achieved Third goal not achieved, Since overtime = 4 hours TRY CHANGING SEQUENCE OF PRIORITIES AND INVESTIGATE IF SOLUTION CHANGES Point C above

Decision Variables x 1 = no. of desks produced /week x 2 = no. of tables produced / week Constraints ( Goal constraints & System Constraints) d 1 + = overtime operation (if any) d 1 - = idle time when production does not exhaust capacity Sales capacity x 1  6 or x 1 + d 2 - = 6 Constraints x 2  8or x 2 + d 3 - = 8

Capacity Constraint: x1+ x2+ d1 - – d2+ = 10 Objective function P1 Minimize underutilization of production capacity (d 1 - ) P 2 Min (2d d 3 - ) P 3 Min (d 1 + )

COMPLETE GP MODEL Minimize Z = P 1 d P 2 d P 2 d P 3 d 1 + subject to (1)….x 1 + x 2 + d d 1 + = 10 (2)….x 1 + d 2 - = 6 (3)…. x 2 + d 3 - = 8 Non - negativity restrictions x 1, x 2, d 1 -, d 2 -, d 3 -, d 1 +  0

LP MODEL Maximize Z = p 1 x 1 + p 2 x 2 + … +p n x n subject to a 11 x 1 + a 12 x 2 + … + a 1n x n < b 1 a 21 x 1 + a 22 x 2 + … + a 2n x n < b 2 … a m1 x 1 + a m2 x 2 + … + a mn x n < b m L i < x i < U i (i = 1, …, n)

NOTATION Industry 1 Industry j Industry 2 Industry i Industry n Industry k y ij n = Number of industries y i j = Amount of good i needed by industry j b i = Exogenous demand of good i bibi

MASS BALANCE EQUATIONS The total amount x i which industry i must produce to exactly meet the demands is x i =  y ij + b i, i = 1,…n

PRODUCTION FUNCTIONS We must relate the inputs y ij to the output x j for each industry j Industry j Industry i y ij xjxj a ij = number of units of good i needed to make 1 unit of good j y ij = a ij x j for all i,j

INPUT-OUTPUT COEFFICIENTS a ij are known as Input-Output Coefficients or Technological Coefficients Production of j th industry, x j Input of i th industry to industry j, y ij Slope = a ij Linearity assumed No economies or diseconomies Static (constant a ij ) Dynamic (varying a ij )

THE BASIC PRODUCTION MODEL Substituting the production function equations in the mass balance equations, we obtain the basic production model of LEONTIEF: x 1 = a 11 x 1 + a 12 x 2 + … +a 1n x n + b 1 x 2 = a 21 x 1 + a 22 x a 2n x n + b 2.. x n = a n1 x 1 + a n2 x 2 + … + a nn x n + b n In matrix notation: X = AX + B, or X= (I-A) -1 B

PRICES IN THE LEONTIEF SYSTEM p j = Unit price of good j a ij p i = Cost of a ij units of good i required to make one unit of good j. The cost of goods 1, 2, …, n needed to make one unit of good j =  i=1n a ij p i If the value added by industry j is r j, p j -  I=1 n a ij p i = r j, j = 1, …, n

THE PRICE MODEL In Matrix notation (I-A) T P = R or P = [(I-A) -1 ] T R X= (I-A) -1 B Price model Production model A is the matrix of technological coefficients P is the price vector R is the of value added vector T denotes transpose & I the Identity matrix