Business Department SPRING 2016-17 FINAL EXAM/REVISION.

Slides:



Advertisements
Similar presentations
Optimization problems using excel solver
Advertisements

1 Material to Cover  relationship between different types of models  incorrect to round real to integer variables  logical relationship: site selection.
BU Decision Models Integer_LP1 Integer Optimization Summer 2013.
Lesson 08 Linear Programming
10-1 Copyright © 2013 Pearson Education, Inc. Publishing as Prentice Hall Nonlinear Programming Chapter 10.
Linear Programming Problem
Logistics Network Configuration
Linear Programming Models & Case Studies
Transportation Problem (TP) and Assignment Problem (AP)
1 Department of Business Administration SPRING Management Science by Asst. Prof. Sami Fethi © 2007 Pearson Education.
Computational Methods for Management and Economics Carla Gomes Module 8b The transportation simplex method.
Linear Programming Using the Excel Solver
Managerial Decision Modeling with Spreadsheets
Introduction to Management Science
McGraw-Hill/Irwin © The McGraw-Hill Companies, Inc., Integer Programming.
The Transportation and Assignment Problems
Introduction to Management Science
Supply Chain Design Problem Tuukka Puranen Postgraduate Seminar in Information Technology Wednesday, March 26, 2009.
QM B Linear Programming
Linear Programming (6S) and Transportation Problem (8S)
1 Lecture 2 & 3 Linear Programming and Transportation Problem.
Linear Programming Econ Outline  Review the basic concepts of Linear Programming  Illustrate some problems which can be solved by linear programming.
Chapter 7 Transportation, Assignment & Transshipment Problems Part 1 ISE204/IE252 Prof. Dr. Arslan M. ÖRNEK.
Linear Programming Applications
1 1 Slide LINEAR PROGRAMMING: THE GRAPHICAL METHOD n Linear Programming Problem n Properties of LPs n LP Solutions n Graphical Solution n Introduction.
Linear Programming Models: Graphical and Computer Methods
1© 2003 by Prentice Hall, Inc. Upper Saddle River, NJ The Wyndor Glass Company Problem (Hillier and Liberman) The Wyndor Glass Company is planning.
Introduction to Management Science
Transportation Model Lecture 16 Dr. Arshad Zaheer
1 IES 371 Engineering Management Chapter 10: Location Week 11 August 17, 2005 Objectives  Identify the factors affecting location choices  Explain how.
Linear Programming Chapter 13 Supplement.
Lecture 2 Chapter 10 continued…. Last Lecture Summary: Covered Sec and most part of Sec Basic concepts of Linear Programming Problem and.
Introduction to Management Science
Nonlinear Programming (NLP) Operation Research December 29, 2014 RS and GISc, IST, Karachi.
Nonlinear Programming
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 11-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 11.
Location decisions are strategic decisions. The reasons for location decisions Growth –Expand existing facilities –Add new facilities Production Cost.
5-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Integer Programming Chapter 5.
Business Mathematics MTH-367 Lecture 13. Chapter 10 Linear Programming An Introduction Continued…
IT Applications for Decision Making. Operations Research Initiated in England during the world war II Make scientifically based decisions regarding the.
CDAE Class 12 Oct. 4 Last class: 2. Review of economic and business concepts Today: 3. Linear programming and applications Quiz 3 (sections 2.5 and.
Rough-Cut Capacity Planning in SCM EIN 5346 Logistics Engineering Fall, 2015.
© 2009 Prentice-Hall, Inc. 7 – 1 Decision Science Chapter 3 Linear Programming: Maximization and Minimization.
Department of Business Administration SPRING Management Science by Asst. Prof. Sami Fethi © 2007 Pearson Education.
Department of Business Administration FALL -SPRING Management Science Operations Research by Ass. Prof. Sami Fethi Assoc. Prof. Sami Fethi © 2007 Pearson.
Rough-Cut Capacity Planning in SCM Theories & Concepts
Appendix A with Woodruff Edits Linear Programming Using the Excel Solver Copyright © 2010 by The McGraw-Hill Companies, Inc. All rights reserved.McGraw-Hill/Irwin.
The Transportation and Assignment Problems
Chapter 2 Linear Programming Models: Graphical and Computer Methods
MID-TERM EXAM/REVISION
Engineering Economics (2+0)
MID-TERM EXAM/REVISION
2.7 Linear Programming Objectives: Use linear programming procedures to solve applications. Recognize situations where exactly one solution to a linear.
Rough-Cut Capacity Planning in SCM Theories & Concepts
Chapter 5 Linear Inequalities and Linear Programming
Rough-Cut Capacity Planning in SCM EGN 5623 Enterprise Systems Optimization (Professional MSEM) Fall, 2011.
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Math 1 Warm Up In the Practice Workbook… Practice 7-6 (p. 94)
MBA 651 Quantitative Methods for Decision Making
Lial/Hungerford/Holcomb/Mullins: Mathematics with Applications 11e Finite Mathematics with Applications 11e Copyright ©2015 Pearson Education, Inc. All.
Integer Linear Programming
The Simplex Method The geometric method of solving linear programming problems presented before. The graphical method is useful only for problems involving.
Demand Allocation Example
Copyright © 2019 Pearson Education, Inc.
Module B Linear Programming.
Nature does nothing uselessly.
REVIEW FOR EXAM 1 Chapters 3, 4, 5 & 6.
Integer Programming Chapter 5.
Integer Programming (IP)
Presentation transcript:

Business Department SPRING 2016-17 FINAL EXAM/REVISION

Section A/Multiple Choice-Example Compulsory section 1) In the process of evaluating location alternatives, the transportation model method minimizes A) number of destinations B) total shipping cost C) total supply D) total demand 2) Which of the following statements is not true in transportation modeling framework? A) Special form of linear programming model similar to the transportation model. B) Supply at each source and demand at each destination limited to one unit. C) In a balanced model supply may equal demand D) In an unbalanced model supply does not equal demand  

Section A/Multiple Choice-Example (35 points) 3) The difference between the assignment and the transportation problem is that A) the number of origins must equal the number of destinations in the transportation problem B) total supply must equal total demand in the assignment problem C) each supply and demand value is 1 in the assignment problem D) A and B 4) The slope of a curve at any point is __________ the derivative of the curves function. A) equal to B) larger than C) smaller than D) none of the above 5) Branch and Bound method does not contain __________. A) Smaller subsets B) A tedious process C) A mathematical process D) Excel solution only  

Section A/Multiple Choice-Example (30 points) 6) Which of the following explains the concept of Dummy? A) Demand equals supply B) Demand less than supply C) balanced condition D) makes profit to increase 7) Which of the following statements is not true in nonlinear problem characteristics? A) Solution is often not on the boundary of the feasible solution space. B) Cannot simply look at points on the solution space boundary C) Solution techniques can be very complex. D) Nonlinear Characteristics do not reflect the practices in real world. 8) ’if the case is a production of jet aircraft, round off could affect profit or cost by million dollar considering 7.4 jet airliners as 7 or 8.’ Which of the following method explains the statement above? 0-1 Integer Model Total Integer Model Mixed Integer Model Gromory cutting plane Method

Section A/Multiple Choice-Example (20 points) Which of the following methods is convenient for Assignment problems? VAM model NorthWest method Least cost method Hungarian method 10) Which of the following statements is not true for facility location? A) It serves several customers B) It reduces transportation costs C) It maximizes customers’ utility D) It keeps the distance almost equally and likely  

Section B/type 1-Example- IP (40 points) Asnwer one question out of the following two questions Considering the following system equations and final simplex tableau:   Maximize Z = $ 3x1 + $ 5x2 Subject to: 1 x1 + 4 x2  9 2 x1 + 3 x2  4 Non-negativity x1, x2  0 and integer

Section B/type 1-Example- IP Asnwer one question out of the following two questions   3 5 C Pmix Quan X1 X2 S1 S2 7/5 1 2/5 -1/5 17/5 -3/5 4/5 Z 86/5 1/5 C-Z -7/5 Find the integer programming solution to this problem. Ans: You can find out its answer in Answer set 5...

Section Section B/type 2-VOGEL/NCW(40 points) NWC To (Cost) From 1 2 3 supply A $ 6 7 4 100 B $ 5 3 6 175 C $ 8 5 7 200 Demand 90 195 190 Use Vogel method and calculate the optimal solution. Use NCW method and calculate the optimal solution. Discuss the answers calculated in section a and b.

Section B/Type 2-Example-NCW NWC To (Cost) From 1 2 3 supply A $ 6*90 7*10 4 100 B $ 5 3*175 6 175 C $ 8 5 *10 7 *190 200 Demand 90 195 190 A → 1 =90*6 =540 B → 1 =7*10 =70 B → 2 =3*175 =525 C → 2=5*10 =50 C → 3 =7*190=1330 NWC Total= 2,515 VOGEL total cost is 2465

Section C/Type1- LF-(40 points) The Burger Doodle restaurant chain purchases ingredients from four different food suppliers. The company wants to construct a new central distribution center to process and package the ingredients it uses in its menu items before shipping them to their various restaurants. The suppliers transport the food items in 40-foot tractor-trailer trucks. The coordinates of the four suppliers and the annual number of truckloads that will be transported to the distribution center are as follows:     Coordinates Supplier x y Annual Truckloads A 200 65 B 100 500 120 C 250 600 90 D 300 75

Section C/Type1- FL a) Graphically illustrate the coordinates on a map and identify the closest town to these coordinates. b) Determine individual distance for the new warehouse. c) Determine the total distance for the new warehouse. d) Explain briefly the concept of the facility location problem. Ans: You can find out its answer in Answer set 7...

Section C/type 2- NL The Hickory Cahinet and Furniture Company makes chairs. The fixed cost per month of making chairs is $7,500, and the variable cost per chair is $40. Price is related to demand, according to the following linear equation: V=400— l.2p a) Develop the nonlinear profit function for this company b) Determine the price that will maximize profit, the optimal volume, and the maximum profit per month c) Critically discuss the results calculated previously. Ans: You can find out its answer in Answer set 7...

Section D/Bonus- Hungarian method Asnwer the following question   Region Days A B C D E 1 17 10 15 16 20 Sales person 2 12 9 14 3 11 4 18 5 13 Use the information in the table above and find the best possible solution. Determine the dispatch program between the projects and plants. Calculate individual time and total minimum time. Discuss the two methods and their results you applied above. Ans: You can find out its answer in Answer set 6.

Good luck