Solving the Linear Transportation Problem by Modified Vogel Method
|
|
- Kelley Bates
- 6 years ago
- Views:
Transcription
1 Solving the Linear Transportation Problem by Modified Vogel Method D. Almaatani, S.G. Diagne, Y. Gningue and P. M. Takouda Abstract In this chapter, we propose a modification of the Vogel Approximation Method (VAM) used to obtain near optimal solutions to linear transportation problems. This method, called Modified Vogel Method (MVM), consists of performing the row and column reduction of the cost matrix and then applying the classical Vogel method to the equivalent transportation problem with the reduced cost matrix. We prove that when no further reduction of a cost matrix is required, we do obtain an optimal solution, not an approximate one. We identify some cases when such a behavior occurs and provides rules that allow for fast new reductions and penalty calculations when needed. The method also allows us to make multiple assignments of variables. Numerical tests run on small tests show that the MVM over performs the original one in all instances while requiring comparable computing times. The tests also support the intuition that the new method provides optimal solutions almost all the time, making it a viable alternative to the classical transportation simplex. 1 Linear Transportation Problem The linear transportation problem (LTP) consists in shipping a commodity from supply centers, called sources, to receiving centers, called destinations, while minimizing the total distribution cost. Assuming that we have m sources i = 1,, m P. M. Takouda ( ) School of Commerce & Administration, Laurentian University, Sudbury, Canada mtakouda@laurentian.ca D. Almaatani Department of Mathematics and Computer Sciences, Laurentian University, Sudbury, Canada dalmaatani@laurentian.ca Y. Gningue Department of Mathematics and Computer Sciences, Laurentian University, Sudbury, ON, Canada ygningue@cs.laurentian.ca S. G. Diagne Département de Mathématiques, Université Cheikh Anta Diop, Dakar, Sénégal gueyesalli@yahoo.com Springer International Publishing Switzerland M. G. Cojocaru et al. (eds.), Interdisciplinary Topics in Applied Mathematics, Modeling and Computational Science, Springer Proceedings in Mathematics & Statistics 117, DOI / _3
2 14 P. M. Takouda et al. and n destinations j = 1,, n, we denote by C ij the cost of shipping one unit of commodity from source i to destination j, bya i the capacity of source i and by b j the demand at destination j, Then, the LTP can be formulated as follows. min CT = m n C ij X ij i=1 j=1 n X ij = a i ; i = 1, m LTP j=1 m X ij = b j ; j = 1, n i=1 X ij 0; i = 1, m ; j = 1, n It is a linear program with n+m constraints and n m variables, X ij representing the quantity shipped from source i to destination j. The costs C i,j form a matrix C = (C i,j ) i,j called the cost matrix of the problem. LPT is usually optimally solved using the transportation simplex algorithm (see [3]). This algorithm has to be provided a starting basic feasible solution. Several methods exist that compute such starting points. One of the most efficient is the Vogel Approximation Method (VAM) [6]. Indeed, VAM produces good near optimal solutions, which reduce the number of iterations that the transportation simplex has to perform. Assuming for the rest of this chapter that a line in a matrix refers to either a row and a column in the matrix, the VAM runs as follows. For each line (row or column) of the cost matrix, compute its penalty, which is the difference between the two least costs of the line. Then, locate the line with the largest penalty (called the penalty line), and in that line, look for the lowest shipping cost (this cost is at the intersection of the penalty line and another one called the complementary line). Assign to the corresponding variable X the maximum quantity of commodity that can be shipped at that cost. Update corresponding demand and supply informations. One of these informations will be updated to 0. The corresponding line is said to be saturated and is removed from the cost matrix (which is shrinked). The process is repeated until all the demands have been satisfied. Some additional rules exist that helps deal with special situations such as the occurrence of several largest penalties or degeneracy (when the two penalty and complementary lines are saturated at the same time before the end of the algorithm). The interested reader should refer [6]. Modifications of the original VAM have been proposed, most of them for unbalanced transportation problems. For balanced ones, one variant proposed consisting in modifying the cost matrix as follows: from the cost matrix, obtain the row (respectively column) opportunity cost matrix by subtracting in each row (respectively column) the smallest cost of the row (column) from all entries in the row (column); then add the two row and column opportunity cost matrices to obtain a new cost matrix on which the original VAM is applied. In addition, some additional tie-breaking rules are proposed. These variants are proposed and analyzed in [5] and [7]. Our modification of the VAM extends the one proposed in [4] and is called the Modified Vogel Method (MVM). (1)
3 Solving the Linear Transportation Problem by Modified Vogel Method 15 The rest of the chapter is organized as follows. Next section presents the MVM. Then the method is illustrated on an example with four sources and five destinations in Sect. 3. Numerical tests are presented in Sect. 4 followed by concluding remarks in Sect The Modified Vogel Method The MVM can be described as follows. First, compute the reduced cost matrix, R, by applying successively a row and a column reduction on the cost matrix C and define a reduced transportation problem (RTP) by replacing C in LTP by R. Then, apply the VAM to RTP. At each iteration, the new shrunk matrix is reduced if needed. A reduced cost matrix has a zero in each line. Therefore, penalties in MVM are simply the second lowest costs of the line. Due to the row and column reductions, each entry of the reduced cost matrix already contains information about gaps between the original costs in each row and column. Hence, the associated Vogel penalties are qualitatively better than the ones in VAM. Note also that using MVM, we compute solutions where some of the assigned variables are associated with zero reduced costs of the LTP. This makes them particularly appealing for the simplex transportation algorithms [4]. In fact, in several instances, the transportation simplex algorithm [2] is not needed: MVM is guaranteed to provide the optimal solutions. Theorem 1 The reduced transportation problem (RTP) is equivalent to the linear transportation problem (LTP), and if its optimal cost is zero, then the optimal solution of RTP is optimal for LTP. Proof The row and column reductions that have been applied to the cost matrix to obtain the reduced cost matrix are admissible transformations as defined in [1]. At each iteration of MVM, one line of the current reduced matrix is removed. The remaining shrunk matrix may not be in a reduced form. However, if the highest penalty is nonzero, the penalty line is saturated, and the penalty of the complementary line is zero, then, the shrunk cost matrix remains reduced. Indeed, all the lines parallel to the penalty line are unaltered. They stay reduced, and their penalties are unchanged. Then, the highest penalty being nonzero, there was only one zero entry on the penalty and that zero is also on the complementary line. Crossing the penalty do not remove a zero on the lines parallel to the complementary line. Hence, they stay reduced and their penalty would change only if their penalty was on crossed line. In such a case, the new penalty is simply the next smallest nonzero cost. Finally, the complementary line, since its penalty is 0, had at least two zero entries. Therefore, it has at least one zero remaining and stays reduced and its penalty has to be recalculated. As a result, only a few penalties have to be recalculated. If the penalty of the complementary line was not zero, all the previous remarks are still valid except for the complementary line which is now not reduced. Again, it is easy to reduce: subtract its penalty from all the entries. Note that such an operation
4 16 P. M. Takouda et al. is equivalent to applying an admissible transformation (see [1]) to the reduced cost matrix to solve an equivalent problem in which the complementary line has a zero penalty. In summary, when the saturated line is the penalty line, the shrunk matrix is always reduced, up to an admissible transformation. Hence, the following results hold. Theorem 2 During the application of MVM, we have the two following assertions. 1. If no new reduction is necessary during the iterations, the solution obtained is optimal for LTP. 2. If all the successive line removals are associated to a unique largest penalty, then LTP is optimal. Remark 1 The only time we require the use of the transportation algorithm to obtain the optimal solution is when we have ties for the largest penalty and we had to do new matrix reduction. In the MVM algorithm, we keep track of the occurrences of tied largest penalties and new reductions. The MVM algorithm is hence described as follows. Modified Vogel Algorithm Step 0. Compute the reduced cost matrix (R). Set Nred := 1; TieLpen := 0 and UniqueLpen := 1. Step 1. Penalty Determination Determine the penalties p i for each row i and q j for each column j. Find the largest penalty max{p i,q j } = Lpen. If there is a tie for the largest penalty then set TieLpen := 1. Step 2. Assigning Variable Find a zero reduced cost in the line of Lpen: R kr. X kr will be assigned a value. Step 3. Updating: assign the value of X kr, updates a k and b r. Eliminate the saturated line (supply or demand fully satisfied) Step 4. Stopping Test If there is one remaining line then fill it and go to step 6 Step 5. New Reduction of Remaining Matrix Reduce the remaining matrix then set Nred := Nred + 1. If TieLpen := 1 then set UniqueLpen := 0 and go to step 1. Step 6. Otpimality Test If Nred := 1 then the MVM solution is optimal. elseif UniqueLpen := 1 the MVM solution is optimal. else find the dual variables and test the optimality.
5 Solving the Linear Transportation Problem by Modified Vogel Method 17 3 Illustrative Example Let s illustrate the MVM on the following transportation problem In each row, we identify the smallest cost and subtract it from all the row s entries. As a result, there is a zero in each row. We say that the row is reduced. We obtain the following matrix Since columns 1 and 5 already have a zero, they are already reduced. We reduce columns 2, 3, and 4 (again by subtracting the least cost in the entry from all the column s entries). Then, we compute the penalties for each row (column 7) and column (row 6) and we start the MVM p 1 =0 p 1 = p 2 =0 p 2 =0 p 2 = p 3 = p 4 =0 p 4 =2 p 4 = q 1 =0 q 2 =2 q 3 =2 q 4 =1 q 5 =2 q 2 =2 q 3 =2 q 4 =1 q 5 =2 q 3 =2 q 4 =1 q 5 =2 q 3 =2 q 4 =1 q 5 = 2 q 3 =2 q 4 =1
6 18 P. M. Takouda et al. Iteration 1 Lpen = 3 leading to X 3,1 = 10. No ties for Lpen. Both lines are saturated. Remove the line of largest penalty (row 3). Then, using the least initial costs in column 1, assign X 11 = 0 and remove column 1. No new reduction needed. Iteration 2 Lpen = 4 leading to X 12 = 15. No ties for Lpen. Both lines are saturated. Remove the line of largest penalty (row 1). Again, the least initial cost in column 2 leads to X 41 = 0 and remove column 2. No new reduction needed. Iteration 3 Lpen = 2, and we have a three way tie: row 4, columns 3, 5. Lowest cost break the tie: assign X 25 = 15, remove column 5. No new reduction. Iteration 4 We assign X 44 =14 and fill the last line. We obtain the optimal solution: X 11 =0; X 12 =15; X 23 =10; X 25 =15; X 31 =10; X 44 =14; X 43 =2, with the total cost equal to TC = 339. The solution is optimal for the LPT since no new reduction was ever required. Note that in general, we will need to test the optimality by evaluating the dual variables and the reduced cost for the nonbasic variables. 4 Numerical Tests We run some tests to compare VAM and MVM. Both codes were written in Java. We solved two sets of randomly generated LTPs. The first set consists of 12 problems having the same number (5, 10, 15) of sources and destinations. The second set contains 15 transportation problems with different number of sources and destinations. There were three to five sources and destinations. The MVM has outperformed the VAM in all the cases. The improvement rate, measuring by how much MVM has improved the solution obtained by VAM, ranged from 0 to %. At the same time, MVM has required less computing time: s in average for VAM, compared to 9.72 s for MVM. In all these problems, the MVM provides a better solution than the VAM. We noticed also that the MVM solution is optimal when it equals the VAM. This confirms results from the literature [5,7]: VAM provides an optimal solution at least 80 % of the times [5,7]. Our test suggests that MVM should provide the optimal solutions in a higher proportion of time. It is our next objective: compare the MVM s solutions with LTP optimal ones. 5 Conclusion We introduced with MVM a new algorithm to compute approximate solutions to LTPs based on VAM. MVM always outperforms VAM without requiring significantly more time. It provides qualitatively better starting points to the transportation algorithms. It is proven to provide optimal solutions in several cases, and this optimality can be checked directly in the MVM algorithm. In the future, we would like to identify more of, if not all, the cases where we have a guarantee that MVM provides optimal solutions. It would allow MVM to become a viable alternative to the transportation simplex.
7 Solving the Linear Transportation Problem by Modified Vogel Method 19 References 1. Burkard, R.E.: Admissible transformations and assignment problems. Vietnam J. Math. 35(4), (2007) 2. Charnes, A., Cooper, W.W.: The stepping-stone method for explaining linear programming calculations in transportation problems. Manage. Sci. 1(1), (1954) 3. Dantzig, G.B.: Linear Programming and Extensions. Princeton University Press (1963) 4. Diagne, S.G., Gningue, Y.: Méthode de Vogel modifiée pour la résolution des problèmes de transport simple. Appl. Math. Sci. 5(48), (2011) 5. Mathirajan, M., Neenakshi, B.: Experimental analysis of some variants of Vogel s Approximation Method. Asia Pac. J. Oper. Res. 21(4), (2004) 6. Reinfeld, N.V., Vogel, W.R.: Mathematical Programming. Prentice-Hall, Englewood Cliffs (1958) 7. Singh, S., Dubey, G.C., Shrivastava, R.: Optimization and analysis of some variants through Vogel s Approximation Method (VAM). IOSR J. Eng. (IOSRJEN) 2(9), (2012)
A New Product Form of the Inverse
Applied Mathematical Sciences, Vol 6, 2012, no 93, 4641-4650 A New Product Form of the Inverse Souleymane Sarr Department of mathematics and computer science University Cheikh Anta Diop Dakar, Senegal
More informationLecture notes on Transportation and Assignment Problem (BBE (H) QTM paper of Delhi University)
Transportation and Assignment Problems The transportation model is a special class of linear programs. It received this name because many of its applications involve determining how to optimally transport
More informationAvailable online through ISSN
International Research Journal of Pure Algebra -4(4), 2014, 509-513 Available online through www.rjpa.info ISSN 2248 9037 A STUDY OF UNBALANCED TRANSPORTATION PROBLEM AND USE OF OBJECT ORIENTED PROGRAMMING
More informationThe MOMC Method: a New Methodology to Find. Initial Solution for Transportation Problems
Applied Mathematical Sciences, Vol. 9, 2015, no. 19, 901-914 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2015.4121013 The MOMC Method: a New Methodology to Find Initial Solution for Transportation
More informationAdvanced Approximation Method for Finding an Optimal Solution of Unbalanced Fuzzy Transportation Problems
Global Journal of Pure and Applied Mathematics. ISSN 0973-1768 Volume 13, Number 9 (2017), pp. 5307-5315 Research India Publications http://www.ripublication.com Advanced Approximation Method for Finding
More informationA method for unbalanced transportation problems in fuzzy environment
Sādhanā Vol. 39, Part 3, June 2014, pp. 573 581. c Indian Academy of Sciences A method for unbalanced transportation problems in fuzzy environment 1. Introduction DEEPIKA RANI 1,, T R GULATI 1 and AMIT
More informationFundamentals of Operations Research. Prof. G. Srinivasan. Department of Management Studies. Indian Institute of Technology, Madras. Lecture No.
Fundamentals of Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture No. # 13 Transportation Problem, Methods for Initial Basic Feasible
More informationZero Average Method to Finding an Optimal Solution of Fuzzy Transportation Problems
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-728, p-issn: 2319-76X. Volume 13, Issue 6 Ver. I (Nov. - Dec. 2017), PP 6-63 www.iosrjournals.org Zero verage Method to Finding an Optimal Solution of
More informationTransportation problem
Transportation problem It is a special kind of LPP in which goods are transported from a set of sources to a set of destinations subjects to the supply and demand of the source and destination, respectively,
More informationNew Methodology to Find Initial Solution for. Transportation Problems: a Case Study with Fuzzy Parameters
Applied Mathematical Sciences, Vol. 9, 2015, no. 19, 915-927 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2015.4121018 New Methodology to Find Initial Solution for Transportation Problems:
More informationTRANSPORTATION AND ASSIGNMENT PROBLEMS
TRANSPORTATION AND ASSIGNMENT PROBLEMS Transportation problem Example P&T Company produces canned peas. Peas are prepared at three canneries (Bellingham, Eugene and Albert Lea). Shipped by truck to four
More informationOPERATIONS RESEARCH. Transportation and Assignment Problems
OPERATIONS RESEARCH Chapter 2 Transportation and Assignment Problems Prof Bibhas C Giri Professor of Mathematics Jadavpur University West Bengal, India E-mail : bcgirijumath@gmailcom MODULE-3: Assignment
More informationTransportation Problems
Transportation Problems Transportation is considered as a special case of LP Reasons? it can be formulated using LP technique so is its solution 1 (to p2) Here, we attempt to firstly define what are them
More informationA new approach for solving cost minimization balanced transportation problem under uncertainty
J Transp Secur (214) 7:339 345 DOI 1.17/s12198-14-147-1 A new approach for solving cost minimization balanced transportation problem under uncertainty Sandeep Singh & Gourav Gupta Received: 21 July 214
More informationA New approach for Solving Transportation Problem
Journal for Research Volume 03 Issue 01 March 2017 ISSN: 2395-7549 A New approach for Solving Transportation Problem Manamohan Maharana Lecturer Department of Mathematics M.P.C. (Jr.) College, Baripada,
More informationMath 414 Lecture 30. The greedy algorithm provides the initial transportation matrix.
Math Lecture The greedy algorithm provides the initial transportation matrix. matrix P P Demand W ª «2 ª2 «W ª «W ª «ª «ª «Supply The circled x ij s are the initial basic variables. Erase all other values
More informationAn Appropriate Method for Real Life Fuzzy Transportation Problems
International Journal of Information Sciences and Application. ISSN 097-55 Volume 3, Number (0), pp. 7-3 International Research Publication House http://www.irphouse.com An Appropriate Method for Real
More informationAntti Salonen KPP227 KPP227 1
KPP KPP Transportation method A quantitative approach for cost effective allocation of resources from multiple sources to multiple destinations. In this course we deal with three different methods: - Least
More informationLinear programming II João Carlos Lourenço
Decision Support Models Linear programming II João Carlos Lourenço joao.lourenco@ist.utl.pt Academic year 2012/2013 Readings: Hillier, F.S., Lieberman, G.J., 2010. Introduction to Operations Research,
More informationMathematical and Algorithmic Foundations Linear Programming and Matchings
Adavnced Algorithms Lectures Mathematical and Algorithmic Foundations Linear Programming and Matchings Paul G. Spirakis Department of Computer Science University of Patras and Liverpool Paul G. Spirakis
More informationALGORITHMIC APPROACH TO UNBALANCED FUZZY TRANSPORTATION PROBLEM. A. Samuel 1, P. Raja 2
International Journal of Pure and Applied Mathematics Volume 113 No. 5 2017, 553-561 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: 10.12732/ijpam.v113i5.3
More informationIV. Special Linear Programming Models
IV. Special Linear Programming Models Some types of LP problems have a special structure and occur so frequently that we consider them separately. A. The Transportation Problem - Transportation Model -
More informationH. W. Kuhn. Bryn Mawr College
VARIANTS OF THE HUNGARIAN METHOD FOR ASSIGNMENT PROBLEMS' H. W. Kuhn Bryn Mawr College The author presents a geometrical modelwhich illuminates variants of the Hungarian method for the solution of the
More informationA New Approach for Solving Unbalanced. Fuzzy Transportation Problems
International Journal of Computing and Optimization Vol. 3, 2016, no. 1, 131-140 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijco.2016.6819 A New Approach for Solving Unbalanced Fuzzy Transportation
More informationThe Islamic University of Gaza Faculty of Commerce Quantitative Analysis - Dr. Samir Safi Midterm #2-28/4/2014
The Islamic University of Gaza Faculty of Commerce Quantitative Analysis - Dr. Samir Safi Midterm #2-28/4/2014 Name TRUE/FALSE. Write 'T' if the statement is true and 'F' if the statement is false. 1)
More informationA COMPUTATIONAL STUDY OF THE CONSTRAINED MAXIMUM FLOW PROBLEM
COMPUTTIONL STUDY OF THE CONSTRINED MXIMUM FLOW PROBLEM Cenk Çalışkan, Woodbury School of Business, Utah Valley University, 800 W. University Pkwy, Orem, UT 84058, (801) 863-6487, cenk.caliskan@uvu.edu
More informationA Generalized Model for Fuzzy Linear Programs with Trapezoidal Fuzzy Numbers
J. Appl. Res. Ind. Eng. Vol. 4, No. 1 (017) 4 38 Journal of Applied Research on Industrial Engineering www.journal-aprie.com A Generalized Model for Fuzzy Linear Programs with Trapezoidal Fuzzy Numbers
More informationVARIANTS OF THE SIMPLEX METHOD
C H A P T E R 6 VARIANTS OF THE SIMPLEX METHOD By a variant of the Simplex Method (in this chapter) we mean an algorithm consisting of a sequence of pivot steps in the primal system using alternative rules
More information4. Linear Programming
/9/08 Systems Analysis in Construction CB Construction & Building Engineering Department- AASTMT by A h m e d E l h a k e e m & M o h a m e d S a i e d. Linear Programming Optimization Network Models -
More informationTribhuvan University Institute Of Science and Technology Tribhuvan University Institute of Science and Technology
Tribhuvan University Institute Of Science and Technology Tribhuvan University Institute of Science and Technology Course Title: Linear Programming Full Marks: 50 Course No. : Math 403 Pass Mark: 17.5 Level
More informationSolutions for Operations Research Final Exam
Solutions for Operations Research Final Exam. (a) The buffer stock is B = i a i = a + a + a + a + a + a 6 + a 7 = + + + + + + =. And the transportation tableau corresponding to the transshipment problem
More informationBCN Decision and Risk Analysis. Syed M. Ahmed, Ph.D.
Linear Programming Module Outline Introduction The Linear Programming Model Examples of Linear Programming Problems Developing Linear Programming Models Graphical Solution to LP Problems The Simplex Method
More informationGeorge B. Dantzig Mukund N. Thapa. Linear Programming. 1: Introduction. With 87 Illustrations. Springer
George B. Dantzig Mukund N. Thapa Linear Programming 1: Introduction With 87 Illustrations Springer Contents FOREWORD PREFACE DEFINITION OF SYMBOLS xxi xxxiii xxxvii 1 THE LINEAR PROGRAMMING PROBLEM 1
More informationNATCOR Convex Optimization Linear Programming 1
NATCOR Convex Optimization Linear Programming 1 Julian Hall School of Mathematics University of Edinburgh jajhall@ed.ac.uk 5 June 2018 What is linear programming (LP)? The most important model used in
More informationCopyright 2007 Pearson Addison-Wesley. All rights reserved. A. Levitin Introduction to the Design & Analysis of Algorithms, 2 nd ed., Ch.
Iterative Improvement Algorithm design technique for solving optimization problems Start with a feasible solution Repeat the following step until no improvement can be found: change the current feasible
More informationIntroduction to Operations Research
- Introduction to Operations Research Peng Zhang April, 5 School of Computer Science and Technology, Shandong University, Ji nan 5, China. Email: algzhang@sdu.edu.cn. Introduction Overview of the Operations
More informationModule 7. Independent sets, coverings. and matchings. Contents
Module 7 Independent sets, coverings Contents and matchings 7.1 Introduction.......................... 152 7.2 Independent sets and coverings: basic equations..... 152 7.3 Matchings in bipartite graphs................
More informationIntroduction to Mathematical Programming IE406. Lecture 16. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 16 Dr. Ted Ralphs IE406 Lecture 16 1 Reading for This Lecture Bertsimas 7.1-7.3 IE406 Lecture 16 2 Network Flow Problems Networks are used to model
More informationA Comparative study on Algorithms for Shortest-Route Problem and Some Extensions
International Journal of Basic & Applied Sciences IJBAS-IJENS Vol: No: 0 A Comparative study on Algorithms for Shortest-Route Problem and Some Extensions Sohana Jahan, Md. Sazib Hasan Abstract-- The shortest-route
More informationWhat is linear programming (LP)? NATCOR Convex Optimization Linear Programming 1. Solving LP problems: The standard simplex method
NATCOR Convex Optimization Linear Programming 1 Julian Hall School of Mathematics University of Edinburgh jajhall@ed.ac.uk 14 June 2016 What is linear programming (LP)? The most important model used in
More informationOn the Computational Behavior of a Dual Network Exterior Point Simplex Algorithm for the Minimum Cost Network Flow Problem
On the Computational Behavior of a Dual Network Exterior Point Simplex Algorithm for the Minimum Cost Network Flow Problem George Geranis, Konstantinos Paparrizos, Angelo Sifaleras Department of Applied
More informationDiscrete Optimization. Lecture Notes 2
Discrete Optimization. Lecture Notes 2 Disjunctive Constraints Defining variables and formulating linear constraints can be straightforward or more sophisticated, depending on the problem structure. The
More informationFinal Exam Spring 2003
.8 Final Exam Spring Name Instructions.. Please answer all questions in the exam books that are provided.. Please budget your time carefully. It is often a good idea to read the entire exam first, so that
More informationA Computational Study on the Number of. Iterations to Solve the Transportation Problem
Applied Mathematical Sciences, Vol. 8, 2014, no. 92, 4579-4583 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.46435 A Computational Study on the Number of Iterations to Solve the Transportation
More informationLinear and Integer Programming :Algorithms in the Real World. Related Optimization Problems. How important is optimization?
Linear and Integer Programming 15-853:Algorithms in the Real World Linear and Integer Programming I Introduction Geometric Interpretation Simplex Method Linear or Integer programming maximize z = c T x
More informationAdvanced Operations Research Techniques IE316. Quiz 1 Review. Dr. Ted Ralphs
Advanced Operations Research Techniques IE316 Quiz 1 Review Dr. Ted Ralphs IE316 Quiz 1 Review 1 Reading for The Quiz Material covered in detail in lecture. 1.1, 1.4, 2.1-2.6, 3.1-3.3, 3.5 Background material
More informationLecture 4: Primal Dual Matching Algorithm and Non-Bipartite Matching. 1 Primal/Dual Algorithm for weighted matchings in Bipartite Graphs
CMPUT 675: Topics in Algorithms and Combinatorial Optimization (Fall 009) Lecture 4: Primal Dual Matching Algorithm and Non-Bipartite Matching Lecturer: Mohammad R. Salavatipour Date: Sept 15 and 17, 009
More informationMath 5593 Linear Programming Lecture Notes
Math 5593 Linear Programming Lecture Notes Unit II: Theory & Foundations (Convex Analysis) University of Colorado Denver, Fall 2013 Topics 1 Convex Sets 1 1.1 Basic Properties (Luenberger-Ye Appendix B.1).........................
More informationChapter 15 Introduction to Linear Programming
Chapter 15 Introduction to Linear Programming An Introduction to Optimization Spring, 2015 Wei-Ta Chu 1 Brief History of Linear Programming The goal of linear programming is to determine the values of
More informationMATH 423 Linear Algebra II Lecture 17: Reduced row echelon form (continued). Determinant of a matrix.
MATH 423 Linear Algebra II Lecture 17: Reduced row echelon form (continued). Determinant of a matrix. Row echelon form A matrix is said to be in the row echelon form if the leading entries shift to the
More informationsuccess of Business enterprise especially in manufacturing organization. Goods manufactured by firm need to be distributed to dealers, distributers
INTRODUCTION ASSIGNMENT V/S TRANSPORTATION ASSUMPTIONS INITIAL BASIC FEASIBLE SOLUTION [IBFS] 5 METHODS. DEGENERACY IN TRANSPORTATION OPTIMAL SOLUTION [MODI METHOD] HOW TO PREPARE LOOP PROHIBITED PROBLEM
More informationDEGENERACY AND THE FUNDAMENTAL THEOREM
DEGENERACY AND THE FUNDAMENTAL THEOREM The Standard Simplex Method in Matrix Notation: we start with the standard form of the linear program in matrix notation: (SLP) m n we assume (SLP) is feasible, and
More informationA method for solving unbalanced intuitionistic fuzzy transportation problems
Notes on Intuitionistic Fuzzy Sets ISSN 1310 4926 Vol 21, 2015, No 3, 54 65 A method for solving unbalanced intuitionistic fuzzy transportation problems P Senthil Kumar 1 and R Jahir Hussain 2 1 PG and
More informationR n a T i x = b i} is a Hyperplane.
Geometry of LPs Consider the following LP : min {c T x a T i x b i The feasible region is i =1,...,m}. X := {x R n a T i x b i i =1,...,m} = m i=1 {x Rn a T i x b i} }{{} X i The set X i is a Half-space.
More informationApplication of Bounded Variable Simplex Algorithm in Solving Maximal Flow Model
Dhaka Univ. J. Sci. (): 9-, 3 (January) Application of Bounded Variable Simplex Algorithm in Solving Maximal Flow Model Sohana Jahan, Marzia Yesmin and Fatima Tuj Jahra Department of Mathematics,University
More information4.1 The original problem and the optimal tableau
Chapter 4 Sensitivity analysis The sensitivity analysis is performed after a given linear problem has been solved, with the aim of studying how changes to the problem affect the optimal solution In particular,
More informationPrimal Simplex Algorithm for the Pure Minimal Cost Flow Problem
Primal Simplex Algorithm for the Pure Minimal Cost Flow Problem Algorithm This section describes the adaptation of the primal simplex algorithm for solving a pure network flow program; that is, the problem
More informationLinear Programming. Linear programming provides methods for allocating limited resources among competing activities in an optimal way.
University of Southern California Viterbi School of Engineering Daniel J. Epstein Department of Industrial and Systems Engineering ISE 330: Introduction to Operations Research - Deterministic Models Fall
More informationقالىا سبحانك ال علم لنا إال ما علمتنا صدق هللا العظيم. Lecture 5 Professor Sayed Fadel Bahgat Operation Research
قالىا سبحانك ال علم لنا إال ما علمتنا إنك أنت العليم الحكيم صدق هللا العظيم 1 والصالة والسالم علي اشرف خلق هللا نبينا سيدنا هحود صلي هللا عليه وسلن سبحانك اللهم وبحمدك اشهد أن ال هللا إال أنت استغفرك وأتىب
More information5.4 Pure Minimal Cost Flow
Pure Minimal Cost Flow Problem. Pure Minimal Cost Flow Networks are especially convenient for modeling because of their simple nonmathematical structure that can be easily portrayed with a graph. This
More informationThe simplex method and the diameter of a 0-1 polytope
The simplex method and the diameter of a 0-1 polytope Tomonari Kitahara and Shinji Mizuno May 2012 Abstract We will derive two main results related to the primal simplex method for an LP on a 0-1 polytope.
More informationJournal of Business & Economics Research November, 2009 Volume 7, Number 11
Alternate Solutions Analysis For Transportation Problems Veena Adlakha, University of Baltimore, USA Krzysztof Kowalski, Connecticut Department of Transportation, USA ABSTRACT The constraint structure
More informationThe Dynamic Hungarian Algorithm for the Assignment Problem with Changing Costs
The Dynamic Hungarian Algorithm for the Assignment Problem with Changing Costs G. Ayorkor Mills-Tettey Anthony Stentz M. Bernardine Dias CMU-RI-TR-07-7 July 007 Robotics Institute Carnegie Mellon University
More informationOptimization of Design. Lecturer:Dung-An Wang Lecture 8
Optimization of Design Lecturer:Dung-An Wang Lecture 8 Lecture outline Reading: Ch8 of text Today s lecture 2 8.1 LINEAR FUNCTIONS Cost Function Constraints 3 8.2 The standard LP problem Only equality
More informationTwo-stage Interval Time Minimization Transportation Problem with Capacity Constraints
Two-stage Interval Time Minimization Transportation Problem with Capacity Constraints Abstract Prabhjot Kaur, Kalpana Dahiya * University Institute of Engineering and Technology, Panjab University, Chandigarh.
More informationLecture 11: Maximum flow and minimum cut
Optimisation Part IB - Easter 2018 Lecture 11: Maximum flow and minimum cut Lecturer: Quentin Berthet 4.4. The maximum flow problem. We consider in this lecture a particular kind of flow problem, with
More informationComplementary Graph Coloring
International Journal of Computer (IJC) ISSN 2307-4523 (Print & Online) Global Society of Scientific Research and Researchers http://ijcjournal.org/ Complementary Graph Coloring Mohamed Al-Ibrahim a*,
More informationArtificial Intelligence
Artificial Intelligence Combinatorial Optimization G. Guérard Department of Nouvelles Energies Ecole Supérieur d Ingénieurs Léonard de Vinci Lecture 1 GG A.I. 1/34 Outline 1 Motivation 2 Geometric resolution
More informationThe Further Mathematics Support Programme
Degree Topics in Mathematics Groups A group is a mathematical structure that satisfies certain rules, which are known as axioms. Before we look at the axioms, we will consider some terminology. Elements
More informationExtensions of Semidefinite Coordinate Direction Algorithm. for Detecting Necessary Constraints to Unbounded Regions
Extensions of Semidefinite Coordinate Direction Algorithm for Detecting Necessary Constraints to Unbounded Regions Susan Perrone Department of Mathematics and Statistics Northern Arizona University, Flagstaff,
More informationGraphs and Network Flows IE411. Lecture 20. Dr. Ted Ralphs
Graphs and Network Flows IE411 Lecture 20 Dr. Ted Ralphs IE411 Lecture 20 1 Network Simplex Algorithm Input: A network G = (N, A), a vector of capacities u Z A, a vector of costs c Z A, and a vector of
More informationSome Advanced Topics in Linear Programming
Some Advanced Topics in Linear Programming Matthew J. Saltzman July 2, 995 Connections with Algebra and Geometry In this section, we will explore how some of the ideas in linear programming, duality theory,
More information1. Lecture notes on bipartite matching February 4th,
1. Lecture notes on bipartite matching February 4th, 2015 6 1.1.1 Hall s Theorem Hall s theorem gives a necessary and sufficient condition for a bipartite graph to have a matching which saturates (or matches)
More informationIntroduction. Linear because it requires linear functions. Programming as synonymous of planning.
LINEAR PROGRAMMING Introduction Development of linear programming was among the most important scientific advances of mid-20th cent. Most common type of applications: allocate limited resources to competing
More informationA New Approach to Solve Mixed Constraint Transportation Problem Under Fuzzy Environment
A ew Approach to Solve Mixed Constraint Transportation Problem Under Fuzzy Environment ABSTRACT idhi Joshi 1, Surjeet Singh Chauhan (Gonder) 2, Raghu Raja 3 Research Scholar, PTU, Jalandhar nids_22@yahoo.co.in
More informationCOMPARATIVE STUDY OF NEW PROPOSED METHOD FOR SOLVING ASSIGNMENT PROBLEM WITH THE EXISTING METHODS
COMPARATIVE STUDY OF NEW PROPOSED METHOD FOR SOLVING ASSIGNMENT PROBLEM WITH THE EXISTING METHODS MANVIR KAUR ASSISTANT PROFESSOR SACHDEVA GIRLS COLLEGE, GHARUAN (MOHALI) ABSTRACT Assignment Problem is
More informationA modification of the simplex method reducing roundoff errors
A modification of the simplex method reducing roundoff errors Ralf Ulrich Kern Georg-Simon-Ohm-Hochschule Nürnberg Fakultät Informatik Postfach 21 03 20 90121 Nürnberg Ralf-Ulrich.Kern@ohm-hochschule.de
More informationFuzzy Transportation Problems with New Kind of Ranking Function
The International Journal of Engineering and Science (IJES) Volume 6 Issue 11 Pages PP 15-19 2017 ISSN (e): 2319 1813 ISSN (p): 2319 1805 Fuzzy Transportation Problems with New Kind of Ranking Function
More informationGraphs that have the feasible bases of a given linear
Algorithmic Operations Research Vol.1 (2006) 46 51 Simplex Adjacency Graphs in Linear Optimization Gerard Sierksma and Gert A. Tijssen University of Groningen, Faculty of Economics, P.O. Box 800, 9700
More informationA hybrid GMRES and TV-norm based method for image restoration
A hybrid GMRES and TV-norm based method for image restoration D. Calvetti a, B. Lewis b and L. Reichel c a Department of Mathematics, Case Western Reserve University, Cleveland, OH 44106 b Rocketcalc,
More information15-451/651: Design & Analysis of Algorithms October 11, 2018 Lecture #13: Linear Programming I last changed: October 9, 2018
15-451/651: Design & Analysis of Algorithms October 11, 2018 Lecture #13: Linear Programming I last changed: October 9, 2018 In this lecture, we describe a very general problem called linear programming
More informationNew Directions in Linear Programming
New Directions in Linear Programming Robert Vanderbei November 5, 2001 INFORMS Miami Beach NOTE: This is a talk mostly on pedagogy. There will be some new results. It is not a talk on state-of-the-art
More informationVertex Magic Total Labelings of Complete Graphs 1
Vertex Magic Total Labelings of Complete Graphs 1 Krishnappa. H. K. and Kishore Kothapalli and V. Ch. Venkaiah Centre for Security, Theory, and Algorithmic Research International Institute of Information
More informationModule 9 : Numerical Relaying II : DSP Perspective
Module 9 : Numerical Relaying II : DSP Perspective Lecture 36 : Fast Fourier Transform Objectives In this lecture, We will introduce Fast Fourier Transform (FFT). We will show equivalence between FFT and
More informationTHE simplex algorithm [1] has been popularly used
Proceedings of the International MultiConference of Engineers and Computer Scientists 207 Vol II, IMECS 207, March 5-7, 207, Hong Kong An Improvement in the Artificial-free Technique along the Objective
More information1. What do you get as the integer and noninteger parts if you factor this as we did with our cutting planes:
1. What do you get as the integer and noninteger parts if you factor this as we did with our cutting planes: x 1 = -8.75-3.1 x 2 + 4.2 x 3 + 7 x 5-8 x 6 2. What constraint is added? 3. What do you need
More informationMLR Institute of Technology
Course Name : Engineering Optimization Course Code : 56021 Class : III Year Branch : Aeronautical Engineering Year : 2014-15 Course Faculty : Mr Vamsi Krishna Chowduru, Assistant Professor Course Objective
More informationCMPSCI611: The Simplex Algorithm Lecture 24
CMPSCI611: The Simplex Algorithm Lecture 24 Let s first review the general situation for linear programming problems. Our problem in standard form is to choose a vector x R n, such that x 0 and Ax = b,
More informationDiscrete Optimization 2010 Lecture 5 Min-Cost Flows & Total Unimodularity
Discrete Optimization 2010 Lecture 5 Min-Cost Flows & Total Unimodularity Marc Uetz University of Twente m.uetz@utwente.nl Lecture 5: sheet 1 / 26 Marc Uetz Discrete Optimization Outline 1 Min-Cost Flows
More informationFuzzy Variable Linear Programming with Fuzzy Technical Coefficients
Sanwar Uddin Ahmad Department of Mathematics, University of Dhaka Dhaka-1000, Bangladesh sanwar@univdhaka.edu Sadhan Kumar Sardar Department of Mathematics, University of Dhaka Dhaka-1000, Bangladesh sadhanmath@yahoo.com
More informationSUGGESTED SOLUTION CA FINAL MAY 2017 EXAM
SUGGESTED SOLUTION CA FINAL MAY 2017 EXAM ADVANCED MANAGEMENT ACCOUNTING Test Code - F M J 4 0 1 6 BRANCH - (MULTIPLE) (Date : 11.02.2017) Head Office : Shraddha, 3 rd Floor, Near Chinai College, Andheri
More informationCS675: Convex and Combinatorial Optimization Spring 2018 The Simplex Algorithm. Instructor: Shaddin Dughmi
CS675: Convex and Combinatorial Optimization Spring 2018 The Simplex Algorithm Instructor: Shaddin Dughmi Algorithms for Convex Optimization We will look at 2 algorithms in detail: Simplex and Ellipsoid.
More informationA Feasible Region Contraction Algorithm (Frca) for Solving Linear Programming Problems
A Feasible Region Contraction Algorithm (Frca) for Solving Linear Programming Problems E. O. Effanga Department of Mathematics/Statistics and Comp. Science University of Calabar P.M.B. 1115, Calabar, Cross
More informationWorst case examples of an exterior point algorithm for the assignment problem
Discrete Optimization 5 (2008 605 614 wwwelseviercom/locate/disopt Worst case examples of an exterior point algorithm for the assignment problem Charalampos Papamanthou a, Konstantinos Paparrizos b, Nikolaos
More informationCSE 417 Network Flows (pt 4) Min Cost Flows
CSE 417 Network Flows (pt 4) Min Cost Flows Reminders > HW6 is due Monday Review of last three lectures > Defined the maximum flow problem find the feasible flow of maximum value flow is feasible if it
More informationCHAPTER 2 LITERATURE REVIEW
22 CHAPTER 2 LITERATURE REVIEW 2.1 GENERAL The basic transportation problem was originally developed by Hitchcock (1941). Efficient methods of solution are derived from the simplex algorithm and were developed
More informationMATH3016: OPTIMIZATION
MATH3016: OPTIMIZATION Lecturer: Dr Huifu Xu School of Mathematics University of Southampton Highfield SO17 1BJ Southampton Email: h.xu@soton.ac.uk 1 Introduction What is optimization? Optimization is
More informationSolution of m 3 or 3 n Rectangular Interval Games using Graphical Method
Australian Journal of Basic and Applied Sciences, 5(): 1-10, 2011 ISSN 1991-8178 Solution of m or n Rectangular Interval Games using Graphical Method Pradeep, M. and Renukadevi, S. Research Scholar in
More informationSUBSTITUTING GOMORY CUTTING PLANE METHOD TOWARDS BALAS ALGORITHM FOR SOLVING BINARY LINEAR PROGRAMMING
ASIAN JOURNAL OF MATHEMATICS AND APPLICATIONS Volume 2014, Article ID ama0156, 11 pages ISSN 2307-7743 http://scienceasia.asia SUBSTITUTING GOMORY CUTTING PLANE METHOD TOWARDS BALAS ALGORITHM FOR SOLVING
More informationSection Notes 4. Duality, Sensitivity, and the Dual Simplex Algorithm. Applied Math / Engineering Sciences 121. Week of October 8, 2018
Section Notes 4 Duality, Sensitivity, and the Dual Simplex Algorithm Applied Math / Engineering Sciences 121 Week of October 8, 2018 Goals for the week understand the relationship between primal and dual
More information