OPERATIONS RESEARCH. Transportation and Assignment Problems
|
|
- Merry Mathews
- 6 years ago
- Views:
Transcription
1 OPERATIONS RESEARCH Chapter 2 Transportation and Assignment Problems Prof. Bibhas C. Giri Department of Mathematics Jadavpur University Kolkata, India bcgiri.jumath@gmail.com
2 MODULE - 2: Optimality Test by Stepping Stone Method and MODI Method, and Some Special Cases of Transportation Problem 2.1 Optimality Test Once an initial BFS is obtained, the next step is to check its optimality. An optimal solution is one where there is no other set of transportation route (allocations) that will further reduce the total transportation cost. To test the optimality, the following methods can be used: (i) Stepping stone method (ii) Modified distribution (MODI) method Stepping Stone Method This is a procedure for determining the potential of improving upon each of the nonbasic variables in terms of the objective function. To determine this potential, each of the non-basic variables is considered one by one. For each such cell, we find what effect on the total cost would be if one unit is assigned to this cell. We then come to know whether the current solution is optimal or not. If not, we improve that solution further. We summarize the Stepping stone method in the following steps: 1. For all unoccupied cells, evaluate the effect of transferring one unit from an occupied cell to the unoccupied cell. This transfer is made by forming a closed path that retains the rim conditions of the problem. 2
3 2. Check the signs of net changes in the unit transportation costs. If the net changes are non-negative, then an optimal solution is obtained; otherwise, go to step Select the unoccupied cell with most negative net change. 4. Assign as many units as possible to the unoccupied cell satisfying rim conditions. The maximum number of units to be assigned is equal to the smaller oval boxed number among the occupied cells with the negative value in a closed path. 5. Go to step 1, and repeat the process until all unoccupied cells are evaluated and the net changes result in non-negative values. Example 2.1: Consider the transportation problem presented in Table 2.1. Determine the optimal solution of the problem using Stepping stone method. Origin D 1 D 2 D 3 Supply O Demand Table 2.1: Transportation table for Example 2.1 Solution: We compute an initial BFS of the problem by Matrix minimum method as shown in Table 2.2. The transportation cost associated with this solution is Rs.( ) = Rs.203. The Stepping stone method starts with evaluation of each of the unoccupied cells viz., (O 1,D 1 ), (O 1,D 3 ), (,D 3 ), (,D 2 ) to examine whether it would improve the initial solution by introducing any of these cells into the current solution basis. To demonstrate this method, let us evaluate the unoccupied cell (O 1,D 1 ) in Table 2.2 and assign 1 unit to this cell. For this allocation, Rs. 2 to is added to the cost. In order to make this adjustment and to satisfy the supply restriction at origin O 1 and demand restriction of D 1, we subtract 1 unit from (O 1,D 2 ), add 1 unit to (,D 2 ) and again subtract 1 unit from (,D 1 ). These adjustments are shown in Table 2.3. Following the closed path, the increase in the transportation cost per unit quantity of reallocation is observed as = 3. This indicates that shift of 1 unit into unoccupied cell (O 1,D 1 ) decreases the transportation cost by Rs. 3. Obviously, cell (O 1,D 1 ) is to be included in the assignment. Now assign as much as possible in this
4 O b j Table 2.2: Initial BFS by Matrix minima method O 1 10 (+1) ( 1) ( 1) (+1) b j Table O b j Table 2.4 O 1 10 ( 1) (+1) ( 1) (+1) (+1) ( 1) b j Table 2.5 cell. The maximum amount that can be allocated to (O 1,D 1 ) is 10 and this will make the current basic variable corresponding to cell (O 1,D 2 ) non basic. Table 2.4 shows the optimal results after reallocation. Similarly, we can draw a closed path for the other unoccupied cells (O 1,D 3 ), (,D 3 ), (,D 2 ) which are shown in Tables 2.5, 2.6 and 2.7, respectively. The corresponding changes in cost for allocations in unoccupied cells are shown in Table 2.8. Since costs increase or remain unaltered for other unoccupied cells, after reallocation of a unit allocation, no optimal solution can not be obtained for these reallocations. Thus the improved solution is obtained as x 11 = 10, x 21 = 3, x 22 = 22, x 31 = 2 and x 33 = 18, see Table 2.4, and the corresponding minimum transportation cost is Rs 173.
5 O ( 1) (+1) (+1) ( 1) b j Table 2.6 O (+1) ( 1) ( 1) (+1) b j Table 2.7 Unoccupied cell Change in cost Remarks (O 1,D 3 ) = 3 Cost increases (,D 3 ) = 0 Neither increase nor decrease (,D 2 ) = 3 Cost increases Table Modified Distribution (MODI) Method The modified distribution method, also known as MODI method or (u, v) method provides a minimum cost solution to the transportation problem. In the stepping stone method, we have to draw as many closed paths as equal to the unoccupied cells for their evaluation. To the contrary, in MODI method, only closed path for the unoccupied cell with highest opportunity cost is drawn. The method is outlined in the following : 1. After getting an initial BFS, determine the values of u i and v j so that u i + v j = c ij for the occupied cells. 2. For the unoccupied cells, compute the opportunity cost d ij = c ij (u i + v j ). 3. If all d ij 0, the solution is optimal. On the other hand, if at least one d ij < 0, the solution is not optimal and further saving in transportation cost is possible. 4. Select the unoccupied cell with the smallest negative opportunity cost as this cell is to be included in the next solution.
6 5. Draw a loop for the unoccupied cell selected in the previous step. The right angle turn in this path is permitted only at occupied cells and at the original unoccupied cell. 6. Assign alternate + and - signs on the corner points of the closed path, starting from the unoccupied selected cell. 7. Determine the maximum number of units that should be shipped to this unoccupied cell. The smallest value with a negative position on the loop indicates the number of units that can be shipped to the entering cell. Now, add this quantity to all the cells on the corner points of the loop marked with + sign, and subtract it from those cells marked with - sign. In this way, an unoccupied cell becomes an occupied cell. 8. Repeat the whole procedure until an optimal solution is obtained. Example 2.2: Solve the following transportation problem: Origin D 1 D 2 D 3 D 4 Availability O Demand Table 2.9: Transportation table for Example 2.2 Solution: An initial BFS obtained by Matrix minima method is shown in Table O b j Table 2.10: Initial BFS by Matrix minima method
7 We now test the optimality by MODI method. For this, we calculate the values of u i s (i = 1,2,3) and v j s (j = 1,2,3,4) for each occupied cell such that u i +v j = c ij. We assign an arbitrary value u 1 = 0 and get u 1 + v 4 = c 14 v 4 = 12 u 3 + v 4 = c 34 u 3 = 8 u 3 + v 2 = c 32 v 2 = 2 u 3 + v 1 = c 31 v 1 = 32 u 2 + v 1 = c 21 u 2 = 38 u 2 + v 3 = c 23 v 3 = 2 Now, we calculate the opportunity cost d ij = c ij (u i + v j ) for the unoccupied cells. Unoccupied cell Opportunity cost d ij (O 1,D 1 ) c 11 (u 1 + v 1 ) = 13 (O 1,D 2 ) c 12 (u 1 + v 2 ) = 28 (O 1,D 3 ) c 13 (u 1 + v 3 ) = 48 (,D 2 ) c 22 (u 2 + v 2 ) = 10 (,D 4 ) c 24 (u 2 + v 4 ) = 10 (,D 3 ) c 33 (u 3 + v 3 ) = 50 u i O b j v j Table 2.11: Optimality test by MODI method The opportunity costs are plotted in the transportation table within shadow boxes as shown in Table Since all d ij 0, the current solution is not optimal. Now, we choose the most negative value (-13) from opportunity cost and draw a closed loop starting from (O 1,D 1 ) to this cell back through the cells (,D 1 ), (,D 4 ) and (O 1,D 4 ) as shown in Table 2.12.
8 O (+) ( ) ( ) (+) b j Table 2.12: Loop for improving the solution u i O b j v j Table 2.13: Revised solution and test for optimality The revised solution is shown in Table The optimality test by MODI method shows that all d ij 0. So, again we form a closed loop for the most negative opportunity cost (-23) as shown in Table 2.14 and trace out the smallest possible allocation amongst the occupied cell in the closed loop, which is 3. We then obtain the further improved solution as shown in Table The optimality test by MODI method shows that all the current opportunity costs are nonnegative (see the shadow boxes in Table 2.15). Hence the optimality allocation is x 11 = 5, x 14 = 2, x 22 = 3, x 23 = 7, x 32 = 5, x 34 = 13 and the corresponding minimum transportation cost is Rs.( ) = Rs.799.
9 O (+) ( ) ( ) (+) ( ) (+) b j Table 2.14: Loop for further improving the solution u i O b j v j Table 2.15: Improved solution and test for optimality by MODI method 2.2 Some Special Cases of Transportation Problem Degeneracy in Transportation Problem If the basic feasible solution of a TP with m origins and n destinations has fewer than (m + n 1) positive x ij (occupied cells) then the problem is said to be a degenerate TP. To resolve degeneracy, we assign a small arbitrary quantity (ϵ) to that unoccupied cell which has the minimum transportation cost. Consider the TP given in Table An initial BFS (see Table 2.17) obtained by Matrix minimum method shows that the number of basic variables = 5 < m + n 1 = 6. Hence, it is a degenerate TP. To resolve
10 Origin D 1 D 2 D 3 D 4 Supply O Demand Table 2.16: Transportation table O b j Table 2.17: Initial BFS by Matrix minima method degeneracy, we assign a very small quantity ϵ(> 0) to that unoccupied cell which has the minimum transportation cost. In Table 2.17, there is a tie in selecting the smallest unoccupied cell. So, we choose the cell (,D 2 ) arbitrarily, see Table O ϵ ϵ b j ϵ Table 2.18: Resolving degeneracy Now, we use the stepping stone method to find an optimal solution. We calculate the opportunity cost for all unoccupied cells as given below:
11 Unoccupied cell Increase in cost per unit Remarks of reallocation (O 1,D 3 ) = 1 Cost increases (O 1,D 4 ) = 4 Cost increases (,D 1 ) = 2 Cost decreases (,D 3 ) = 1 Cost decreases (,D 4 ) = 1 Cost decreases (,D 1 ) = 1 Cost increases The cell (,D 1 ) is having the maximum improvement potential, which is equal to 2. The maximum amount that can be allocated to (,D 1 ) is 700 and this will make the current basic variable corresponding to cell (,D 2 ) non-basic. The improved solution is shown in Table O ϵ ϵ b j ϵ Table 2.19: Improved solution As no further improvement is possible, the optimal solution is x 11 = 200, x 12 = 800, x 21 = 700, x 32 = ϵ, x 33 = 500, x 34 = 400 and the corresponding transportation cost is Rs.( ϵ ) = Rs.(5300+2ϵ). Since ϵ is a very small quantity, it can be neglected. Thus, the net transportation cost is Rs Unbalanced Transportation Problem A transportation problem is called unbalanced if m i=1 a i n j=1 b j. The problem can be made balanced by introducing dummy source with zero costs of transporting from this source to all destinations, or dummy destination with zero costs of transporting to this destination. Example 2.3: Consider the transportation problem presented in the following table.
12 Origin D 1 D 2 D 3 Supply O Demand Table 2.20: Transportation table for Example 2.3 Solution: The given transportation problem is unbalanced as 2 i=1 a i = 800 < 3 j=1 b j = To solve this problem, we introduce a dummy row with transportation cost zero and availability 200, see Table Using Matrix minima method, an initial BFS is obtained as shown in Table The corresponding transportation cost is Rs.( ) = Rs For optimality test, one can use MODI method as explained before. Further, improvement in the solution can be done by forming loop, if needed. D 1 D 2 D 3 Supply O Origin Dummy Demand Table 2.21: Unbalanced transportation table O Dummy b j Table 2.22: Initial BFS Prohibited Transportation Routes Sometimes there may be situations (e.g., road construction, bad road condition, strike, unexpected flood, local traffic rule, etc.) where it is not possible to use certain routes in a transportation problem. To handle such type of problems, a very large cost M or is assigned to each of such routes which are not available. Consider the following transportation problem in which the allocations in the cells (O 1,D 2 ) and (,D 2 ) are prohibited. We assign a cost to each of these cells and determine the initial BFS by Matrix minima method as shown in Table 2.24.
13 Origin D 1 D 2 D 3 Supply O Demand Table 2.23: Example of prohibited transportation route O b j Table 2.24: Initial basic feasible solution Maximization Transportation Problem There are certain types of transportation problem where the objective function is to be maximized instead of being minimized. These problems can be solved by converting the maximization problem into a minimization problem. For this, replace each cost element by the difference from the maximum cost element of the transportation table. Example 2.4: Suppose that three factories X, Y, and Z supply goods to four dealers spread all over the country. The production capacities of these factories are 200, 500 and 300 units per month, respectively. Transportation costs from the factories to the dealers are given in the following Table Determine a suitable allocation to maximize the total net return. Solution: Maximization transportation problem can be converted into minimization transportation problem by subtracting each transportation cost from the maximum transportation cost. Here, the maximum transportation cost is 25. So, we subtract each cost from 25. The revised transportation problem is shown in Table The initial BFS obtained by Matrix minima method is given in Table 2.27.
14 Origin D 1 D 2 D 3 D 4 Availability X Y Z Demand Table 2.25: Transportation table for Example 2.4 Origin X Y Z b j Table 2.26: Revised transportation table X Y Z b j Table 2.27: Initial BFS by Matrix minima method Alternative Optimal Solution If d ij = 0 for an unoccupied cell in an optimal solution then an alternative optimal solution exists. The alternative optimal solution can be obtained by bringing such an unoccupied cell in the basic solution without increasing the total transportation cost.
OPERATIONS RESEARCH. Transportation and Assignment Problems
OPERATIONS RESEARCH Chapter 2 Transportation and Assignment Problems Prof. Bibhas C. Giri Department of Mathematics Jadavpur University Kolkata, India Email: bcgiri.jumath@gmail.com 1.0 Introduction In
More informationChapter 7 TRANSPORTATION PROBLEM
Chapter 7 TRANSPORTATION PROBLEM Chapter 7 Transportation Transportation problem is a special case of linear programming which aims to minimize the transportation cost to supply goods from various sources
More informationUNIT 4 TRANSPORTATION PROBLEM
UNIT 4 TRANSPORTATION PROLEM Structure 4.1 Introduction Objectives 4.2 Mathematical Formulation of the Transportation Problem 4.3 Methods of Finding Initial asic Feasible Solution North-West orner Rule
More informationThe Transportation Problem
11 The Transportation Problem Question 1 The initial allocation of a transportation problem, alongwith the unit cost of transportation from each origin to destination is given below. You are required to
More informationTRANSPORTATION & NETWORK PROBLEMS
TRANSPORTATION & NETWORK PROBLEMS Transportation Problems Problem: moving output from multiple sources to multiple destinations. The objective is to minimise costs (maximise profits). Network Representation
More informationDuality in LPP Every LPP called the primal is associated with another LPP called dual. Either of the problems is primal with the other one as dual. The optimal solution of either problem reveals the information
More informationThe Transportation Problem
CHAPTER 12 The Transportation Problem Basic Concepts 1. Transportation Problem: BASIC CONCEPTS AND FORMULA This type of problem deals with optimization of transportation cost in a distribution scenario
More informationTRANSPORTATION PROBLEMS
63 TRANSPORTATION PROBLEMS 63.1 INTRODUCTION A scooter production company produces scooters at the units situated at various places (called origins) and supplies them to the places where the depot (called
More informationExample: 1. In this chapter we will discuss the transportation and assignment problems which are two special kinds of linear programming.
Ch. 4 THE TRANSPORTATION AND ASSIGNMENT PROBLEMS In this chapter we will discuss the transportation and assignment problems which are two special kinds of linear programming. deals with transporting goods
More informationW P 1 30 / 10 / P 2 25 / 15 / P 3 20 / / 0 20 / 10 / 0 35 / 20 / 0
11 P 1 and W 1 with shipping cost. The column total (i.e. market requirement) corresponding to this cell is 2 while the row total (Plant capacity) is. So we allocate 2 units to this cell. Not the market
More informationTRANSPORTATION PROBLEMS
Chapter 6 TRANSPORTATION PROBLEMS 61 Transportation Model Transportation models deal with the determination of a minimum-cost plan for transporting a commodity from a number of sources to a number of destinations
More informationOPERATIONS RESEARCH. Linear Programming Problem
OPERATIONS RESEARCH Chapter 1 Linear Programming Problem Prof. Bibhas C. Giri Department of Mathematics Jadavpur University Kolkata, India Email: bcgiri.jumath@gmail.com MODULE - 2: Simplex Method for
More informationTransportation Problem
Transportation Problem. Production costs at factories F, F, F and F 4 are Rs.,, and respectively. The production capacities are 0, 70, 40 and 0 units respectively. Four stores S, S, S and S 4 have requirements
More informationM.SC. MATHEMATICS - II YEAR
MANONMANIAM SUNDARANAR UNIVERSITY DIRECTORATE OF DISTANCE & CONTINUING EDUCATION TIRUNELVELI 627012, TAMIL NADU M.SC. MATHEMATICS - II YEAR DKM24 - OPERATIONS RESEARCH (From the academic year 2016-17)
More informationFundamentals of Operations Research. Prof. G. Srinivasan. Indian Institute of Technology Madras. Lecture No. # 15
Fundamentals of Operations Research Prof. G. Srinivasan Indian Institute of Technology Madras Lecture No. # 15 Transportation Problem - Other Issues Assignment Problem - Introduction In the last lecture
More informationMULTIPLE CHOICE QUESTIONS DECISION SCIENCE
MULTIPLE CHOICE QUESTIONS DECISION SCIENCE 1. Decision Science approach is a. Multi-disciplinary b. Scientific c. Intuitive 2. For analyzing a problem, decision-makers should study a. Its qualitative aspects
More informationIE 400: Principles of Engineering Management. Simplex Method Continued
IE 400: Principles of Engineering Management Simplex Method Continued 1 Agenda Simplex for min problems Alternative optimal solutions Unboundedness Degeneracy Big M method Two phase method 2 Simplex for
More informationII BSc(Information Technology)-[ ] Semester-III Allied:Computer Based Optimization Techniques-312C Multiple Choice Questions.
Dr.G.R.Damodaran College of Science (Autonomous, affiliated to the Bharathiar University, recognized by the UGC)Re-accredited at the 'A' Grade Level by the NAAC and ISO 9001:2008 Certified CRISL rated
More informationInternational Journal of Mathematical Archive-4(11), 2013, Available online through ISSN
International Journal of Mathematical Archive-(),, 71-77 Available online through www.ijma.info ISSN 2229 06 A NEW TYPE OF TRANSPORTATION PROBLEM USING OBJECT ORIENTED MODEL R. Palaniyappa 1* and V. Vinoba
More informationOperations Research: Introduction. Concept of a Model
Origin and Development Features Operations Research: Introduction Term or coined in 1940 by Meclosky & Trefthan in U.K. came into existence during World War II for military projects for solving strategic
More information9.5 THE SIMPLEX METHOD: MIXED CONSTRAINTS
SECTION 9.5 THE SIMPLEX METHOD: MIXED CONSTRAINTS 557 9.5 THE SIMPLEX METHOD: MIXED CONSTRAINTS In Sections 9. and 9., you looked at linear programming problems that occurred in standard form. The constraints
More informationOperations Research. Unbalanced transportation problem.
Operations Research. and properties of solutions In the previous lesson, the two special types of solutions of transportation problems (degenerate and alternative) mentioned. However, since both of these
More informationIE 5531: Engineering Optimization I
IE 5531: Engineering Optimization I Lecture 5: The Simplex method, continued Prof. John Gunnar Carlsson September 22, 2010 Prof. John Gunnar Carlsson IE 5531: Engineering Optimization I September 22, 2010
More informationECE 307 Techniques for Engineering Decisions
ECE 7 Techniques for Engineering Decisions Introduction to the Simple Algorithm George Gross Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign ECE 7 5 9 George
More informationDr. S. Bourazza Math-473 Jazan University Department of Mathematics
Dr. Said Bourazza Department of Mathematics Jazan University 1 P a g e Contents: Chapter 0: Modelization 3 Chapter1: Graphical Methods 7 Chapter2: Simplex method 13 Chapter3: Duality 36 Chapter4: Transportation
More informationII. MATHEMATICAL FORM OF TRANSPORTATION PROBLEM The LP problem is as follows. Minimize Z = C X. Subject to the constraints X d For all j
www.ijraset.com Volume Issue X, October 216 A New Technique to Obtain Initial Basic Feasible Solution for the Transportation Problem A. Seethalakshmy 1, N. Srinivasan 2 1 Research Scholar, Department of
More informationUNIT-4 Chapter6 Linear Programming
UNIT-4 Chapter6 Linear Programming Linear Programming 6.1 Introduction Operations Research is a scientific approach to problem solving for executive management. It came into existence in England during
More informationLecture 14 Transportation Algorithm. October 9, 2009
Transportation Algorithm October 9, 2009 Outline Lecture 14 Revisit the transportation problem Simplex algorithm for the balanced problem Basic feasible solutions Selection of the initial basic feasible
More informationIn Chapters 3 and 4 we introduced linear programming
SUPPLEMENT The Simplex Method CD3 In Chapters 3 and 4 we introduced linear programming and showed how models with two variables can be solved graphically. We relied on computer programs (WINQSB, Excel,
More informationCMA Students Newsletter (For Intermediate Students)
Special Edition on Assignment Problem An assignment problem is a special case of transportation problem, where the objective is to assign a number of resources to an equal number of activities so as to
More informationLinear Programming Applications. Transportation Problem
Linear Programming Applications Transportation Problem 1 Introduction Transportation problem is a special problem of its own structure. Planning model that allocates resources, machines, materials, capital
More informationAM 121: Intro to Optimization
AM 121: Intro to Optimization Models and Methods Lecture 6: Phase I, degeneracy, smallest subscript rule. Yiling Chen SEAS Lesson Plan Phase 1 (initialization) Degeneracy and cycling Smallest subscript
More informationThe Transportation Problem. Experience the Joy! Feel the Excitement! Share in the Pleasure!
The Transportation Problem Experience the Joy! Feel the Excitement! Share in the Pleasure! The Problem A company manufactures a single product at each of m factories. i has a capacity of S i per month.
More informationTransportation Simplex: Initial BFS 03/20/03 page 1 of 12
Dennis L. ricker Dept of Mechanical & Industrial Engineering The University of Iowa & Dept of usiness Lithuania hristian ollege Transportation Simplex: Initial FS 0/0/0 page of Obtaining an Initial asic
More informationChap6 Duality Theory and Sensitivity Analysis
Chap6 Duality Theory and Sensitivity Analysis The rationale of duality theory Max 4x 1 + x 2 + 5x 3 + 3x 4 S.T. x 1 x 2 x 3 + 3x 4 1 5x 1 + x 2 + 3x 3 + 8x 4 55 x 1 + 2x 2 + 3x 3 5x 4 3 x 1 ~x 4 0 If we
More informationST. JOSEPH S COLLEGE OF ARTS & SCIENCE (AUTONOMOUS) CUDDALORE-1
ST. JOSEPH S COLLEGE OF ARTS & SCIENCE (AUTONOMOUS) CUDDALORE-1 SUB:OPERATION RESEARCH CLASS: III B.SC SUB CODE:EMT617S SUB INCHARGE:S.JOHNSON SAVARIMUTHU 2 MARKS QUESTIONS 1. Write the general model of
More informationDr. Maddah ENMG 500 Engineering Management I 10/21/07
Dr. Maddah ENMG 500 Engineering Management I 10/21/07 Computational Procedure of the Simplex Method The optimal solution of a general LP problem is obtained in the following steps: Step 1. Express the
More informationLecture 5 Simplex Method. September 2, 2009
Simplex Method September 2, 2009 Outline: Lecture 5 Re-cap blind search Simplex method in steps Simplex tableau Operations Research Methods 1 Determining an optimal solution by exhaustive search Lecture
More informationx 1 + 4x 2 = 5, 7x 1 + 5x 2 + 2x 3 4,
LUNDS TEKNISKA HÖGSKOLA MATEMATIK LÖSNINGAR LINJÄR OCH KOMBINATORISK OPTIMERING 2018-03-16 1. a) The rst thing to do is to rewrite the problem so that the right hand side of all constraints are positive.
More information2-Vehicle Cost Varying Transportation Problem
Journal of Uncertain Systems Vol.8, No.1, pp.44-7, 14 Online at: www.jus.org.uk -Vehicle Cost Varying Transportation Problem Arpita Panda a,, Chandan Bikash Das b a Department of Mathematics, Sonakhali
More information56:270 Final Exam - May
@ @ 56:270 Linear Programming @ @ Final Exam - May 4, 1989 @ @ @ @ @ @ @ @ @ @ @ @ @ @ Select any 7 of the 9 problems below: (1.) ANALYSIS OF MPSX OUTPUT: Please refer to the attached materials on the
More informationYinyu Ye, MS&E, Stanford MS&E310 Lecture Note #06. The Simplex Method
The Simplex Method Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/ yyye (LY, Chapters 2.3-2.5, 3.1-3.4) 1 Geometry of Linear
More informationSensitivity Analysis in Solid Transportation Problems
Applied Mathematical Sciences, Vol. 6, 2012, no. 136, 6787-6796 Sensitivity Analysis in Solid Transportation Problems P. Pandian and K. Kavitha Department of Mathematics, School of Advanced Sciences VIT
More informationLecture 4: Algebra, Geometry, and Complexity of the Simplex Method. Reading: Sections 2.6.4, 3.5,
Lecture 4: Algebra, Geometry, and Complexity of the Simplex Method Reading: Sections 2.6.4, 3.5, 10.2 10.5 1 Summary of the Phase I/Phase II Simplex Method We write a typical simplex tableau as z x 1 x
More informationSpecial cases of linear programming
Special cases of linear programming Infeasible solution Multiple solution (infinitely many solution) Unbounded solution Degenerated solution Notes on the Simplex tableau 1. The intersection of any basic
More informationCHAPTER SOLVING MULTI-OBJECTIVE TRANSPORTATION PROBLEM USING FUZZY PROGRAMMING TECHNIQUE-PARALLEL METHOD 40 3.
CHAPTER - 3 40 SOLVING MULTI-OBJECTIVE TRANSPORTATION PROBLEM USING FUZZY PROGRAMMING TECHNIQUE-PARALLEL METHOD 40 3.1 INTRODUCTION 40 3.2 MULTIOBJECTIVE TRANSPORTATION PROBLEM 41 3.3 THEOREMS ON TRANSPORTATION
More informationThe Dual Simplex Algorithm
p. 1 The Dual Simplex Algorithm Primal optimal (dual feasible) and primal feasible (dual optimal) bases The dual simplex tableau, dual optimality and the dual pivot rules Classical applications of linear
More informationSlack Variable. Max Z= 3x 1 + 4x 2 + 5X 3. Subject to: X 1 + X 2 + X x 1 + 4x 2 + X X 1 + X 2 + 4X 3 10 X 1 0, X 2 0, X 3 0
Simplex Method Slack Variable Max Z= 3x 1 + 4x 2 + 5X 3 Subject to: X 1 + X 2 + X 3 20 3x 1 + 4x 2 + X 3 15 2X 1 + X 2 + 4X 3 10 X 1 0, X 2 0, X 3 0 Standard Form Max Z= 3x 1 +4x 2 +5X 3 + 0S 1 + 0S 2
More informationThe Assignment Problem
CHAPTER 12 The Assignment Problem Basic Concepts Assignment Algorithm The Assignment Problem is another special case of LPP. It occurs when m jobs are to be assigned to n facilities on a one-to-one basis
More informationSimplex tableau CE 377K. April 2, 2015
CE 377K April 2, 2015 Review Reduced costs Basic and nonbasic variables OUTLINE Review by example: simplex method demonstration Outline Example You own a small firm producing construction materials for
More informationORF 522. Linear Programming and Convex Analysis
ORF 5 Linear Programming and Convex Analysis Initial solution and particular cases Marco Cuturi Princeton ORF-5 Reminder: Tableaux At each iteration, a tableau for an LP in standard form keeps track of....................
More informationSolving the Transportation Problem Using Fuzzy Modified Distribution Method
Solving the Transportation Problem Using Fuzzy Modified Distribution Method S.Nareshkumar 1, S.Kumaraghuru 2 1 SriGuru Institute of Technology,Coimbatore. 2 Chikkanna Government Arts College, Tirupur.
More information2. Network flows. Balance of flow: At each node, demand plus total shipments out must equal supply plus total shipments in. Reno. Denver.
. Network flows A network consists of a collection of locations along with connections between them. The locations, called the nodes of the network, can correspond to places of various kinds such as factories,
More informationMinimum cost transportation problem
Minimum cost transportation problem Complements of Operations Research Giovanni Righini Università degli Studi di Milano Definitions The minimum cost transportation problem is a special case of the minimum
More informationTHE UNIVERSITY OF HONG KONG DEPARTMENT OF MATHEMATICS. Operations Research I
LN/MATH2901/CKC/MS/2008-09 THE UNIVERSITY OF HONG KONG DEPARTMENT OF MATHEMATICS Operations Research I Definition (Linear Programming) A linear programming (LP) problem is characterized by linear functions
More informationUNIVERSITY of LIMERICK
UNIVERSITY of LIMERICK OLLSCOIL LUIMNIGH Department of Mathematics & Statistics Faculty of Science and Engineering END OF SEMESTER ASSESSMENT PAPER MODULE CODE: MS4303 SEMESTER: Spring 2018 MODULE TITLE:
More informationAnn-Brith Strömberg. Lecture 4 Linear and Integer Optimization with Applications 1/10
MVE165/MMG631 Linear and Integer Optimization with Applications Lecture 4 Linear programming: degeneracy; unbounded solution; infeasibility; starting solutions Ann-Brith Strömberg 2017 03 28 Lecture 4
More informationOPRE 6201 : 3. Special Cases
OPRE 6201 : 3. Special Cases 1 Initialization: The Big-M Formulation Consider the linear program: Minimize 4x 1 +x 2 3x 1 +x 2 = 3 (1) 4x 1 +3x 2 6 (2) x 1 +2x 2 3 (3) x 1, x 2 0. Notice that there are
More informationTHREE-DIMENS IONAL TRANSPORTATI ON PROBLEM WITH CAPACITY RESTRICTION *
NZOR volume 9 number 1 January 1981 THREE-DIMENS IONAL TRANSPORTATI ON PROBLEM WITH CAPACITY RESTRICTION * S. MISRA AND C. DAS DEPARTMENT OF MATHEMATICS, REGIONAL ENGINEERING COLLEGE, ROURKELA - 769008,
More informationLINEAR PROGRAMMING 2. In many business and policy making situations the following type of problem is encountered:
LINEAR PROGRAMMING 2 In many business and policy making situations the following type of problem is encountered: Maximise an objective subject to (in)equality constraints. Mathematical programming provides
More informationDeveloping an Algorithm for LP Preamble to Section 3 (Simplex Method)
Moving from BFS to BFS Developing an Algorithm for LP Preamble to Section (Simplex Method) We consider LP given in standard form and let x 0 be a BFS. Let B ; B ; :::; B m be the columns of A corresponding
More information3. THE SIMPLEX ALGORITHM
Optimization. THE SIMPLEX ALGORITHM DPK Easter Term. Introduction We know that, if a linear programming problem has a finite optimal solution, it has an optimal solution at a basic feasible solution (b.f.s.).
More informationIntroduce the idea of a nondegenerate tableau and its analogy with nondenegerate vertices.
2 JORDAN EXCHANGE REVIEW 1 Lecture Outline The following lecture covers Section 3.5 of the textbook [?] Review a labeled Jordan exchange with pivoting. Introduce the idea of a nondegenerate tableau and
More informationStandard Form An LP is in standard form when: All variables are non-negativenegative All constraints are equalities Putting an LP formulation into sta
Chapter 4 Linear Programming: The Simplex Method An Overview of the Simplex Method Standard Form Tableau Form Setting Up the Initial Simplex Tableau Improving the Solution Calculating the Next Tableau
More informationInternational Journal of Mathematics Trends and Technology- Volume 16 Number 1 Dec 2014
A study on North east corner method in Transportation Problem and using of Object Oriented Programming model (C++) V. Vinoba and R. Palaniyappa Department of Mathematics, K. N. G. C. (W), Thanjavur 7,
More informationMath Models of OR: Some Definitions
Math Models of OR: Some Definitions John E. Mitchell Department of Mathematical Sciences RPI, Troy, NY 12180 USA September 2018 Mitchell Some Definitions 1 / 20 Active constraints Outline 1 Active constraints
More informationPart 1. The Review of Linear Programming
In the name of God Part 1. The Review of Linear Programming 1.2. Spring 2010 Instructor: Dr. Masoud Yaghini Outline Introduction Basic Feasible Solutions Key to the Algebra of the The Simplex Algorithm
More information56:171 Operations Research Fall 1998
56:171 Operations Research Fall 1998 Quiz Solutions D.L.Bricker Dept of Mechanical & Industrial Engineering University of Iowa 56:171 Operations Research Quiz
More informationCOT 6936: Topics in Algorithms! Giri Narasimhan. ECS 254A / EC 2443; Phone: x3748
COT 6936: Topics in Algorithms! Giri Narasimhan ECS 254A / EC 2443; Phone: x3748 giri@cs.fiu.edu https://moodle.cis.fiu.edu/v2.1/course/view.php?id=612 Gaussian Elimination! Solving a system of simultaneous
More informationMAXIMIZING TRANSPORTATION FLOW UNDER BUDGETARY CONSTRAINT
41 NZOR Volume 11, number 1 January 1983 MAXIMIZING TRANSPORTATION FLOW UNDER BUDGETARY CONSTRAINT SAROJ KHANNA DEPT. OF MATHEMATICS, INDRAPRASTHA COLLEGE FOR WOMEN DELHI UNIVERSITY, DELHI, INDIA. HiC.
More informationTIM 206 Lecture 3: The Simplex Method
TIM 206 Lecture 3: The Simplex Method Kevin Ross. Scribe: Shane Brennan (2006) September 29, 2011 1 Basic Feasible Solutions Have equation Ax = b contain more columns (variables) than rows (constraints),
More informationLinear Programming and its Extensions Prof. Prabha Shrama Department of Mathematics and Statistics Indian Institute of Technology, Kanpur
Linear Programming and its Extensions Prof. Prabha Shrama Department of Mathematics and Statistics Indian Institute of Technology, Kanpur Lecture No. # 03 Moving from one basic feasible solution to another,
More information1 Review Session. 1.1 Lecture 2
1 Review Session Note: The following lists give an overview of the material that was covered in the lectures and sections. Your TF will go through these lists. If anything is unclear or you have questions
More informationDEPARTMENT OF STATISTICS AND OPERATIONS RESEARCH OPERATIONS RESEARCH DETERMINISTIC QUALIFYING EXAMINATION. Part I: Short Questions
DEPARTMENT OF STATISTICS AND OPERATIONS RESEARCH OPERATIONS RESEARCH DETERMINISTIC QUALIFYING EXAMINATION Part I: Short Questions August 12, 2008 9:00 am - 12 pm General Instructions This examination is
More informationF 1 F 2 Daily Requirement Cost N N N
Chapter 5 DUALITY 5. The Dual Problems Every linear programming problem has associated with it another linear programming problem and that the two problems have such a close relationship that whenever
More informationIntroduction to Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras
Introduction to Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Module - 03 Simplex Algorithm Lecture 15 Infeasibility In this class, we
More informationAn Optimal More-for-Less Solution to Fuzzy. Transportation Problems with Mixed Constraints
Applied Mathematical Sciences, Vol. 4, 200, no. 29, 405-45 An Optimal More-for-Less Solution to Fuzzy Transportation Problems with Mixed Constraints P. Pandian and G. Natarajan Department of Mathematics,
More information2. Linear Programming Problem
. Linear Programming Problem. Introduction to Linear Programming Problem (LPP). When to apply LPP or Requirement for a LPP.3 General form of LPP. Assumptions in LPP. Applications of Linear Programming.6
More information3 Does the Simplex Algorithm Work?
Does the Simplex Algorithm Work? In this section we carefully examine the simplex algorithm introduced in the previous chapter. Our goal is to either prove that it works, or to determine those circumstances
More informationChapter 4 The Simplex Algorithm Part II
Chapter 4 The Simple Algorithm Part II Based on Introduction to Mathematical Programming: Operations Research, Volume 4th edition, by Wayne L Winston and Munirpallam Venkataramanan Lewis Ntaimo L Ntaimo
More informationViable and Sustainable Transportation Networks. Anna Nagurney Isenberg School of Management University of Massachusetts Amherst, MA 01003
Viable and Sustainable Transportation Networks Anna Nagurney Isenberg School of Management University of Massachusetts Amherst, MA 01003 c 2002 Viability and Sustainability In this lecture, the fundamental
More informationTIME MINIMIZATION IN TRANSPORTATION PROBLEMS
75 M O P vozmme 6 number J Jan^arz/ TIME MINIMIZATION IN TRANSPORTATION PROBLEMS J,K. SHARMA D.N. POST-GRADUATE COLLEGE, MEERUT. KANT I SWARUP INDIAN INSTITUTE OF PUBLIC ADMINISTRATION, NEW DELHI. Summary
More informationChapter 4 The Simplex Algorithm Part I
Chapter 4 The Simplex Algorithm Part I Based on Introduction to Mathematical Programming: Operations Research, Volume 1 4th edition, by Wayne L. Winston and Munirpallam Venkataramanan Lewis Ntaimo 1 Modeling
More informationLinear Programming. Murti V. Salapaka Electrical Engineering Department University Of Minnesota, Twin Cities
Linear Programming Murti V Salapaka Electrical Engineering Department University Of Minnesota, Twin Cities murtis@umnedu September 4, 2012 Linear Programming 1 The standard Linear Programming (SLP) problem:
More informationNew approach to fixed charges problems (FCP)
ISSN 1 746-7233, England, UK International Journal of Management Science and Engineering Management Vol. 2 (2007) No. 1, pp. 75-80 New approach to fixed charges problems (FCP) Krzysztof Kowalski 1, Benjamin
More informationLinear Programming in Matrix Form
Linear Programming in Matrix Form Appendix B We first introduce matrix concepts in linear programming by developing a variation of the simplex method called the revised simplex method. This algorithm,
More informationAM 121: Intro to Optimization Models and Methods Fall 2018
AM 121: Intro to Optimization Models and Methods Fall 2018 Lecture 5: The Simplex Method Yiling Chen Harvard SEAS Lesson Plan This lecture: Moving towards an algorithm for solving LPs Tableau. Adjacent
More informationSummary of the simplex method
MVE165/MMG631,Linear and integer optimization with applications The simplex method: degeneracy; unbounded solutions; starting solutions; infeasibility; alternative optimal solutions Ann-Brith Strömberg
More informationIE 400 Principles of Engineering Management. The Simplex Algorithm-I: Set 3
IE 4 Principles of Engineering Management The Simple Algorithm-I: Set 3 So far, we have studied how to solve two-variable LP problems graphically. However, most real life problems have more than two variables!
More informationNotes on Simplex Algorithm
Notes on Simplex Algorithm CS 9 Staff October 8, 7 Until now, we have represented the problems geometrically, and solved by finding a corner and moving around Now we learn an algorithm to solve this without
More information3 Development of the Simplex Method Constructing Basic Solution Optimality Conditions The Simplex Method...
Contents Introduction to Linear Programming Problem. 2. General Linear Programming problems.............. 2.2 Formulation of LP problems.................... 8.3 Compact form and Standard form of a general
More informationThe Simplex Algorithm and Goal Programming
The Simplex Algorithm and Goal Programming In Chapter 3, we saw how to solve two-variable linear programming problems graphically. Unfortunately, most real-life LPs have many variables, so a method is
More information56:171 Operations Research Midterm Exam--15 October 2002
Name 56:171 Operations Research Midterm Exam--15 October 2002 Possible Score 1. True/False 25 _ 2. LP sensitivity analysis 25 _ 3. Transportation problem 15 _ 4. LP tableaux 15 _ Total 80 _ Part I: True(+)
More informationUNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc. Mathematics (2011 Admission Onwards) II SEMESTER Complementary Course
UNIVERSITY OF CALICUT SCHOOL OF DISTANCE EDUCATION B Sc. Mathematics (2011 Admission Onwards) II SEMESTER Complementary Course MATHEMATICAL ECONOMICS QUESTION BANK 1. Which of the following is a measure
More information3 The Simplex Method. 3.1 Basic Solutions
3 The Simplex Method 3.1 Basic Solutions In the LP of Example 2.3, the optimal solution happened to lie at an extreme point of the feasible set. This was not a coincidence. Consider an LP in general form,
More informationLinear programming. Debrecen, 2015/16, 1st semester. University of Debrecen, Faculty of Business Administration 1 / 46
1 / 46 Linear programming László Losonczi University of Debrecen, Faculty of Business Administration Debrecen, 2015/16, 1st semester LP (linear programming) example 2 / 46 CMP is a cherry furniture manufacturer
More informationReview Questions, Final Exam
Review Questions, Final Exam A few general questions. What does the Representation Theorem say (in linear programming)? In words, the representation theorem says that any feasible point can be written
More informationSystem Planning Lecture 7, F7: Optimization
System Planning 04 Lecture 7, F7: Optimization System Planning 04 Lecture 7, F7: Optimization Course goals Appendi A Content: Generally about optimization Formulate optimization problems Linear Programming
More informationSEN301 OPERATIONS RESEARCH I LECTURE NOTES
SEN30 OPERATIONS RESEARCH I LECTURE NOTES SECTION II (208-209) Y. İlker Topcu, Ph.D. & Özgür Kabak, Ph.D. Acknowledgements: We would like to acknowledge Prof. W.L. Winston's "Operations Research: Applications
More informationSensitivity Analysis and Duality in LP
Sensitivity Analysis and Duality in LP Xiaoxi Li EMS & IAS, Wuhan University Oct. 13th, 2016 (week vi) Operations Research (Li, X.) Sensitivity Analysis and Duality in LP Oct. 13th, 2016 (week vi) 1 /
More information