Quantitative Analysis for Management Linear Programming Models:
|
|
- Brook Cameron
- 5 years ago
- Views:
Transcription
1 Quantitative Analysis for Management Linear Programming Models: by Prentice Hall, Inc., Upper Saddle River,
2 Linear Programming Problem. Tujuan adalah maximize or minimize variabel dependen dari beberapa kuantitas variabel independen (fungsi tujuan).. Batasan-batasan yang diperlukan guna mencapai tujuan. Tujuan dan Batasan dinyatakan dalam persamaan linear by Prentice Hall, Inc., Upper Saddle River,
3 Basic Assumptions of Linear Programming Certainty Proportionality Additivity Divisibility Nonnegativity by Prentice Hall, Inc., Upper Saddle River,
4 Flair Furniture Company Data - Table 7. Department Hours Required to Produce One Unit X Tables X Chairs Available Hours This Week Carpentry Painting/Varnishing Profit/unit $7 $ by Prentice Hall, Inc., Upper Saddle River,
5 Flair Furniture Company Data - Table 7. STEP : Objective: Maximize: 7 X + X 5 STEP : Constraints: X + 3 X X + X 4 40 (carpentry) 00 (painting & varnishing) by Prentice Hall, Inc., Upper Saddle River,
6 Number of Chairs Flair Furniture Company STEP 3: Plot Constraints 0 Feasible Region Painting/Varnishing Feasible Region Carpentry Number of Tables by Prentice Hall, Inc., Upper Saddle River,
7 Number of Chairs Flair Furniture Company Isoprofit Lines Painting/Varnishing 7X + 5X = 0 7X + 5X = 40 STEP 4: Plot Objective Function 40 0 Carpentry Number of Tables by Prentice Hall, Inc., Upper Saddle River,
8 Number of Chairs Flair Furniture Company Optimal Solution 0 Corner Points Painting/Varnishing 3 Solution (X = 30, X = 40) Carpentry 4 Number of Tables by Prentice Hall, Inc., Upper Saddle River,
9 Test Corner Point Solutions Point ) (0,0) => 7(0) + 5(0) = $0 Point ) (0,00) => 7(0) + 5(80) = $400 Point 3) (30,40) => 7(30) + 5(40) = $40 Point 4) (50,0) => 7(50) + 5(0) = $ by Prentice Hall, Inc., Upper Saddle River,
10 Solve Equations Simultaneously To get X & X values for Point 3: 4X + 3X <= 40 X + X <= 00 X = 60-3/4 X X = 50 - / X 60-3/4 X = 50 - / X = 3/4 X - / X 0 = /4 X 40 = X; so, 4X + 3(40) = 40 4X = 40-0 X = by Prentice Hall, Inc., Upper Saddle River,
11 Special Cases in LP Infeasibility Unbounded Solutions Redundancy Degeneracy More Than One Optimal Solution by Prentice Hall, Inc., Upper Saddle River,
12 A Problem with No Feasible Solution X Region Satisfying 3rd Constraint Region Satisfying First Constraints X by Prentice Hall, Inc., Upper Saddle River,
13 A Solution Region That is Unbounded to the Right X 5 X > 5 X < Feasible Region X + X > X by Prentice Hall, Inc., Upper Saddle River,
14 A Problem with a Redundant Constraint X X + X < 30 Redundant Constraint X < Feasible Region X + X < by Prentice Hall, Inc., Upper Saddle River, X
15 An Example of Alternate Optimal Solutions A Optimal Solution Consists of All Combinations of X and X Along the AB Segment B Isoprofit Line for $8 Isoprofit Line for $ Overlays Line Segment AB by Prentice Hall, Inc., Upper Saddle River,
16 Marketing Applications Media Selection - Win Big Gambling Club Medium Audience Reached Per Ad Cost Per Ad($) Maximum Ads Per Week TV spot ( minute) 5, Daily newspaper (full-page ad) Radio spot (30 seconds, prime time) Radio spot ( minute, afternoon) 8, , , Management, 7e by Render/Stair by Prentice Hall, Inc., Upper Saddle River,
17 Win Big Gambling Club Maximize : 5000 X X X X4 Subject to: X (max TV spots/week) X 5 ( max newspaper ads/week) X 3 5 ( max 30- sec. radio spots/week) X 4 0 (max - min. radio spots/week) 800 X + 95 X + 90 X X ( ad weekly budget) X 3 + X 4 5 (min radio spots/week) 90X + 380X (max radio expense) Management, 7e by Render/Stair by Prentice Hall, Inc., Upper Saddle River,
18 Manufacturing Applications Production Mix - Fifth Avenue Variety of Tie Selling Price per Tie ($) Monthly Contract Minimum Monthly Demand Material Required per Tie (Yds) Material Require ments All silk % silk All polyester % polyester Polycotton blend % poly/50% cotton Polycotton - blend % poly/70% cotton Management, 7e by Render/Stair by Prentice Hall, Inc., Upper Saddle River,
19 Fifth Avenue Maximize:4.08X X X X4 Subject to: 0. 5 X 800 (yards of X X X X X4 X 6000 (contract min,silk) X 000 (contract min,all polyester) X 4000 (contract max, silk) 600 (yards cotton) X (contract min,blend) X (contract min,blend) 3000 (yards all polyester) polyester) X 7000 (contract max,silk) X (contract max,blend) X (contract max, blend ) Management, 7e by Render/Stair by Prentice Hall, Inc., Upper Saddle River,
20 3,500 Manufacturing Applications Truck Loading - Goodman Shipping Item Value ($) Weight (lbs),500 7,500 4,000 7, ,000 3, ,500 3,500 5,500 4, ,750 3,500 Management, 7e by Render/Stair by Prentice Hall, Inc., Upper Saddle River,
21 Goodman Shipping Maximize Subject to : 7500 X X X X X X X load X value Management, 7e by Render/Stair X X 6 : 500 X X X X 3 (Capacity) X X X X by Prentice Hall, Inc., Upper Saddle River,
22 Flair Furniture Company Department Hours Required to Produce One Unit X Tables X Chairs Available Hours This Week Carpentry Painting/Varnishing Profit/unit Constraints: Objective: $7 $5 4 X + 3 X 40 X + X 00 Maximize: (carpentry) (painting & varnishing) 5 7 X + X by Prentice Hall, Inc., Upper Saddle River,
23 Number of Chairs Flair Furniture Company's Feasible Region & Corner Points X B = (0,80) Feasible Region X 4 X + 3 X 40 C = (30,40) X + X D = (50,0) Number of Tables by Prentice Hall, Inc., Upper Saddle River,
24 Flair Furniture - Adding Constraints: 4 X + 3 X X + X Slack Variables (carpentry) (painting & varnishing) Constraints with Slack Variables 4 X X + 3 X + X + S 7 X + X 5 + S Objective Function = 40 (carpentry = 00 (painting &varnishing Objective Function with Slack Variables X + S X S by Prentice Hall, Inc., Upper Saddle River, ) )
25 Flair Furniture s Initial Simplex Tableau Profit per Production Unit Mix Column Column C j $0 $0 Real Variables Columns Slack Variables Columns Constant Column $7 $5 $0 $0 Solution Mix X X S S Quantity S S Z j C j - Z j $0 $0 $0 $0 $7 $5 $0 $ $0 $0 Profit per unit row Constraint equation rows Gross profit row Net profit row by Prentice Hall, Inc., Upper Saddle River,
26 Pivot Row, Pivot Number Identified in the Initial Simplex Tableau C j $0 $0 $7 $5 $0 $0 Solution Mix X X S S Quantity S S Z j C j - Z j Pivot number $0 $0 $0 $0 $7 $5 $0 $0 Pivot column $0 $0 Pivot row by Prentice Hall, Inc., Upper Saddle River,
27 Completed Second Simplex Tableau for Flair Furniture C j $7 $0 $7 $5 $0 $0 Solution Mix X X S S Quantity X S / / Z j C j - Z j $7 $7/ $7/ $0 $350 $0 $3/ -$7/ $ by Prentice Hall, Inc., Upper Saddle River,
28 Pivot Row, Column, and Number Identified in Second Simplex Tableau C j $7 $0 $7 $5 $0 $0 Solution Mix X X S S Quantity X S Z j C j - Z j / / Pivot number $7 $7/ $7/ $0 $0 $3/ -$7/ $0 Pivot column $350 (Total Profit) Pivot row by Prentice Hall, Inc., Upper Saddle River,
29 Calculating the New X Row for Flair s Third Tableau ( Number in new X row) Number in old X row 0 3/ -/ 30 = ( ) ( Number ) Corresponding - x ( ) number in above pivot number = - (/) x = / - (/) x = / - (/) x = 0 - (/) x = 50 - (/) x new X row (0) () (-) () (40) by Prentice Hall, Inc., Upper Saddle River,
30 Final Simplex Tableau for the Flair Furniture Problem C j $7 $5 $7 $5 $0 $0 Solution Mix X X S S Quantity X X 0 3/ -/ Z j C j - Z j $7 5 $/ $3/ $0 $0 -$/ -$3/ $ by Prentice Hall, Inc., Upper Saddle River,
31 Simplex Steps for Maximization. Choose the variable with the greatest positive C j - Z j to enter the solution.. Determine the row to be replaced by selecting that one with the smallest (non-negative) quantity-topivot-column ratio. 3. Calculate the new values for the pivot row. 4. Calculate the new values for the other row(s). 5. Calculate the C j and C j - Z j values for this tableau. If there are any C j - Z j values greater than zero, return to Step by Prentice Hall, Inc., Upper Saddle River,
32 Surplus & Artificial Variables Constraints 5 X 5 X 5 X 5 X + 0 X + 30 X + 0X + 30X + 8 X + 8 X 3 3 = Constraints-Surplus & Artificial Variables - S Objective Function + 9 Min: X 7 5 X + X A A + 9 X + 7 X3 + 0 = 0 = 900 Objective Function-Surplus & Artificial Variables Min : 5 X S + MA + MA by Prentice Hall, Inc., Upper Saddle River,
33 Simplex Steps for Minimization. Choose the variable with the greatest negative C j - Z j to enter the solution.. Determine the row to be replaced by selecting that one with the smallest (non-negative) quantity-topivot-column ratio. 3. Calculate the new values for the pivot row. 4. Calculate the new values for the other row(s). 5. Calculate the C j and C j - Z j values for this tableau. If there are any C j - Z j values less than zero, return to Step by Prentice Hall, Inc., Upper Saddle River,
34 Special Cases Infeasibility C j M M Solution X X S S A A Qty Mix 5 X X M A Z j M --M M 800+0M C j -Z j 0 0 M-3 M by Prentice Hall, Inc., Upper Saddle River,
35 Special Cases Unboundedness C j Solution Mix X X S S Qty 9 X S Z j C j -Z j Pivot Column by Prentice Hall, Inc., Upper Saddle River,
36 Special Cases Degeneracy C j Solution Mix X X X 3 S S S 3 Qty 8 X / S 4 0 / S 3 0 /5 0 0 Z j C j -Z j Pivot Column by Prentice Hall, Inc., Upper Saddle River,
37 Special Cases Multiple Optima C j Solution Mix X X S S Qty X 3/ S 0 / 3 Z j 3 0 C j -Z j by Prentice Hall, Inc., Upper Saddle River,
38 Sensitivity Analysis High Note Sound Company Max : 50 X X 3 X Subject to : + 0 X + 4 X + X by Prentice Hall, Inc., Upper Saddle River,
39 Sensitivity Analysis High Note Sound Company by Prentice Hall, Inc., Upper Saddle River,
40 Simplex Solution High Note Sound Company C j Solution Mix X X S S Qty 0 X / ¼ S 5/ 0 -/4 40 Z j C j -Z j by Prentice Hall, Inc., Upper Saddle River,
41 Simplex Solution High Note Sound Company C j Solution Mix X X S S Qty 0 X / ¼ S 5/ 0 -/4 40 Z j C j -Z j by Prentice Hall, Inc., Upper Saddle River,
42 Nonbasic Objective Function Coefficients C j Solution Mix X X S S Qty 0 X / ¼ S 5/ 0 -/4 40 Z j C j -Z j by Prentice Hall, Inc., Upper Saddle River,
43 Basic Objective Function Coefficients C j Solution Mix X X S S Qty 0+ X / ¼ S 5/ 0 -/4 40 Z j 60+/ / C j -Z j -0-/ 0-30-/ by Prentice Hall, Inc., Upper Saddle River,
44 Simplex Solution High Note Sound Company C j Solution Mix X X S S Qty 0 X / ¼ S 5/ 0 -/4 40 Z j C j -Z j Objective increases by 30 if additional hour of electricians time is available by Prentice Hall, Inc., Upper Saddle River,
45 Steps to Form the Dual To form the Dual: If the primal is max., the dual is min., and vice versa. The right-hand-side values of the primal constraints become the objective coefficients of the dual. The primal objective function coefficients become the right-hand-side of the dual constraints. The transpose of the primal constraint coefficients become the dual constraint coefficients. Constraint inequality signs are reversed by Prentice Hall, Inc., Upper Saddle River,
46 Primal & Dual Max : Primal: 50 X Subject to : X 3 X + 0 X + 4 X + X Dual Min : 80 U Subject to : U 4 U + 60 U U U by Prentice Hall, Inc., Upper Saddle River,
47 Dual s Optimal Solution Primal s Optimal Solution Comparison of the Primal and Dual Optimal Tableaus C j $7 $5 Solution Mix X S Z j C j - Z j Quantity 0 40 $,400 $50 $0 $0 $0 X X S S / /4 0 5/ 0 -/ C j $7 $5 Solution Mix U S Z j C j - Z j Quantity 30 0 $, $0 $0 X X S S /4 0 -/4 0-5/ -/ $ M M A A 0 / - / 0 40 M M by Prentice Hall, Inc., Upper Saddle River,
PERT 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 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 information56:171 Operations Research Midterm Exam Solutions October 22, 1993
56:171 O.R. Midterm Exam Solutions page 1 56:171 Operations Research Midterm Exam Solutions October 22, 1993 (A.) /: Indicate by "+" ="true" or "o" ="false" : 1. A "dummy" activity in CPM has duration
More information56:171 Operations Research Midterm Examination Solutions PART ONE
56:171 Operations Research Midterm Examination Solutions Fall 1997 Answer both questions of Part One, and 4 (out of 5) problems from Part Two. Possible Part One: 1. True/False 15 2. Sensitivity analysis
More information56:171 Operations Research Midterm Examination Solutions PART ONE
56:171 Operations Research Midterm Examination Solutions Fall 1997 Write your name on the first page, and initial the other pages. Answer both questions of Part One, and 4 (out of 5) problems from Part
More informationSCHOOL OF BUSINESS, ECONOMICS AND MANAGEMENT. BF360 Operations Research
SCHOOL OF BUSINESS, ECONOMICS AND MANAGEMENT BF360 Operations Research Unit 3 Moses Mwale e-mail: moses.mwale@ictar.ac.zm BF360 Operations Research Contents Unit 3: Sensitivity and Duality 3 3.1 Sensitivity
More information56:171 Operations Research Midterm Examination October 25, 1991 PART ONE
56:171 O.R. Midterm Exam - 1 - Name or Initials 56:171 Operations Research Midterm Examination October 25, 1991 Write your name on the first page, and initial the other pages. Answer both questions of
More information56:171 Operations Research Midterm Examination October 28, 1997 PART ONE
56:171 Operations Research Midterm Examination October 28, 1997 Write your name on the first page, and initial the other pages. Answer both questions of Part One, and 4 (out of 5) problems from Part Two.
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 information56:171 Operations Research Midterm Exam Solutions October 19, 1994
56:171 Operations Research Midterm Exam Solutions October 19, 1994 Possible Score A. True/False & Multiple Choice 30 B. Sensitivity analysis (LINDO) 20 C.1. Transportation 15 C.2. Decision Tree 15 C.3.
More information56:171 Operations Research Midterm Exam Solutions Fall 1994
56:171 Operations Research Midterm Exam Solutions Fall 1994 Possible Score A. True/False & Multiple Choice 30 B. Sensitivity analysis (LINDO) 20 C.1. Transportation 15 C.2. Decision Tree 15 C.3. Simplex
More informationINTERNATIONAL UNIVERSITY OF JAPAN Public Management and Policy Analysis Program Graduate School of International Relations
Hun Myoung Park (4/18/2018) LP Interpretation: 1 INTERNATIONAL UNIVERSITY OF JAPAN Public Management and Policy Analysis Program Graduate School of International Relations DCC5350 (2 Credits) Public Policy
More informationCivil Engineering Systems Analysis Lecture VI. Instructor: Prof. Naveen Eluru Department of Civil Engineering and Applied Mechanics
Civil Engineering Systems Analysis Lecture VI Instructor: Prof. Naveen Eluru Department of Civil Engineering and Applied Mechanics Today s Learning Objectives Simplex Method 2 Simplex : Example 2 Max Z
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 informationDuality & The Dual Simplex Method & Sensitivity Analysis for Linear Programming. Metodos Cuantitativos M. En C. Eduardo Bustos Farias 1
Dualit & The Dual Simple Method & Sensitivit Analsis for Linear Programming Metodos Cuantitativos M. En C. Eduardo Bustos Farias Dualit EverLP problem has a twin problem associated with it. One problem
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 informationAM 121: Intro to Optimization Models and Methods Fall 2017
AM 121: Intro to Optimization Models and Methods Fall 2017 Lecture 8: Sensitivity Analysis Yiling Chen SEAS Lesson Plan: Sensitivity Explore effect of changes in obj coefficients, and constraints on the
More informationDUALITY AND SENSITIVITY ANALYSIS
DUALITY AND SENSITIVITY ANALYSIS Understanding Duality No learning of Linear Programming is complete unless we learn the concept of Duality in linear programming. It is impossible to separate the linear
More informationLinear Programming: Exercises
Linear Programming: Exercises 1. The Holiday Meal Turkey Ranch is considering buying two different brands of turkey feed and blending them to provide a good, low-cost diet for its turkeys. Each brand of
More informationOptimization Methods. Lecture 7: Sensitivity Analysis
5.093 Optimization Methods Lecture 7: Sensitivity Analysis Motivation. Questions z = min s.t. c x Ax = b Slide How does z depend globally on c? on b? How does z change locally if either b, c, A change?
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 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 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 informationSPRING 2014 MATH 1324 REVIEW EXAM 3_
SPRING 214 MATH 1324 REVIEW EXAM 3_ MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Convert the constraints into linear equations by using slack variables.
More informationDennis L. Bricker Dept. of Industrial Engineering The University of Iowa
Dennis L. Bricker Dept. of Industrial Engineering The University of Iowa 56:171 Operations Research Homework #1 - Due Wednesday, August 30, 2000 In each case below, you must formulate a linear programming
More informationOptimization 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 informationLINEAR PROGRAMMING. Homework 7
LINEAR PROGRAMMING Homework 7 Fall 2014 Csci 628 Megan Rose Bryant 1. Your friend is taking a Linear Programming course at another university and for homework she is asked to solve the following LP: Primal:
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 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 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 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 informationSensitivity Analysis LINDO INPUT & RESULTS. Maximize 7X1 + 10X2. Subject to X1 < 500 X2 < 500 X1 + 2X2 < 960 5X1 + 6X2 < 3600 END
Sensitivity Analysis Sensitivity Analysis is used to see how the optimal solution is affected by the objective function coefficients and to see how the optimal value is affected by the right- hand side
More informationSetting Up Linear Programming Problems
Setting Up Linear Programming Problems A company produces handmade skillets in two sizes, big and giant. To produce one big skillet requires 3 lbs of iron and 6 minutes of labor. To produce one giant skillet
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 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 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 information{List Sales (1 Trade Discount) Total Cost} (1 Tax Rate) = 0.06K
FINAL CA MAY 2018 ADVANCED MANAGEMENT ACCOUNTING Test Code F84 Branch: Date : 04.03.2018 (50 Marks) Note: All questions are compulsory. Question 1(4 Marks) (c) Selling Price to Yield 20% Return on Investment
More informationSetting Up Linear Programming Problems
Setting Up Linear Programming Problems A company produces handmade skillets in two sizes, big and giant. To produce one big skillet requires 3 lbs of iron and 6 minutes of labor. To produce one giant skillet
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 informationDo all of Part One (1 pt. each), one from Part Two (15 pts.), and four from Part Three (15 pts. each) <><><><><> PART ONE <><><><><>
56:171 Operations Research Final Exam - December 13, 1989 Instructor: D.L. Bricker Do all of Part One (1 pt. each), one from Part Two (15 pts.), and four from
More information4. Introduction to Prescriptive Analytics. BIA 674 Supply Chain Analytics
4. Introduction to Prescriptive Analytics BIA 674 Supply Chain Analytics Why is Decision Making difficult? The biggest sources of difficulty for decision making: Uncertainty Complexity of Environment or
More informationOperations Research I: Deterministic Models
AMS 341 (Spring, 2009) Estie Arkin Operations Research I: Deterministic Models Exam 1: Thursday, March 12, 2009 READ THESE INSTRUCTIONS CAREFULLY. Do not start the exam until told to do so. Make certain
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 informationOperations Research I: Deterministic Models
AMS 341 (Spring, 2010) Estie Arkin Operations Research I: Deterministic Models Exam 1: Thursday, March 11, 2010 READ THESE INSTRUCTIONS CAREFULLY. Do not start the exam until told to do so. Make certain
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 informationRoll No. :... Invigilator s Signature :.. CS/B.TECH(IT)/SEM-5/M(CS)-511/ OPERATIONS RESEARCH AND OPTIMIZATION TECHNIQUES
Name : Roll No. :.... Invigilator s Signature :.. CS/B.TECH(IT)/SEM-5/M(CS)-511/2011-12 2011 OPERATIONS RESEARCH AND OPTIMIZATION TECHNIQUES Time Allotted : 3 Hours Full Marks : 70 The figures in the margin
More information1.2: USING ALGEBRA(meaning no calculators), find the Intersection of the two Lines.
Math 125 Final Exam Practice HAPTE 1: 1.1: List the Intercepts of each Equation and then sketch the graph 18x+ 10y = 90 b) 16x+ 24y = 432 c) 25x+ 10y = 500 1.2: USING ALGEBA(meaning no calculators), find
More informationChapter Two: Linear Programming: Model Formulation and Graphical Solution
hapter Two: Linear Programming: Model Formulation and Graphical Solution PROLEM SUMMRY. Maimization ( continuation), graphical solution. Maimization, graphical solution 3. Minimization, graphical solution.
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 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 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 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 informationSTARRY GOLD ACADEMY , , Page 1
ICAN KNOWLEDGE LEVEL QUANTITATIVE TECHNIQUE IN BUSINESS MOCK EXAMINATION QUESTIONS FOR NOVEMBER 2016 DIET. INSTRUCTION: ATTEMPT ALL QUESTIONS IN THIS SECTION OBJECTIVE QUESTIONS Given the following sample
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 informationTRANSPORTATION. Exercise. Lecture 13 PENELITIAN OPERASIONAL I. Lecture 13. Remember. 29/11/2013 (TIN 4109) Balancing a Transportation Problem
29/11/213 Lecture 13 PENELITIAN OPERASIONAL I (TIN 419) TRANSPORTATION Lecture 13 Outline: Transportation: optimal solution References: Bazara, Mokhtar S. and Jarvis, John J., Linear Programming And Network
More informationLP Sensitivity Analysis
LP Sensitivity Analysis Max: 50X + 40Y Profit 2X + Y >= 2 (3) Customer v demand X + 2Y >= 2 (4) Customer w demand X, Y >= 0 (5) Non negativity What is the new feasible region? a, e, B, h, d, A and a form
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 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 informationHomework. Part 1. Computer Implementation: Solve Wilson problem by the Lindo and compare the results with your graphical solution.
Homework. Part 1. Computer Implementation: Solve Wilson problem by the Lindo and compare the results with your graphical solution. Graphical Solution is attached to email. Lindo The results of the Wilson
More informationTHE UNIVERSITY OF BRITISH COLUMBIA
Be sure this eam has pages. THE UNIVERSITY OF BRITISH COLUMBIA Sessional Eamination - June 12 2003 MATH 340: Linear Programming Instructor: Dr. R. Anstee, section 921 Special Instructions: No calculators.
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 informationFINANCIAL OPTIMIZATION
FINANCIAL OPTIMIZATION Lecture 2: Linear Programming Philip H. Dybvig Washington University Saint Louis, Missouri Copyright c Philip H. Dybvig 2008 Choose x to minimize c x subject to ( i E)a i x = b i,
More informationChapter Two: Linear Programming: Model Formulation and Graphical Solution
TYLM0_0393.QX //09 :3 M Page hapter Two: Linear Programming: Model Formulation and Graphical Solution PROLEM SUMMRY. Maimization ( continuation), graphical solution. Maimization, graphical solution 3.
More informationFINAL CA May 2018 ADVANCED MANAGEMENT ACCOUNTING
compulsory. Question 1 FINAL CA May 2018 ADVANCED MANAGEMENT ACCOUNTING Test Code F33 Branch: MULTIPLE Date: 14.01.2018 Note: (a) (i) Statement Showing Profitability of Product A & B (50 Marks) All questions
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 informationStochastic Programming and Financial Analysis IE447. Midterm Review. Dr. Ted Ralphs
Stochastic Programming and Financial Analysis IE447 Midterm Review Dr. Ted Ralphs IE447 Midterm Review 1 Forming a Mathematical Programming Model The general form of a mathematical programming model is:
More informationFebruary 24, 2005
15.053 February 24, 2005 Sensitivity Analysis and shadow prices Suggestion: Please try to complete at least 2/3 of the homework set by next Thursday 1 Goals of today s lecture on Sensitivity Analysis Changes
More informationSolution to P2 Sensitivity at the Major Electric Company
Solution to P2 Sensitivity at the Major Electric Company 1.(a) Are there alternate optimal solutions? Yes or no. (b) If yes, which nonbasic variables could enter the basis without changing the value of
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 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 informationInterior-Point Algorithm for CLP II. yyye
Conic Linear Optimization and Appl. Lecture Note #10 1 Interior-Point Algorithm for CLP II Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/
More informationb) [3 marks] Give one more optimal solution (different from the one computed in a). 2. [10 marks] Consider the following linear program:
Be sure this eam has 5 pages. THE UNIVERSITY OF BRITISH COLUMBIA Sessional Eamination - April 21 200 MATH 340: Linear Programming Instructors: Dr. R. Anstee, Section 201 Dr. Guangyue Han, Section 202 Special
More information32 Chapter 3 Analyzing Solutions. The solution is:
3 Analyzing Solutions 3.1 Economic Analysis of Solution Reports A substantial amount of interesting economic information can be gleaned from the solution report of a model. In addition, optional reports,
More informationCOMM 290 MIDTERM REVIEW SESSION ANSWER KEY BY TONY CHEN
COMM 290 MIDTERM REVIEW SESSION ANSWER KEY BY TONY CHEN TABLE OF CONTENTS I. Vocabulary Overview II. Solving Algebraically and Graphically III. Understanding Graphs IV. Fruit Juice Excel V. More on Sensitivity
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 informationSolve the matrix equation for X. 1) A = 6 0, B = , AX = B A) D) -2 2 B) -12 0
MATH 1324 FINAL EXAM. ANSWER ALL QUESTIONS. TIME 1.5HRS. MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Solve the matrix equation for X. 1) A = 3-2
More informationLinear Programming: Simplex Method
Mathematical Modeling (STAT 420/620) Spring 2015 Lecture 10 February 19, 2015 Linear Programming: Simplex Method Lecture Plan 1. Linear Programming and Simplex Method a. Family Farm Problem b. Simplex
More informationFinal Study Guide MATH 111
Final Study Guide MATH 111 The final will be cumulative. There will probably be a very slight emphasis on the material from the second half of the class. In terms of the material in the first half, please
More informationWAYNE STATE UNIVERSITY Department of Industrial and Manufacturing Engineering
WAYNE STATE UNIVERSITY Department of Industrial and Manufacturing Engineering PhD Preliminary Examination- February 2006 Candidate Name: Answer ALL Questions Question 1-20 Marks Question 2-15 Marks Question
More informationEcon 172A - Slides from Lecture 7
Econ 172A Sobel Econ 172A - Slides from Lecture 7 Joel Sobel October 18, 2012 Announcements Be prepared for midterm room/seating assignments. Quiz 2 on October 25, 2012. (Duality, up to, but not including
More informationTUFTS UNIVERSITY DEPARTMENT OF CIVIL AND ENVIRONMENTAL ENGINEERING ES 152 ENGINEERING SYSTEMS Spring Lesson 16 Introduction to Game Theory
TUFTS UNIVERSITY DEPARTMENT OF CIVIL AND ENVIRONMENTAL ENGINEERING ES 52 ENGINEERING SYSTEMS Spring 20 Introduction: Lesson 6 Introduction to Game Theory We will look at the basic ideas of game theory.
More informationIncome and Efficiency in Incomplete Markets
Income and Efficiency in Incomplete Markets by Anil Arya John Fellingham Jonathan Glover Doug Schroeder Richard Young April 1996 Ohio State University Carnegie Mellon University Income and Efficiency in
More informationCHAPTER 13: A PROFIT MAXIMIZING HARVEST SCHEDULING MODEL
CHAPTER 1: A PROFIT MAXIMIZING HARVEST SCHEDULING MODEL The previous chapter introduced harvest scheduling with a model that minimized the cost of meeting certain harvest targets. These harvest targets
More informationUNIVERSITY OF KWAZULU-NATAL
UNIVERSITY OF KWAZULU-NATAL EXAMINATIONS: June 006 Subject, course and code: Mathematics 34 (MATH34P Duration: 3 hours Total Marks: 00 INTERNAL EXAMINERS: Mrs. A. Campbell, Mr. P. Horton, Dr. M. Banda
More informationLecture 3. Understanding the optimizer sensitivity report 4 Shadow (or dual) prices 4 Right hand side ranges 4 Objective coefficient ranges
Decision Models Lecture 3 1 Lecture 3 Understanding the optimizer sensitivity report 4 Shadow (or dual) prices 4 Right hand side ranges 4 Objective coefficient ranges Bidding Problems Summary and Preparation
More informationChapter 9 Integer Programming Part 1. Prof. Dr. Arslan M. ÖRNEK
Chapter 9 Integer Programming Part 1 Prof. Dr. Arslan M. ÖRNEK Integer Programming An integer programming problem (IP) is an LP in which some or all of the variables are required to be non-negative integers.
More informationOptimization in Finance
Research Reports on Mathematical and Computing Sciences Series B : Operations Research Department of Mathematical and Computing Sciences Tokyo Institute of Technology 2-12-1 Oh-Okayama, Meguro-ku, Tokyo
More informationa. Formulate using LP.
L P formulation Questions Q1 The Flair Furniture Company produces inexpensive tables and chairs. The production process for each is similar in that both require a certain number of labour hours in the
More informationActivity Predecessors Durations (days) a - 3 b a 4 c a 5 d a 4 e b 2 f d 9 g c, e 6 h f, g 2
CHAPTER 11 INDUSTRIAL ENGINEERING YEAR 2012 ONE MARK MCQ 11.1 Which one of the following is NOT a decision taken during the aggregate production planning stage? (A) Scheduling of machines (B) Amount of
More informationIssues. Senate (Total = 100) Senate Group 1 Y Y N N Y 32 Senate Group 2 Y Y D N D 16 Senate Group 3 N N Y Y Y 30 Senate Group 4 D Y N D Y 22
1. Every year, the United States Congress must approve a budget for the country. In order to be approved, the budget must get a majority of the votes in the Senate, a majority of votes in the House, and
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 informationIntroduction To Revenue
Introduction To Sales R = PQ where R = Sales P = per Unit Q = (Demanded) Demand Function The that will be sold is also determined by the price per unit Q = ƒ(p) R = Pƒ(P) 2 3 Higher Sells Fewer Units 1???
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 informationDAKOTA FURNITURE COMPANY
DAKOTA FURNITURE COMPANY AYMAN H. RAGAB 1. Introduction The Dakota Furniture Company (DFC) manufactures three products, namely desks, tables and chairs. To produce each of the items, three types of resources
More informationFrom the Assignment Model to Combinatorial Auctions
From the Assignment Model to Combinatorial Auctions IPAM Workshop, UCLA May 7, 2008 Sushil Bikhchandani & Joseph Ostroy Overview LP formulations of the (package) assignment model Sealed-bid and ascending-price
More informationOptimization Modeling in Spreadsheets. with. What sbest!
Optimization Modeling in Spreadsheets with What sbest! 2013 LINDO Systems January 2013 Preliminary version, comments welcome. Published by 1415 North Dayton Street Chicago, Illinois 60622 Technical Support:
More informationNODIA AND COMPANY. GATE SOLVED PAPER Mechanical Engineering Industrial Engineering. Copyright By NODIA & COMPANY
No part of this publication may be reproduced or distributed in any form or any means, electronic, mechanical, photocopying, or otherwise without the prior permission of the author. GATE SOLVED PAPER Mechanical
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 informationOperation Research II
Operation Research II Johan Oscar Ong, ST, MT 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
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 information