Operation Research II
|
|
- Felicity Robertson
- 5 years ago
- Views:
Transcription
1 Operation Research II Johan Oscar Ong, ST, MT
2 Grading Requirements: Min 80% Present in Class Having Good Attitude Score/Grade : Quiz and Assignment : 30% Mid test (UTS) : 35% Final Test (UAS) : 35% No additional assignment to increase your score Assignment should be submitted on time
3 outline Meeting Topics 1 Goal Programming (1) 2 Goal Programming (2) Quiz 1 3 Integer linear Programming (part 1) Quiz 2 4 Integer linear Programming (part 2) Quiz 3 5 Deterministic dynamic programming (part 1) Quiz 4 6 Review and Quiz 7 Midterm Test 8 Deterministic dynamic programming (part 2) Quiz 5 9 Decision analysis Quiz 6 10 Games Theory Quiz 7 11 Queuing System (part 1) 12 Queuing System (part 2) Quiz 8 13 Deterministic Inventory model Quiz 9
4 Goal Programming
5 What is Goal Programming? Mathematical model similar to Linear Programming, however it allows for multiple goals to be satisfied at the same time. Allows for the multiple goals to be prioritized Allows for the multiple goals to be prioritized and weighted to account for the DM s utility for meeting the various goals.
6 Assumptions Similar to LP: Non-negative variables Conditions of certainty Variables are independent Limited resources Deterministic
7 Components Economic Constraints Physical Concerned with resources Cannot be violated Example: # of production hours each week
8 Components Goal Constraints Variable Concerned with target values Can be changed/modified Example: Desire to achieve a certain level of profit
9 Components Objective Function Minimizes the sum of the weighted deviations from the target values this is ALWAYS the objective for Goal Programming Not the same as LP (which was maximize revenue/minimize costs)
10 Goal Programming Steps Define decision variables Define Deviational Variable for each goal Formulate Constraint Equations Economic constraints Goal constraints Formulate Objective Function
11 Goal Programming Terms Decision Variables are the same as those in LP formulations (represent products, hours worked) Deviational Variables represent overachieving or underachieving the desired level of each goal d+ Represents overachieving level of the goal d- Represents underachieving level of the goal
12 Goal Programming Constraints Economic Constraints Stated as <=, >=, or = Linear (stated in terms of decision variables) Example: 3x + 2y <= 50 hours Goal Constraints General form of goal constraint: Decision Variables - d + + d - = Desired Goal Level
13 Goal Programming Example Microcom is a growth oriented firm which establishes monthly performance goals for its sales force Microcom determines that the sales force has a maximum available hours per month for visits of 640 hours Further, it is estimated that each visit to a potential new client requires 3 hours and each visit to a current client requires 2 hours
14 Goal Programming Example Microcom establishes two goals for the coming month: Contact at least 200 current clients Contact at least 120 new clients Overachieving either goal will not be penalized
15 Goal Programming Example Steps Required: 1. Define the decision variables 2. Define the goals and deviational variables 3. Formulate the GP Model s Parameters: Economic Constraints Goal Constraints Objective Function 4. Solve the GP using the graphical approach
16 Goal Programming Example Step 1: Define the decision variables: X1 = the number of current clients visited X2 = the number of new clients visited Step 2: Define the goals: Goal 1 Contact 200 current clients Goal 2 Contact 120 new clients
17 Goal Programming Example Step 3: Define the deviational variables d1+ = the number of current clients visited in excess of the goal of 200 d1- = the number of current clients visited less than the goal of 200 d2+ = the number of new clients visited in excess of the goal of 120 d2- = the number of new clients visited less than the goal of 120
18 Goal Programming Example Formulate the GP Model: Economic Constraints: 2X1 + 3X2 <= 640 (note: can be <, =, >) X1, X2 => 0 d1+, d1-, d2+, d2- => 0 Goal Constraints: Current Clients: X1 + d1- - d1+ = 200 New Clients: X2 + d2- - d2+ = 120 Must be =
19 Goal Programming Example WebNet establishes two goals for the coming month: Contact at least 200 current clients Contact at least 120 new clients Overachieving either goal will not be penalized
20 Goal Programming Example Objective Function: Minimize Weighted Deviations Minimize Z = d1 - + d2 -
21 Goal Programming Example Complete formulation: Minimize Z = d1 - + d2 - Subject to: 2X1 + 3X2 <= 640 X1 + d1 - - d1 + = 200 X2 + d2 - - d2 + = 120 X1, X2 => 0 d1 +, d1 -, d2 +, d2 - => 0
22 Goal Programming Example Graph constraint: 2X1 + 3X2 = 640 If X1 = 0, X2 = 213 If X2 = 0, X1 = 320 Plot points (0, 213) and (320, 0)
23 Graphical Solution X (0,213) (320,0) X 1
24 Goal Programming Example Graph deviation lines X1 + d1 - - d1 + = 200 (Goal 1) X2 + d2 - - d2 + = 120 (Goal 2) Plot lines for X1 = 200, X2 = 120
25 Goal Programming Example (0,213) X 2 Goal (140,120) d 1 - (200,80) d 1 + d d 2 Goal 2 (320,0) X 1
26 Solving Graphical Goal Programming Want to Minimize d1 - + d2 - So we evaluate each of the candidate solution points: Optimal Point For point (140, 120) d1 - = 60 and d2 - = 0 Z = = 60 For point (200, 80) d1 - = 0 and d2 - = 40 Z = = 40 Contact at least 200 current clients Contact at least 120 new clients
27 Goal Programming Solution X1 = 200 Goal 1 achieved X2 = 80 Goal 2 not achieved d1+ = 0 d2+ = 0 d1- = 0 d2- = 40 Z = 40
28
29 13.5 Goal Programming Goals are prioritized in some sense, and their level of aspiration is stated. An optimal solution is attained when all the goals are reached as close as possible to their aspiration level, while satisfying a set of constraints. There are two types of goal programming models: Nonpreemtive goal programming - no goal is pre-determined to dominate any other goal. Preemtive goal programming - goals are assigned different priority levels. Level 1 goal dominates level 2 goal, and so on.
30 NONPREEMTIVE GOAL PROGRAMMING An Advertisement Example A company is considering three forms of advertising. Cost per Ad Customers Television Newspaper Goals Goal 1: Spend no more $25,000 on advertising. Goal 2: Reach at least 30,000 new potential customers. Goal 3: Run at least 10 television spots.
31 An Advertisement Example If these were constraints rather than goals we would have: 3000X X X 3 25, X X X 3 30,000 X 1 10 No feasible solution exists that satisfies all the constraints. When these constraints are simply goals they are to be reached as close as possible.
32 An Advertisement Example Detrimental variables Ui = the amount by which the left hand side falls short of (under) its right had side value. Ei = the amount by which the left side exceeds its right had side value. The goal equations 3000X X X 3 + U 1 E 1 = 25, X X X 3 + U 2 E 2 = 30,000 X 1 + U 3 E 3 = 10
33 An Advertisement Example The objective is to minimize the penalty of not meeting the goals, represented by the detrimental variables E1, U2, U3. 25,000 30,000 10
34 An Advertisement Example The penalties are estimated to be as follows: Each extra dollar spent on advertisement above $25,000 cost the company $1. There is a loss of $5 to the company for each customer not being reached, below the goal of 30,000. Each television spot below 10 is worth 100 times each dollar over budget.
35 An Advertisement Example The goal programming model It is assumed that no advantage is gained by overachieving a goal. Minimize 1E 1 + 5U U 3 s.t. 3000X X X 3 + U 1 E 1 = 25, X X X 3 + U 2 E 2 = 30,000 X 1 + U 3 E 3 = 10 All variables are non-negative.
36 PREEMTIVE GOAL PROGRAMMING - New England Cycle Company The NECC is planning next month production of its two bicycles B2 and S10. Data Both models use the same seats and tires seats are available; 2400 tires are available gear assembly are available (used only in the S10 model). Production time per unit: 2 hours for B2; 3 hours for S10. Profit: $40 for each B2; 10$ for each S10.
37 NECC Prioritized Goals Priority 1: Fulfill a contract for 400 B2 bicycles to be delivered next month. Priority 2: Produce at least 1000 total bicycles during the month. Priority 3: Achieve at least $100,000 profit for the month. Use no more than 1600 labor-hours during the month. Priority 4: At least 200 tires left over at the end of the month. At least 100 gear assemblies left over at the end of the month.
38 New England Cycle Company Example Management wants to determine the production schedule that best meets its prioritized schedule.
39 NECC - SOLUTION Decision variables X 1 = The number of B2s to be produced next month X 2 = The number of S10s to be produced next month Functional / nonnegativity constraints 2X 2X X X X + 2X,X Seats Gear assemblies Tires
40 NECC - SOLUTION Goal constraints Priority 1 (goal 1): Production of at least 400 B2s + U 1 - E 1 = 400 X 1 Priority 2 (goal 2): Production of at least 1000 total cycles X 1 + X 2 + U 2 - E 2 = 1000 Priority 3 (goal 3) Profit of at least $100,000.04X X 2 + U 3 - E 3 = 100 (in $1000) Priority 3 (goal 4) Use a maximum of 1600 labor hours 2X 1 + 3X 2 + U 4 - E 4 = 1600 Priority 4 (goal 5) At least 200 leftover tires 2X 1 + 2X 2 + U 5 - E 5 = 2200 Priority 4 (goal 6) At least 100 leftover gear assembly + U 6 - E 6 = 900 X 2
41 NECC - SOLUTION Priority level objectives Priority 1: Underachieving a production of 400 B2s: Minimize U 1 Priority 2: Underachieving a total production of 1000: Minimize U 2
42 NECC - SOLUTION Priority level objectives Priority 3: Underachieving a $100,000 profit Using more than 1600 labor-hours Minimize 30U 3 + E 4 Each $1,000 short of the $100,000 goal is considered 30 times as important as utilizing an extra labor-hour.
43 NECC - SOLUTION Priority level objectives Priority 4: Using more than 2200 tires Using more than 900 gear assemblies Minimize E 5 + 2E 6 Each leftover gear assembly is deemed twice as important as leftover tire.
44 NECC - The solution procedure Solve the linear goal programming for priority 1 objective, under the set of regular constraints and goal constraint as shown below Minimize U 1 X 1 = 400, thus U 1 = 0, and priority 1 goal is fully achieved. ST 2X 2X X X 2X X 1 + U 1 - E 1 = Seats Gear Tires
45 NECC - The solution procedure Solve the linear goal programming for priority 2 level objective, under the set of original constraints plus the constraint X (maintain the level of achievement of the priority 1 goal). Minimize U 2 Every point that satisfies X 1 + X yields U 2 = 0, and therefore, priority 2 goal is fully achieved. ST 2X 2X X X 2X X X 1 + X 2 + U 2 - E 2 = 1000 Seats Gear Tires
46 NECC - The solution procedure Solve the linear goal programming for priority 3 level objective, under the set of original constraints plus the constraint X (maintain the level of achievement of the priority 1 goal), plus the constraint X 1 + X (maintain the level of achievement of the priority 2 goal). Every point in the range X 1 = 400 and 600 X is optimal for this model; 30U 3 + E 4 = 1720 is the level of achievement for the priority 3 goal.
47 NECC - The solution procedure Solve the linear goal programming for priority 4 level objective, and notice that after the previous step the feasible region is reduced to a segment of a straight line between the points (400,600) and (400,800). X1 =400; 600 X2 700 and E5 + 2E6 = 0
48 NECC - Solution Summary In summary NECC should produce 400 B2 model Between 600 and 700 S10 model
Optimization Methods in Management Science
Optimization Methods in Management Science MIT 15.053, Spring 013 Problem Set (Second Group of Students) Students with first letter of surnames I Z Due: February 1, 013 Problem Set Rules: 1. Each student
More informationSolving Examples of Linear Programming Models
Solving Examples of Linear Programming Models Chapter 4 Copyright 2013 Pearson Education 4-1 Chapter Topics 1. A Product Mix Example 2. A Diet Example 3. An Investment Example 4. A Marketing Example 5.
More informationPORTFOLIO OPTIMIZATION AND EXPECTED SHORTFALL MINIMIZATION FROM HISTORICAL DATA
PORTFOLIO OPTIMIZATION AND EXPECTED SHORTFALL MINIMIZATION FROM HISTORICAL DATA We begin by describing the problem at hand which motivates our results. Suppose that we have n financial instruments at hand,
More informationHomework #2 Graphical LP s.
UNIVERSITY OF MASSACHUSETTS Isenberg School of Management Department of Finance and Operations Management FOMGT 353-Introduction to Management Science Homework #2 Graphical LP s. Show your work completely
More informationAssignment 2 Answers Introduction to Management Science 2003
Assignment Answers Introduction to Management Science 00. a. Top management will need to know how much to produce in each quarter. Thus, the decisions are the production levels in quarters,,, and. The
More informationApplications of Linear Programming
Applications of Linear Programming lecturer: András London University of Szeged Institute of Informatics Department of Computational Optimization Lecture 8 The portfolio selection problem The portfolio
More informationLesson Topics. B.3 Integer Programming Review Questions
Lesson Topics Rounding Off (5) solutions in continuous variables to the nearest integer (like 2.67 rounded off to 3) is an unreliable way to solve a linear programming problem when decision variables should
More informationNon-negativity: negativity:
Chapter 3 Linear Programming Applications The process of problem formulation Marketing and media applications Financial Applications Transportation Problem The process of problem formulation 1. Provide
More informationThe homework is due on Wednesday, September 7. Each questions is worth 0.8 points. No partial credits.
Homework : Econ500 Fall, 0 The homework is due on Wednesday, September 7. Each questions is worth 0. points. No partial credits. For the graphic arguments, use the graphing paper that is attached. Clearly
More informationPre-Conference Workshops
Pre-Conference Workshops Michael Bussieck Steve Dirkse Fred Fiand Lutz Westermann GAMS Development Corp. GAMS Software GmbH www.gams.com Outline Part I: An Introduction to GAMS Part II: Stochastic programming
More informationMgtOp 470 Business Modeling with Spreadsheets Washington State University Sample Final Exam
MgtOp 470 Business Modeling with Spreadsheets Washington State University Sample Final Exam Section 1 Multiple Choice 1. An information desk at a rest stop receives requests for assistance (from one server).
More informationInteger Programming. Review Paper (Fall 2001) Muthiah Prabhakar Ponnambalam (University of Texas Austin)
Integer Programming Review Paper (Fall 2001) Muthiah Prabhakar Ponnambalam (University of Texas Austin) Portfolio Construction Through Mixed Integer Programming at Grantham, Mayo, Van Otterloo and Company
More informationContinuing Education Course #287 Engineering Methods in Microsoft Excel Part 2: Applied Optimization
1 of 6 Continuing Education Course #287 Engineering Methods in Microsoft Excel Part 2: Applied Optimization 1. Which of the following is NOT an element of an optimization formulation? a. Objective function
More informationThursday, March 3
5.53 Thursday, March 3 -person -sum (or constant sum) game theory -dimensional multi-dimensional Comments on first midterm: practice test will be on line coverage: every lecture prior to game theory quiz
More informationMaster of Business Administration - General. Cohort: MBAG/14/PT Mar. Examinations for Semester II / 2014 Semester I
Master of Business Administration - General Cohort: MBAG/14/PT Mar Examinations for 2013 2014 Semester II / 2014 Semester I MODULE: OPERATIONS RESEARCH MODULE CODE: MGMT5214 DURATION: 3 HOURS Instructions
More informationChapter Two: Linear Programming: Model Formulation and Graphical Solution
Chapter Two: Linear Programming: Model Formulation and Graphical Solution PROBLEM SUMMARY 1. Maximization (1 28 continuation), graphical solution 2. Minimization, graphical solution 3. Sensitivity analysis
More informationStochastic Programming IE495. Prof. Jeff Linderoth. homepage:
Stochastic Programming IE495 Prof. Jeff Linderoth email: jtl3@lehigh.edu homepage: http://www.lehigh.edu/~jtl3/ January 13, 2003 Today s Outline About this class. About me Say Cheese Quiz Number 0 Why
More informationExaminations for Semester II. / 2011 Semester I
PROGRAMME MBA-Human Resources & knowledge Management MBA- Project Management Master of Business Administration General MBA-Marketing Management COHORT MBAHR/11/PT MBAPM/11/PT MBAG/11/PT MBAMM/11/PT Examinations
More informationGAME THEORY. Game theory. The odds and evens game. Two person, zero sum game. Prototype example
Game theory GAME THEORY (Hillier & Lieberman Introduction to Operations Research, 8 th edition) Mathematical theory that deals, in an formal, abstract way, with the general features of competitive situations
More informationLinear Programming: Sensitivity Analysis and Interpretation of Solution
8 Linear Programming: Sensitivity Analysis and Interpretation of Solution MULTIPLE CHOICE. To solve a linear programming problem with thousands of variables and constraints a personal computer can be use
More informationProduct Mix Problem: Fifth Avenue Industries. Linear Programming (LP) Can Be Used for Many Managerial Decisions:
Linear Programming (LP) Can Be Used for Many Managerial Decisions: Product mix Make-buy Media selection Marketing research Portfolio selection Shipping & transportation Multiperiod scheduling For a particular
More information2016 EXAMINATIONS ACCOUNTING TECHNICIAN PROGRAMME PAPER TC 3: BUSINESS MATHEMATICS & STATISTICS
EXAMINATION NO. 16 EXAMINATIONS ACCOUNTING TECHNICIAN PROGRAMME PAPER TC : BUSINESS MATHEMATICS & STATISTICS WEDNESDAY 0 NOVEMBER 16 TIME ALLOWED : HOURS 9.00 AM - 12.00 NOON INSTRUCTIONS 1. You are allowed
More informationDeveloping Optimized Maintenance Work Programs for an Urban Roadway Network using Pavement Management System
Developing Optimized Maintenance Work Programs for an Urban Roadway Network using Pavement Management System M. Arif Beg, PhD Principal Consultant, AgileAssets Inc. Ambarish Banerjee, PhD Consultant, AgileAssets
More informationHandout 8: Introduction to Stochastic Dynamic Programming. 2 Examples of Stochastic Dynamic Programming Problems
SEEM 3470: Dynamic Optimization and Applications 2013 14 Second Term Handout 8: Introduction to Stochastic Dynamic Programming Instructor: Shiqian Ma March 10, 2014 Suggested Reading: Chapter 1 of Bertsekas,
More informationCHAPTER 6: RISK AVERSION AND CAPITAL ALLOCATION TO RISKY ASSETS
CHAPTER 6: RISK AVERSION AND CAPITAL ALLOCATION TO RISKY ASSETS PROBLEM SETS 1. (e) 2. (b) A higher borrowing is a consequence of the risk of the borrowers default. In perfect markets with no additional
More informationSvensson (1994) model and the Nelson & Siegel (1987) model
Mälardalens University Department of Mathematrics and Physics December 005 Svensson (994) model and the Nelson & Siegel (987) model Analytical Finance Group Benjamin Kwesi Osei Amoako Isaac Acheampong
More informationEcon 214Q Second Midterm August 4, 2005
Econ 214Q Second Midterm August 4, 2005 Name: Answer the questions fully to your best ability. Use the space provided. If you run out of room, use the backsides. No partial credit will be given if you
More informationGAME THEORY. (Hillier & Lieberman Introduction to Operations Research, 8 th edition)
GAME THEORY (Hillier & Lieberman Introduction to Operations Research, 8 th edition) Game theory Mathematical theory that deals, in an formal, abstract way, with the general features of competitive situations
More informationSubject O Basic of Operation Research (D-01) Date O 20/04/2011 Time O 11.00 to 02.00 Q.1 Define Operation Research and state its relation with decision making. (14) What are the opportunities and short
More informationCSCI 1951-G Optimization Methods in Finance Part 00: Course Logistics Introduction to Finance Optimization Problems
CSCI 1951-G Optimization Methods in Finance Part 00: Course Logistics Introduction to Finance Optimization Problems January 26, 2018 1 / 24 Basic information All information is available in the syllabus
More informationDeterministic Dynamic Programming
Deterministic Dynamic Programming Dynamic programming is a technique that can be used to solve many optimization problems. In most applications, dynamic programming obtains solutions by working backward
More informationOptimal Portfolio Selection
Optimal Portfolio Selection We have geometrically described characteristics of the optimal portfolio. Now we turn our attention to a methodology for exactly identifying the optimal portfolio given a set
More information3.3 - One More Example...
c Kathryn Bollinger, September 28, 2005 1 3.3 - One More Example... Ex: (from Tan) Solve the following LP problem using the Method of Corners. Kane Manufacturing has a division that produces two models
More informationBabu Banarasi Das National Institute of Technology and Management
Babu Banarasi Das National Institute of Technology and Management Department of Computer Applications Question Bank Masters of Computer Applications (MCA) NEW Syllabus (Affiliated to U. P. Technical University,
More informationMBA 7020 Sample Final Exam
Descriptive Measures, Confidence Intervals MBA 7020 Sample Final Exam Given the following sample of weight measurements (in pounds) of 25 children aged 4, answer the following questions(1 through 3): 45,
More informationOptimization for Chemical Engineers, 4G3. Written midterm, 23 February 2015
Optimization for Chemical Engineers, 4G3 Written midterm, 23 February 2015 Kevin Dunn, kevin.dunn@mcmaster.ca McMaster University Note: No papers, other than this test and the answer booklet are allowed
More informationSolving real-life portfolio problem using stochastic programming and Monte-Carlo techniques
Solving real-life portfolio problem using stochastic programming and Monte-Carlo techniques 1 Introduction Martin Branda 1 Abstract. We deal with real-life portfolio problem with Value at Risk, transaction
More informationOptimizing the service of the Orange Line
Optimizing the service of the Orange Line Overview Increased crime rate in and around campus Shuttle-UM Orange Line 12:00am 3:00am late night shift A student standing or walking on and around campus during
More informationChapter 3. Consumer Behavior
Chapter 3 Consumer Behavior Question: Mary goes to the movies eight times a month and seldom goes to a bar. Tom goes to the movies once a month and goes to a bar fifteen times a month. What determine consumers
More informationComparative Study between Linear and Graphical Methods in Solving Optimization Problems
Comparative Study between Linear and Graphical Methods in Solving Optimization Problems Mona M Abd El-Kareem Abstract The main target of this paper is to establish a comparative study between the performance
More informationOptimization Methods in Management Science
Problem Set Rules: Optimization Methods in Management Science MIT 15.053, Spring 2013 Problem Set 6, Due: Thursday April 11th, 2013 1. Each student should hand in an individual problem set. 2. Discussing
More informationOptimize (Maximize or Minimize) Z=C1X1 +C2X2+..Cn Xn
Linear Programming Problems Formulation Linear Programming is a mathematical technique for optimum allocation of limited or scarce resources, such as labour, material, machine, money, energy and so on,
More informationCHAPTER 6: RISK AVERSION AND CAPITAL ALLOCATION TO RISKY ASSETS
CHAPTER 6: RISK AVERSION AND CAPITAL ALLOCATION TO RISKY ASSETS 1. a. The expected cash flow is: (0.5 $70,000) + (0.5 00,000) = $135,000 With a risk premium of 8% over the risk-free rate of 6%, the required
More informationPERT 12 Quantitative Tools (1)
PERT 12 Quantitative Tools (1) Proses keputusan dalam operasi Fundamental Decisin Making, Tabel keputusan. Konsep Linear Programming Problem Formulasi Linear Programming Problem Penyelesaian Metode Grafis
More informationLecture IV Portfolio management: Efficient portfolios. Introduction to Finance Mathematics Fall Financial mathematics
Lecture IV Portfolio management: Efficient portfolios. Introduction to Finance Mathematics Fall 2014 Reduce the risk, one asset Let us warm up by doing an exercise. We consider an investment with σ 1 =
More informationGraphical Sensitivity Analysis
What if there is uncertainly about one or more values in the LP model? Sensitivity analysis allows us to determine how sensitive the optimal solution is to changes in data values. This includes analyzing
More informationPrentice Hall Connected Mathematics, Grade 7 Unit 2004 Correlated to: Maine Learning Results for Mathematics (Grades 5-8)
: Maine Learning Results for Mathematics (Grades 5-8) A. NUMBERS AND NUMBER SENSE Students will understand and demonstrate a sense of what numbers mean and how they are used. Students will be able to:
More informationChapter 10 Inventory Theory
Chapter 10 Inventory Theory 10.1. (a) Find the smallest n such that g(n) 0. g(1) = 3 g(2) =2 n = 2 (b) Find the smallest n such that g(n) 0. g(1) = 1 25 1 64 g(2) = 1 4 1 25 g(3) =1 1 4 g(4) = 1 16 1
More informationBRIEF INTRODUCTION TO GAME THEORY
BRIEF INTRODUCTION TO GAME THEORY Game Theory Mathematical theory that deals with the general features of competitive situations. Examples: parlor games, military battles, political campaigns, advertising
More informationEcon 172A, W2002: Final Examination, Solutions
Econ 172A, W2002: Final Examination, Solutions Comments. Naturally, the answers to the first question were perfect. I was impressed. On the second question, people did well on the first part, but had trouble
More informationAdvanced Operations Research Prof. G. Srinivasan Dept of Management Studies Indian Institute of Technology, Madras
Advanced Operations Research Prof. G. Srinivasan Dept of Management Studies Indian Institute of Technology, Madras Lecture 23 Minimum Cost Flow Problem In this lecture, we will discuss the minimum cost
More informationOptimization Methods in Management Science
Optimization Methods in Management Science MIT 1.3 Recitation 1 TAs: Giacomo Nannicini, Ebrahim Nasrabadi Problem 1 You create your own start-up company that caters high-quality organic food directly to
More informationCSCI 1951-G Optimization Methods in Finance Part 07: Portfolio Optimization
CSCI 1951-G Optimization Methods in Finance Part 07: Portfolio Optimization March 9 16, 2018 1 / 19 The portfolio optimization problem How to best allocate our money to n risky assets S 1,..., S n with
More informationCHAPTER 6: RISK AVERSION AND CAPITAL ALLOCATION TO RISKY ASSETS
CHAPTER 6: RISK AVERSION AND PROBLE SETS 1. (e). (b) A higher borrowing rate is a consequence of the risk of the borrowers default. In perfect markets with no additional cost of default, this increment
More informationEcon 101A Final exam Mo 19 May, 2008.
Econ 101 Final exam Mo 19 May, 2008. Stefano apologizes for not being at the exam today. His reason is called Thomas. From Stefano: Good luck to you all, you are a great class! Do not turn the page until
More informationGame Theory Tutorial 3 Answers
Game Theory Tutorial 3 Answers Exercise 1 (Duality Theory) Find the dual problem of the following L.P. problem: max x 0 = 3x 1 + 2x 2 s.t. 5x 1 + 2x 2 10 4x 1 + 6x 2 24 x 1 + x 2 1 (1) x 1 + 3x 2 = 9 x
More informationEE365: Risk Averse Control
EE365: Risk Averse Control Risk averse optimization Exponential risk aversion Risk averse control 1 Outline Risk averse optimization Exponential risk aversion Risk averse control Risk averse optimization
More informationProblem Set 2: Answers
Economics 623 J.R.Walker Page 1 Problem Set 2: Answers The problem set came from Michael A. Trick, Senior Associate Dean, Education and Professor Tepper School of Business, Carnegie Mellon University.
More information1 Shapley-Shubik Model
1 Shapley-Shubik Model There is a set of buyers B and a set of sellers S each selling one unit of a good (could be divisible or not). Let v ij 0 be the monetary value that buyer j B assigns to seller i
More informationDM559/DM545 Linear and integer programming
Department of Mathematics and Computer Science University of Southern Denmark, Odense May 22, 2018 Marco Chiarandini DM559/DM55 Linear and integer programming Sheet, Spring 2018 [pdf format] Contains Solutions!
More informationTUTORIAL KIT OMEGA SEMESTER PROGRAMME: BANKING AND FINANCE
TUTORIAL KIT OMEGA SEMESTER PROGRAMME: BANKING AND FINANCE COURSE: BFN 425 QUANTITATIVE TECHNIQUE FOR FINANCIAL DECISIONS i DISCLAIMER The contents of this document are intended for practice and leaning
More informationLecture 3: Common Business Applications and Excel Solver
Lecture 3: Common Business Applications and Excel Solver Common Business Applications Linear Programming (LP) can be used for many managerial decisions: - Product mix - Media selection - Marketing research
More informationAn Introduction to Linear Programming (LP)
An Introduction to Linear Programming (LP) How to optimally allocate scarce resources! 1 Please hold your applause until the end. What is a Linear Programming A linear program (LP) is an optimization problem
More informationMidterm 2 Example Questions
Midterm Eample Questions Solve LPs using Simple. Consider the following LP:, 6 ma (a) Convert the LP to standard form.,,, 6 ma (b) Starting with and as nonbasic variables, solve the problem using the Simple
More informationDynamic Resource Allocation for Spot Markets in Cloud Computi
Dynamic Resource Allocation for Spot Markets in Cloud Computing Environments Qi Zhang 1, Quanyan Zhu 2, Raouf Boutaba 1,3 1 David. R. Cheriton School of Computer Science University of Waterloo 2 Department
More informationChapter 7 An Introduction to Linear Programming
n Introduction to Linear Programming Learning Objectives 1. Obtain an overview of the kinds of problems linear programming has been used to solve. 2. Learn how to develop linear programming models for
More informationy 3 z x 1 x 2 e 1 a 1 a 2 RHS 1 0 (6 M)/3 M 0 (3 5M)/3 10M/ / /3 10/ / /3 4/3
AMS 341 (Fall, 2016) Exam 2 - Solution notes Estie Arkin Mean 68.9, median 71, top quartile 82, bottom quartile 58, high (3 of them!), low 14. 1. (10 points) Find the dual of the following LP: Min z =
More information36106 Managerial Decision Modeling Sensitivity Analysis
1 36106 Managerial Decision Modeling Sensitivity Analysis Kipp Martin University of Chicago Booth School of Business September 26, 2017 Reading and Excel Files 2 Reading (Powell and Baker): Section 9.5
More information1 Economical Applications
WEEK 4 Reading [SB], 3.6, pp. 58-69 1 Economical Applications 1.1 Production Function A production function y f(q) assigns to amount q of input the corresponding output y. Usually f is - increasing, that
More informationSOLVING ROBUST SUPPLY CHAIN PROBLEMS
SOLVING ROBUST SUPPLY CHAIN PROBLEMS Daniel Bienstock Nuri Sercan Özbay Columbia University, New York November 13, 2005 Project with Lucent Technologies Optimize the inventory buffer levels in a complicated
More informationIntermediate Management Accounting Overview
Intermediate Management Accounting Chartered Professional Accountants of Canada, CPA Canada, CPA are trademarks and/or certification marks of the Chartered Professional Accountants of Canada. 2017, Chartered
More informationTrue_ The Lagrangian method is one way to solve constrained maximization problems.
LECTURE 4: CONSTRAINED OPTIMIZATION ANSWERS AND SOLUTIONS Answers to True/False Questions True_ The Lagrangian method is one way to solve constrained maximization problems. False_ The substitution method
More informationThe application of linear programming to management accounting
The application of linear programming to management accounting After studying this chapter, you should be able to: formulate the linear programming model and calculate marginal rates of substitution and
More informationMath 167: Mathematical Game Theory Instructor: Alpár R. Mészáros
Math 167: Mathematical Game Theory Instructor: Alpár R. Mészáros Midterm #1, February 3, 2017 Name (use a pen): Student ID (use a pen): Signature (use a pen): Rules: Duration of the exam: 50 minutes. By
More informationMath1090 Midterm 2 Review Sections , Solve the system of linear equations using Gauss-Jordan elimination.
Math1090 Midterm 2 Review Sections 2.1-2.5, 3.1-3.3 1. Solve the system of linear equations using Gauss-Jordan elimination. 5x+20y 15z = 155 (a) 2x 7y+13z=85 3x+14y +6z= 43 x+z= 2 (b) x= 6 y+z=11 x y+
More informationNeuro-Dynamic Programming for Fractionated Radiotherapy Planning
Neuro-Dynamic Programming for Fractionated Radiotherapy Planning Geng Deng Michael C. Ferris University of Wisconsin at Madison Conference on Optimization and Health Care, Feb, 2006 Background Optimal
More informationMath Models of OR: More on Equipment Replacement
Math Models of OR: More on Equipment Replacement John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 12180 USA December 2018 Mitchell More on Equipment Replacement 1 / 9 Equipment replacement
More informationENGG OPT TECHNIQUES Fall 2008 SOLVED EXAMPLES
EXAMPLE 1 HILLIARD Electronics produces specially coded chips for laser surgery in 256MB and 512MB (MB stands for megabyte; where one megabyte is roughly equal to one million characters of information).
More informationX 410 Business Applications of Calculus
X 410 Business Applications of Calculus PROBLEM SET 1 [100 points] PART I As manager of a particular product line, you have data available for the past 11 sales periods. This data associates your product
More informationWeek 6: Sensitive Analysis
Week 6: Sensitive Analysis 1 1. Sensitive Analysis Sensitivity Analysis is a systematic study of how, well, sensitive, the solutions of the LP are to small changes in the data. The basic idea is to be
More informationIntroduction to Economics
Introduction to Economics Higher School of Economics 2018 Утверждена Академическим советом образовательной программы «5» сентября 2018 г., протокола_1 Академический руководитель образовательной программы
More informationCHAPTER 4 APPENDIX DEMAND THEORY A MATHEMATICAL TREATMENT
CHAPTER 4 APPENDI DEMAND THEOR A MATHEMATICAL TREATMENT EERCISES. Which of the following utility functions are consistent with convex indifference curves, and which are not? a. U(, ) = + b. U(, ) = ()
More informationLP OPTIMUM FOUND AT STEP 2 OBJECTIVE FUNCTION VALUE
The Wilson Problem: Graph is at the end. LP OPTIMUM FOUND AT STEP 2 1) 5520.000 X1 360.000000 0.000000 X2 300.000000 0.000000 2) 0.000000 1.000000 3) 0.000000 2.000000 4) 140.000000 0.000000 5) 200.000000
More informationIntroduction to Operations Research
Introduction to Operations Research Unit 1: Linear Programming Terminology and formulations LP through an example Terminology Additional Example 1 Additional example 2 A shop can make two types of sweets
More informationLinear Programming Formulations
Linear Programming Formulations For these problems you need to answer sensitivity analysis questions using excel. These questions appear in italic fonts. The excel files are available on the course website.
More informationChapter 2 Linear programming... 2 Chapter 3 Simplex... 4 Chapter 4 Sensitivity Analysis and duality... 5 Chapter 5 Network... 8 Chapter 6 Integer
目录 Chapter 2 Linear programming... 2 Chapter 3 Simplex... 4 Chapter 4 Sensitivity Analysis and duality... 5 Chapter 5 Network... 8 Chapter 6 Integer Programming... 10 Chapter 7 Nonlinear Programming...
More informationEcon 101A Final Exam We May 9, 2012.
Econ 101A Final Exam We May 9, 2012. You have 3 hours to answer the questions in the final exam. We will collect the exams at 2.30 sharp. Show your work, and good luck! Problem 1. Utility Maximization.
More informationHomework 2 ECN205 Spring 2011 Wake Forest University Instructor: McFall
Homework 2 ECN205 Spring 2011 Wake Forest University Instructor: McFall Instructions: Answer the following problems and questions carefully. Just like with the first homework, I ll call names randomly
More informationOptimal Investment for Generalized Utility Functions
Optimal Investment for Generalized Utility Functions Thijs Kamma Maastricht University July 05, 2018 Overview Introduction Terminal Wealth Problem Utility Specifications Economic Scenarios Results Black-Scholes
More informationReuben Gronau s Model of Time Allocation and Home Production
Econ 301: Topics in Microeconomics Sanjaya DeSilva, Bard College, Spring 2008 Reuben Gronau s Model of Time Allocation and Home Production Gronau s model is a fairly simple extension of Becker s framework.
More informationEcon 101A Final exam May 14, 2013.
Econ 101A Final exam May 14, 2013. Do not turn the page until instructed to. Do not forget to write Problems 1 in the first Blue Book and Problems 2, 3 and 4 in the second Blue Book. 1 Econ 101A Final
More informationAlgebra Success. LESSON 14: Discovering y = mx + b
T282 Algebra Success [OBJECTIVE] The student will determine the slope and y-intercept of a line by examining the equation for the line written in slope-intercept form. [MATERIALS] Student pages S7 S Transparencies
More informationThe Lagrangian method is one way to solve constrained maximization problems.
LECTURE 4: CONSTRAINED OPTIMIZATION QUESTIONS AND PROBLEMS True/False Questions The Lagrangian method is one way to solve constrained maximization problems. The substitution method is a way to avoid using
More informationThe Duration Derby: A Comparison of Duration Based Strategies in Asset Liability Management
The Duration Derby: A Comparison of Duration Based Strategies in Asset Liability Management H. Zheng Department of Mathematics, Imperial College London SW7 2BZ, UK h.zheng@ic.ac.uk L. C. Thomas School
More informationJohan Oscar Ong, ST, MT
Decision Analysis Johan Oscar Ong, ST, MT Analytical Decision Making Can Help Managers to: Gain deeper insight into the nature of business relationships Find better ways to assess values in such relationships;
More informationFinding optimal arbitrage opportunities using a quantum annealer
Finding optimal arbitrage opportunities using a quantum annealer White Paper Finding optimal arbitrage opportunities using a quantum annealer Gili Rosenberg Abstract We present two formulations for finding
More informationThe Optimization Process: An example of portfolio optimization
ISyE 6669: Deterministic Optimization The Optimization Process: An example of portfolio optimization Shabbir Ahmed Fall 2002 1 Introduction Optimization can be roughly defined as a quantitative approach
More informationReview consumer theory and the theory of the firm in Varian. Review questions. Answering these questions will hone your optimization skills.
Econ 6808 Introduction to Quantitative Analysis August 26, 1999 review questions -set 1. I. Constrained Max and Min Review consumer theory and the theory of the firm in Varian. Review questions. Answering
More informationProblem B.1, HR7E Solve the following LP graphically R. Saltzman
Problem B.1, HR7E Solve the following LP graphically R. Saltzman Maximize 4X + 6Y = Z subject to: (1) X + 2Y = Note: There is a typograhpical error in the book regarding
More informationOptimal Dam Management
Optimal Dam Management Michel De Lara et Vincent Leclère July 3, 2012 Contents 1 Problem statement 1 1.1 Dam dynamics.................................. 2 1.2 Intertemporal payoff criterion..........................
More information