AN EXPERIMENTAL INVESTIGATION OF A PRIMAL- DUAL EXTERIOR POINT SIMPLEX ALGORITHM
|
|
- Kerrie Grant
- 5 years ago
- Views:
Transcription
1 AN EXPERIMENTAL INVESTIGATION OF A PRIMAL- DUAL EXTERIOR POINT SIMPLEX ALGORITHM Glavelis Themistoklis Samaras Nikolaos Paparrizos Konstantinos PhD Candidate Assistant Professor Professor Department of Applied Informatics, University of Macedonia, 156 Egnatia Str., Thessaloniki, Greece Department of Applied Informatics, University of Macedonia, 156 Egnatia Str., Thessaloniki, Greece Department of Applied Informatics, University of Macedonia, 156 Egnatia Str., Thessaloniki, Greece Abstract The aim of this paper is to present an experimental investigation of a Primal-Dual Exterior Point Simplex Algorithm (PDEPSA) for Linear Programming problems (LPs). There was a huge gap between the theoretical worst case complexity and practical performance of simplex type algorithms. The algorithm bases on interior points to move from one basic solution to another. The main advantage of PDEPSA is its computational performance. This performance stems from the fact that PDEPSA can deal much better with the problem of stalling and cycling. Moreover, the use of interior points is responsible for the reduction of iterations and the CPU time and especially in linear degenerate problems. A computational study is also presented with experiments on randomly generated sparse optimal linear problems, which increases the reliability of the conclusions. The algorithm is very encouraging and promising due to the fact that it proved its superiority to the exterior point algorithm and the primal revised simplex algorithm on the computational study. KEYWORDS Linear programming, Primal Simplex algorithms, Exterior Point Algorithms, Computational results. 1. INTRODUCTION One of the most significant and well-studied optimization problems is the Linear Programming problem (LP). Linear programming consists of optimizing, (minimizing or maximizing) a linear function over a certain domain. The domain is given by a set of linear constraints. The simplex algorithm is the oldest and most well-known solution method for the LP. George B. Dantzig is regarded as the founder of linear programming and the person who set the fundamental principles of optimization. The simplex starts from a feasible solution and moves from one vertex to an adjacent one until an optimum solution is computed (Dantzig, 1963). The two main drawbacks of the simplex algorithm are the stalling and/or the cycling problem. Moreover, the phenomenon of cycling is very often in many practical problems for the simplex algorithm. In order to avoid the problem of cycling, researchers have introduced many anti-cycling pivoting rules (Terlaky & Zhang, 1993). The simplex algorithm performs effectively in practice only under specific circumstances and especially on small or medium size LPs. It has been proved that the average number of iterations in simplex algorithm can be estimated with a polynomial bound (Borgwardt, 1982). Despite that the worst case complexity of the simplex method has exponential behavior (Klee & Minty, 1992). Until the decade of 1980 simplex algorithm and barrier methods were known as the only solution approach for the LP. This situation changed in 1984 when the first try of interior point methods for linear programming appeared (Karmarkar, 1984). Next years researchers focused their attention on how the simplex algorithm and the Interior Point Methods (IPMs) can be combined in order to improve the computational behavior of software packages (Erling et al., 1996). In contrast to the simplex method, IPMs compute an optimal solution by moving inside the feasible region. Moreover, the research adopted primal-dual algorithms based on IPMs and simplex method which were regarded as the most significant and useful algorithms. The primal-dual methods for linear programming have interesting theoretical properties. On the
2 computational side, Mehrotra s predictor corrector algorithm was the main idea for the most interior-point software (Wright, 1997). Primal-dual methods have good computational performance and they can be extended to wider classes of problems in mathematical programming (Gondzio, 1996). Apart from the IPMs, another approach to solve LPs is to modify the main idea of simplex algorithm to move from one basic vertex to another in the exterior of the feasible region. The algorithm can construct basic infeasible solutions instead of feasible. The algorithm which includes these kinds of features are called exterior point simplex algorithm (EPSA). The first attempt for an exterior point algorithm was introduced in 1991 for the assignment problem (Paparrizos, 1991). Since then, many papers and articles have been presented in order to enhance the capabilities of the exterior point algorithms. A significant improvement is the primal-dual versions of the algorithm which reveal its superiority to simplex algorithm. The main idea of exterior point algorithm is that it relies on two paths for estimating the optimal solution. The first past refers to a number of feasible solutions until the optimal is found and the other path includes basic points which lead to the exterior path. The exterior point algorithm has two main disadvantages (Paparrizos et al., 2003B). The first refers to the construction of moving directions which should lead the algorithm close to the optimal solution. The creation of a direction with these features is a difficult process. The second disadvantage is the fact that there is no known method which can reveal the path that leads into the interior of the feasible region, something which would make easier the search of a computational good direction. These advantages can be avoided if the exterior path is replaced with a dual feasible simplex path. This method has been introduced by Paparrizos et al. (Paparrizos et al., 2003A). The main idea of the Revised Primal Dual Simplex Algorithm (RPDSA) is based on the process of moving from any interior point to an optimal basic solution. The advantage of this algorithm is that the optimal solution is not computed by an interior point method but it can be used only in the first stage. After the first few iterations IPMs do not result in great enhancements of the objective function s value. RPDSA can be applied in the second stage and computes the optimal solution in a few iterations, much faster from an interior point method. Although this algorithm is better from the exterior point algorithm and it deals very well with the two disadvantages which were described above. The algorithm of our paper introduces a new technique which deals with the problems of stalling and cycling and improves the performance of the RPDSA. This algorithm has been developed by Samaras (Samaras, 2001). This algorithm is primal-dual, meaning that it simultaneously solves both the primal and dual problem. RPDSA begins with a boundary point of the feasible region. This boundary point is used in order to compute the leaving variable. It has been observed that in this stage the problem of stalling can arise very often. This weakness can be overcome if the boundary point is replaced by an interior point. The transfer into the interior of feasible region disappear the problem of cycling. In order to gain an insight into the practical behavior of the proposed algorithm, we have performed some computational experiments. Preliminary results on randomly generated LPs show that the reduction in the computational effort is promising. The paper is organized as follows. Following introduction, in section 2 we briefly describe the general framework of the proposed algorithm. In section 3 the computational study is presented. Finally, in section 4 there are the conclusions and possible enhancements of the proposed algorithm. 2. ALGORITHM DESCRIPTION In this section we briefly describe the Primal-Dual Exterior Point Simplex Algorithm (PDEPSA). For solving general LPs see (Paparrizos et al., 2003B) and for a full description of PDEPSA see (Samaras, 2001). Consider now the following linear program in the standard form. min c T x s. t. Ax = b (LP) x 0 where A R mxn, c,x R n, b R m and T denotes transpose. Assume that A has full rank, rank(a)=m (m<n). The dual problem associated with (LP) is max b T x s. t. A T w+s = c (DP) s 0
3 where w R n and s R n. Step 0 (Initialization): A) Start with a dual feasible basic partition (B, N) and an interior point y of (LP). Set: P = N, Q = and compute 1 Τ T 1 T T xb = ( AB) b, w = ( cb ) ( AB),( sn) = ( cn) w AN B) Compute the direction d B from the relation: db = yb xb Step 1 (Test of optimality and choice of the leaving variable): If x 0, STOP. The (LP) is optimal. Else, choose the leaving variable xk = xb[ r] from the relation: xbr [ ] xbr [ ] a = l max{ : db[] i 0 [] 0} d = d > x < B i Br [ ] Br [ ] Step 2 (Computation of the next interior point): Set: Compute the interior point: yb = xb + adb a a = Step 3 (Choice of the entering variable): 1 Set: H rn = ( B ) r. A. N Choose the entering variable x l from the relation: s s l j = min{ : H rj j N} H H 1 Compute the pivoting column: hl = B A. l If l P, P P\{l} Else Q Q\{} l rn Step 4 (Pivoting): Set: Br [ ] = land Q Q {k} Using the new partition (B, N) where N = (P, Q), compute the new basis inverse B -1 and the variables: 1 Τ T 1 T T xb = ( AB) b, w = ( cb ) ( AB),( sn) = ( cn) w AN Go to step 0B. rj 3. COMPUTATIONAL STUDY In order to check and test the performance and practical effectiveness of our algorithm, a computational study is presented below. The problems which were included in the computational study were small and medium scale sparse instances. The computational study includes the revised simplex algorithm, the Exterior Point Simplex Algorithm (EPSA) and the Primal Dual Exterior Point Simplex Algorithm (PDEPSA). All implemented algorithms are running in MATLAB Professional R2010b. MATLAB (MATrix LABoratory) is a powerful programming environment and as its name suggests, is especially designed for
4 matrix computations like, solving systems of linear equations or factorizing matrices. Also, it is an interactive environment and programming language for numeric scientific computing. The computing environment includes an Intel(R) Core i GHz (2 processors) and MB RAM. The operating system was Microsoft Windows 7 Professional SP1 edition. All times in the following tables are measured in seconds with the cputime built-in function of MATLAB, including the time spent on scaling. All runs were made as a batch job. Two techniques are used in order to improve the performance of memory-bound code in MATLAB. These techniques are: (i) Pre-allocate arrays, and (ii) Store and access data in columns. Three different density classes of LPs are used in the computational study: 5%, 10% and 20%. In each dimension 10 different instances are tested. These LPs include only randomly generated matrices. The initial basis consists of only the slack variables. Tables 1-3 present the average execution time in seconds (CPU time) and the average number of iterations (niter) that each of the competitive spent to solve the LPs in request. Table 1. Results for randomly generated sparse LPs with dimension nxn and density 5% PDEPSA EPSA Simplex Density 5% CPU_time (sec) Niter CPU_time (sec) Niter CPU_time (sec) Niter 500 x 500 0, , , x 600 1, , , x 700 2, , , x 800 3, , , x 900 5, , , x , , , x , , , x , , , x , , , x , , , x , , , x , , , x , , , x , , , x , , , x , , , Total 468, , , As it is obvious from the first table, PDEPSA is clearly superior to the other two algorithms. The execution time of PDEPSA is much lower than EPSA and simplex algorithm. For example, PDEPSA needs almost 8 seconds to solve a 1000 x 1000 problem when EPSA demands almost 40 seconds and even worse Simplex Algorithm needs 83 seconds to complete the computations. Likewise, the number of iterations is much greater for Simplex Algorithm and much less from PDEPSA. In addition, in a 2000 x 2000 problem the simplex algorithm requires in average iterations when PDEPSA claims for iterations and EPSA algorithms. It is clear that PDEPSA can lead to significant reductions of the execution time and the number of iterations. In the same problem, PDEPSA can solve the linear problem almost in 90 seconds when Simplex algorithm needs seconds. One may infer a growth in the relative speed of PDEPSA with respect to simplex and EPSA as problem sizes increase. Table 2. Results for randomly generated sparse LPs with dimension nxn and density 10% PDEPSA EPSA Simplex Density 10% CPU_time (sec) Niter CPU_time (sec) Niter CPU_time (sec) Niter 500 x 500 0, , ,
5 600 x 600 1, , , x 700 2, , , x 800 4, , , x 900 6, , , x , , , x , , , x , , , x , , , x , , , x , , , x , , , x , , , x , , , x , , , x , , , Total 543, , , In less sparse problems the PDEPSA continues to present its surprisingly good performance. Its superiority is clear and with no doubt it is an effective and promising algorithm. In all dimensions PDEPSA has the shortest execution time and the smallest number of iterations. Table 3. Results for randomly generated sparse LPs with dimension nxn and density 20% Density 20% PDEPSA EPSA Simplex CPU_time (sec) Niter CPU_time (sec) Niter CPU_time (sec) Niter 500 x 500 1, , , x 600 2, , , x 700 3, , , x 800 5, , , x 900 8, , , x , , , x , , , x , , , x , , , x , , , x , , , x , , , x , , , x , , , x , , , x , , , Total 678, , , , , ,635 In addition, in the last group of problems with bigger density PDEPSA keeps to be the algorithm with the best performance by far. A characteristic example, with a 1500 x 1500 problem PDEPSA requires in average 52 seconds when EPSA needs 130 seconds and the simplex algorithm 600 seconds. Likewise, the number of iterations is much less in PDEPSA which is able to estimate the optimal solution only within iterations when EPSA needs to make and the simplex algorithm almost iterations.
6 Furthermore, below figures can show more clearly the superiority of PDEPSA over EPSA and the Simplex Algorithm. Figures 1-3 present the ratios (execution time of the EPSA)/(execution time of the PDEPSA), (iterations of the EPSA)/(iterations of the PDEPSA), (execution time of the Simplex Algorithm)/(execution time of the PDEPSA) and (iterations of the Simplex Algorithm)/(iterations of the PDEPSA) for the corresponding densities and dimensions. The above ratios indicate how many times PDEPSA is better than EPSA and the Simplex Algorithm. Figure 1. Speed-up ratios for nxn LPs and density 5% 25,00 cpu time ratio EPSA over PDEPSA cpu time ratio Simplex over PDEPSA niter ratio EPSA over PDEPSA niter ratio Simplex over PDEPSA 20,00 15,00 10,00 5,00 0,00 From the above figure, it is clear that as the problem dimensions increases the superiority of PDEPSA over EPSA does not vary a lot and we can claim that PDEPSA is five times faster than EPSA and it requires five times less iterations to complete its computations. On the other hand, the superiority of PDEPSA over simplex algorithm increases proportionally with the dimension of the problems. With small size LPs PDEPSA is almost five times faster and requires five times less iterations than simplex method. In contrast, in bigger LPs, like 2000 x 2000 LPs PDEPSA is almost 23 times faster and it needs 13 times less iterations. Figure 2. Speed-up ratios for nxn LPs and density 10% 25,00 cpu time ratio of EPSA over PDEPSA niter ratio of EPSA over PDEPSA cpu time ratio of Simplex over PDEPSA niter ratio of Simplex over PDEPSA 20,00 15,00 10,00 5,00 0,00 As the density of problems increases, PDEPSA continues its superiority and the results are as satisfactory as in more sparse problems. Comparatively to EPSA, PDEPSA is 4 times faster and it demands 4 times less iterations in small size LPs. However, in bigger scale LPs the difference decreases to 3 times for the execution time and the number of iterations. In regard to the simplex method, the results are very similar with the previous group of problems (density 5%), the superiority of PDEPSA over simplex algorithm increases analogically with the dimension of problems.
7 Figure 3. Speed-up ratios for nxn LPs and density 20% 18,00 16,00 14,00 12,00 10,00 8,00 6,00 4,00 2,00 0,00 cpu time ratio of EPSA over PDEPSA cpu time ratio of Simplex over PDEPSA niter ratio of EPSA over PDEPSA niter ratio of EPSA Simplex PDEPSA In the last group of problems with the density at the level of 20%, the results do not differ a lot from the previous. PDEPSA is almost 3 times better than EPSA both in the execution time and the number of iterations. On the other hand, PDEPSA is almost 6 times faster and it requires 6 times less iterations in small size LPs like 500 x 500 and 600 x 600 dimension problems. In bigger scale LPs, the difference increases and it reaches 16 times faster referring to execution time and the 10 times less iterations for PDEPSA. The results of the computational study clearly proved that the PDEPSA can perform faster and with a minor number of iterations in perspective to the performance of the simplex algorithm. Nevertheless, it is significant to mention the fact that as the density increases the superiority of PDEPSA decreases. More specific, in 2000 x 2000 dimension the PDEPSA is 23 times faster than the simplex algorithm in the 5 % density when in 20% density PDEPSA is almost 16 times faster. Despite the fact that this looks like a drawback because the performance of PDEPSA decreases comparing to simplex algorithm, in fact is not. In real world, the vast majority of problems are extremely sparse problems, and their density does not reach the level of 5%. Consequently, this computational performance of PDEPSA is a remarkable advantage and clearly shows its worth. 4. CONCLUSION The current paper investigates the practical behavior of the PDEPSA. The PDEPSA which is presented in this paper refers to the attempt to avoid the problem of stalling and/or cycling. The elimination of these disadvantages can lead to a more effective algorithm with better computational performance. Apart from the description of the algorithm, we presented an extended comparative computational study between the Revised Primal Simplex Algorithm, the Exterior Point Simplex Algorithm and the Primal-Dual Exterior Point Simplex Algorithm. In this computational study randomly generated sparse optimal linear problems are used and all the implementations were accomplished with the help of MATLAB programming environment. Regarding to the results, PDEPSA has proved its superiority to EPSA and the simplex method in all densities and sizes. PDEPSA indicates the same behavior comparing to EPSA in all sizes of the LPs. Their difference is not affected by the dimensions of the linear problems. In contrast to this, in all densities the performance of PDEPSA is getting better comparing to the simplex algorithm while the size of the LPs increases. Moreover, the computational performance of PDEPSA is much better in very sparse problems. As the results clarify, PDEPSA can perform little better in 5% density than in 20% density. The difference between simplex algorithm and PDEPSA is greater in sparser problems. This is a strong and significant advantage of PDEPSA because in real problems the level of density is very low.
8 REFERENCES Borgwardt H.K., The average number of pivot steps required by the simplex method is polynomial. Zeitschrift fur Operational Research, Series A: Theory Vo. 26, No. 5, pp Dantzig, G.B., Linear Programming and Extensions, Princeton, University Press, Princeton, NJ. Erling, D., Andersen, and Yinyu, Ye, Combining interior-point and pivoting algorithms for Linear Programming, Management Science, Vol. 42, No. 12, pp Gondzio, J., Multiple centrality corrections in a primal-dual method for linear programming, Computational Optimization and Applications, Vol. 6, No. 2, pp Karmarkar N.K., A polynomial-time algorithm for linear programming, Combinatorica, Vol. 4, pp Klee V, Minty GJ How good is the simplex algorithm?, Inequalities III. New York: Academic Press, pp Paparrizos K., An infeasible exterior point simplex algorithm for assignment problems. Mathematical Programming, Vol, 51, pp Paparrizos K., Samaras, N., and Stephanides, G., 2003A. A new efficient primal dual simplex algorithm, Computers and Operations Research, vol. 30, pp Paparrizos, K., Samaras, N., Stephanides, G., 2003B. An efficient simplex type algorithm for sparse and dense linear programs, European Journal of Operational Research, Vol. 148, No. 2, pp Samaras N., Computational improvements and efficient implementation of two path pivoting algorithms, PhD Thesis, Department of Applied Informatics, University of Macedonia. Terlaky T., Zhang S., Pivot rules for linear programming A survey, Annals of Operations Research, Vol. 3, No. 1, pp Wright St., 1997, Primal dual interior point methods, Society for Industrial and Applied Mathemaics, Philadelphia, United States of America.
A PRIMAL-DUAL EXTERIOR POINT ALGORITHM FOR LINEAR PROGRAMMING PROBLEMS
Yugoslav Journal of Operations Research Vol 19 (2009), Number 1, 123-132 DOI:10.2298/YUJOR0901123S A PRIMAL-DUAL EXTERIOR POINT ALGORITHM FOR LINEAR PROGRAMMING PROBLEMS Nikolaos SAMARAS Angelo SIFELARAS
More informationThree nearly scaling-invariant versions of an exterior point algorithm for linear programming
Optimization A Journal of Mathematical Programming and Operations Research ISSN: 0233-1934 (Print) 1029-4945 (Online) Journal homepage: http://www.tandfonline.com/loi/gopt20 Three nearly scaling-invariant
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 informationExterior Point Simplex-type Algorithms for Linear and Network Optimization Problems
Annals of Operations Research manuscript No. (will be inserted by the editor) Exterior Point Simplex-type Algorithms for Linear and Network Optimization Problems Konstantinos Paparrizos Nikolaos Samaras
More informationLECTURE 6: INTERIOR POINT METHOD. 1. Motivation 2. Basic concepts 3. Primal affine scaling algorithm 4. Dual affine scaling algorithm
LECTURE 6: INTERIOR POINT METHOD 1. Motivation 2. Basic concepts 3. Primal affine scaling algorithm 4. Dual affine scaling algorithm Motivation Simplex method works well in general, but suffers from exponential-time
More informationA NEW SIMPLEX TYPE ALGORITHM FOR THE MINIMUM COST NETWORK FLOW PROBLEM
A NEW SIMPLEX TYPE ALGORITHM FOR THE MINIMUM COST NETWORK FLOW PROBLEM KARAGIANNIS PANAGIOTIS PAPARRIZOS KONSTANTINOS SAMARAS NIKOLAOS SIFALERAS ANGELO * Department of Applied Informatics, University of
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 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 information3 Interior Point Method
3 Interior Point Method Linear programming (LP) is one of the most useful mathematical techniques. Recent advances in computer technology and algorithms have improved computational speed by several orders
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 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 informationEARLY INTERIOR-POINT METHODS
C H A P T E R 3 EARLY INTERIOR-POINT METHODS An interior-point algorithm is one that improves a feasible interior solution point of the linear program by steps through the interior, rather than one that
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 informationChapter II. Linear Programming
1 Chapter II Linear Programming 1. Introduction 2. Simplex Method 3. Duality Theory 4. Optimality Conditions 5. Applications (QP & SLP) 6. Sensitivity Analysis 7. Interior Point Methods 1 INTRODUCTION
More informationLinear Programming Duality and Algorithms
COMPSCI 330: Design and Analysis of Algorithms 4/5/2016 and 4/7/2016 Linear Programming Duality and Algorithms Lecturer: Debmalya Panigrahi Scribe: Tianqi Song 1 Overview In this lecture, we will cover
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 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 informationTwo new variants of Christofides heuristic for the Static TSP and a computational study of a nearest neighbor approach for the Dynamic TSP
Two new variants of Christofides heuristic for the Static TSP and a computational study of a nearest neighbor approach for the Dynamic TSP Orlis Christos Kartsiotis George Samaras Nikolaos Margaritis Konstantinos
More informationA Simplex-Cosine Method for Solving Hard Linear Problems
A Simplex-Cosine Method for Solving Hard Linear Problems FEDERICO TRIGOS 1, JUAN FRAUSTO-SOLIS 2 and RAFAEL RIVERA-LOPEZ 3 1 Division of Engineering and Sciences ITESM, Campus Toluca Av. Eduardo Monroy
More informationThe Simplex Algorithm with a New. Primal and Dual Pivot Rule. Hsin-Der CHEN 3, Panos M. PARDALOS 3 and Michael A. SAUNDERS y. June 14, 1993.
The Simplex Algorithm with a New rimal and Dual ivot Rule Hsin-Der CHEN 3, anos M. ARDALOS 3 and Michael A. SAUNDERS y June 14, 1993 Abstract We present a simplex-type algorithm for linear programming
More informationOutline. CS38 Introduction to Algorithms. Linear programming 5/21/2014. Linear programming. Lecture 15 May 20, 2014
5/2/24 Outline CS38 Introduction to Algorithms Lecture 5 May 2, 24 Linear programming simplex algorithm LP duality ellipsoid algorithm * slides from Kevin Wayne May 2, 24 CS38 Lecture 5 May 2, 24 CS38
More informationConvex Optimization CMU-10725
Convex Optimization CMU-10725 Ellipsoid Methods Barnabás Póczos & Ryan Tibshirani Outline Linear programs Simplex algorithm Running time: Polynomial or Exponential? Cutting planes & Ellipsoid methods for
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 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 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 informationSubmodularity Reading Group. Matroid Polytopes, Polymatroid. M. Pawan Kumar
Submodularity Reading Group Matroid Polytopes, Polymatroid M. Pawan Kumar http://www.robots.ox.ac.uk/~oval/ Outline Linear Programming Matroid Polytopes Polymatroid Polyhedron Ax b A : m x n matrix b:
More informationProgramming, numerics and optimization
Programming, numerics and optimization Lecture C-4: Constrained optimization Łukasz Jankowski ljank@ippt.pan.pl Institute of Fundamental Technological Research Room 4.32, Phone +22.8261281 ext. 428 June
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 informationSphere Methods for LP
Sphere Methods for LP Katta G. Murty Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI 48109-2117, USA Phone: 734-763-3513, Fax: 734-764-3451 murty@umich.edu www-personal.engin.umich.edu/
More informationAlgorithmic Game Theory and Applications. Lecture 6: The Simplex Algorithm
Algorithmic Game Theory and Applications Lecture 6: The Simplex Algorithm Kousha Etessami Recall our example 1 x + y
More informationLinear Programming Problems
Linear Programming Problems Two common formulations of linear programming (LP) problems are: min Subject to: 1,,, 1,2,,;, max Subject to: 1,,, 1,2,,;, Linear Programming Problems The standard LP 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 informationDM545 Linear and Integer Programming. Lecture 2. The Simplex Method. Marco Chiarandini
DM545 Linear and Integer Programming Lecture 2 The Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark Outline 1. 2. 3. 4. Standard Form Basic Feasible Solutions
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 informationA CSP Search Algorithm with Reduced Branching Factor
A CSP Search Algorithm with Reduced Branching Factor Igor Razgon and Amnon Meisels Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, 84-105, Israel {irazgon,am}@cs.bgu.ac.il
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 informationarxiv: v1 [cs.cc] 30 Jun 2017
On the Complexity of Polytopes in LI( Komei Fuuda May Szedlá July, 018 arxiv:170610114v1 [cscc] 30 Jun 017 Abstract In this paper we consider polytopes given by systems of n inequalities in d variables,
More informationMATH 310 : Degeneracy and Geometry in the Simplex Method
MATH 310 : Degeneracy and Geometry in the Simplex Method Fayadhoi Ibrahima December 11, 2013 1 Introduction This project is exploring a bit deeper the study of the simplex method introduced in 1947 by
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 informationA Simplex Based Parametric Programming Method for the Large Linear Programming Problem
A Simplex Based Parametric Programming Method for the Large Linear Programming Problem Huang, Rujun, Lou, Xinyuan Abstract We present a methodology of parametric objective function coefficient programming
More information16.410/413 Principles of Autonomy and Decision Making
16.410/413 Principles of Autonomy and Decision Making Lecture 17: The Simplex Method Emilio Frazzoli Aeronautics and Astronautics Massachusetts Institute of Technology November 10, 2010 Frazzoli (MIT)
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 informationSection Notes 5. Review of Linear Programming. Applied Math / Engineering Sciences 121. Week of October 15, 2017
Section Notes 5 Review of Linear Programming Applied Math / Engineering Sciences 121 Week of October 15, 2017 The following list of topics is an overview of the material that was covered in the lectures
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 informationIntroduction to Linear Programming
Introduction to Linear Programming Eric Feron (updated Sommer Gentry) (updated by Paul Robertson) 16.410/16.413 Historical aspects Examples of Linear programs Historical contributor: G. Dantzig, late 1940
More informationRead: H&L chapters 1-6
Viterbi School of Engineering Daniel J. Epstein Department of Industrial and Systems Engineering ISE 330: Introduction to Operations Research Fall 2006 (Oct 16): Midterm Review http://www-scf.usc.edu/~ise330
More informationTHEORY OF LINEAR AND INTEGER PROGRAMMING
THEORY OF LINEAR AND INTEGER PROGRAMMING ALEXANDER SCHRIJVER Centrum voor Wiskunde en Informatica, Amsterdam A Wiley-Inter science Publication JOHN WILEY & SONS^ Chichester New York Weinheim Brisbane Singapore
More informationLinear Programming Motivation: The Diet Problem
Agenda We ve done Greedy Method Divide and Conquer Dynamic Programming Network Flows & Applications NP-completeness Now Linear Programming and the Simplex Method Hung Q. Ngo (SUNY at Buffalo) CSE 531 1
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 informationLecture 16 October 23, 2014
CS 224: Advanced Algorithms Fall 2014 Prof. Jelani Nelson Lecture 16 October 23, 2014 Scribe: Colin Lu 1 Overview In the last lecture we explored the simplex algorithm for solving linear programs. While
More informationIntroduction to Mathematical Programming IE496. Final Review. Dr. Ted Ralphs
Introduction to Mathematical Programming IE496 Final Review Dr. Ted Ralphs IE496 Final Review 1 Course Wrap-up: Chapter 2 In the introduction, we discussed the general framework of mathematical modeling
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 http://www.cs.fiu.edu/~giri/teach/cot6936_s12.html https://moodle.cis.fiu.edu/v2.1/course/view.php?id=174
More information/ Approximation Algorithms Lecturer: Michael Dinitz Topic: Linear Programming Date: 2/24/15 Scribe: Runze Tang
600.469 / 600.669 Approximation Algorithms Lecturer: Michael Dinitz Topic: Linear Programming Date: 2/24/15 Scribe: Runze Tang 9.1 Linear Programming Suppose we are trying to approximate a minimization
More informationAdvanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras
Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture 18 All-Integer Dual Algorithm We continue the discussion on the all integer
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 informationMA4254: Discrete Optimization. Defeng Sun. Department of Mathematics National University of Singapore Office: S Telephone:
MA4254: Discrete Optimization Defeng Sun Department of Mathematics National University of Singapore Office: S14-04-25 Telephone: 6516 3343 Aims/Objectives: Discrete optimization deals with problems of
More informationOutline. Column Generation: Cutting Stock A very applied method. Introduction to Column Generation. Given an LP problem
Column Generation: Cutting Stock A very applied method thst@man.dtu.dk Outline History The Simplex algorithm (re-visited) Column Generation as an extension of the Simplex algorithm A simple example! DTU-Management
More informationColumn Generation: Cutting Stock
Column Generation: Cutting Stock A very applied method thst@man.dtu.dk DTU-Management Technical University of Denmark 1 Outline History The Simplex algorithm (re-visited) Column Generation as an extension
More information6.854 Advanced Algorithms. Scribes: Jay Kumar Sundararajan. Duality
6.854 Advanced Algorithms Scribes: Jay Kumar Sundararajan Lecturer: David Karger Duality This lecture covers weak and strong duality, and also explains the rules for finding the dual of a linear program,
More informationInteger Programming Theory
Integer Programming Theory Laura Galli October 24, 2016 In the following we assume all functions are linear, hence we often drop the term linear. In discrete optimization, we seek to find a solution x
More informationMATLAB Solution of Linear Programming Problems
MATLAB Solution of Linear Programming Problems The simplex method is included in MATLAB using linprog function. All is needed is to have the problem expressed in the terms of MATLAB definitions. Appendix
More informationWorking Under Feasible Region Contraction Algorithm (FRCA) Solver Environment
Working Under Feasible Region Contraction Algorithm (FRCA) Solver Environment E. O. Effanga Department of Mathematics/Statistics and Comp. Science, University of Calabar P.M.B. 1115, Calabar, Cross River
More informationHigh performance computing and the simplex method
Julian Hall, Qi Huangfu and Edmund Smith School of Mathematics University of Edinburgh 12th April 2011 The simplex method for LP Not... Nonlinear programming... Integer programming... Stochastic programming......
More informationMATHEMATICS II: COLLECTION OF EXERCISES AND PROBLEMS
MATHEMATICS II: COLLECTION OF EXERCISES AND PROBLEMS GRADO EN A.D.E. GRADO EN ECONOMÍA GRADO EN F.Y.C. ACADEMIC YEAR 2011-12 INDEX UNIT 1.- AN INTRODUCCTION TO OPTIMIZATION 2 UNIT 2.- NONLINEAR PROGRAMMING
More informationA Subexponential Randomized Simplex Algorithm
s A Subexponential Randomized Gil Kalai (extended abstract) Shimrit Shtern Presentation for Polynomial time algorithms for linear programming 097328 Technion - Israel Institute of Technology May 14, 2012
More information3 INTEGER LINEAR PROGRAMMING
3 INTEGER LINEAR PROGRAMMING PROBLEM DEFINITION Integer linear programming problem (ILP) of the decision variables x 1,..,x n : (ILP) subject to minimize c x j j n j= 1 a ij x j x j 0 x j integer n j=
More information(67686) Mathematical Foundations of AI July 30, Lecture 11
(67686) Mathematical Foundations of AI July 30, 2008 Lecturer: Ariel D. Procaccia Lecture 11 Scribe: Michael Zuckerman and Na ama Zohary 1 Cooperative Games N = {1,...,n} is the set of players (agents).
More informationHeuristic Optimization Today: Linear Programming. Tobias Friedrich Chair for Algorithm Engineering Hasso Plattner Institute, Potsdam
Heuristic Optimization Today: Linear Programming Chair for Algorithm Engineering Hasso Plattner Institute, Potsdam Linear programming Let s first define it formally: A linear program is an optimization
More informationIdentical text Minor difference Moved in S&W Wrong in S&W Not copied from Wiki 1
Introduction The article Roadmap for Optimization (WIREs: Computational Statistics, Said and Wegman, 2009) purports to provide in broad brush strokes a perspective on the area in order to orient the reader
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 informationPOLYHEDRAL GEOMETRY. Convex functions and sets. Mathematical Programming Niels Lauritzen Recall that a subset C R n is convex if
POLYHEDRAL GEOMETRY Mathematical Programming Niels Lauritzen 7.9.2007 Convex functions and sets Recall that a subset C R n is convex if {λx + (1 λ)y 0 λ 1} C for every x, y C and 0 λ 1. A function f :
More informationLinear programming and duality theory
Linear programming and duality theory Complements of Operations Research Giovanni Righini Linear Programming (LP) A linear program is defined by linear constraints, a linear objective function. Its variables
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 information1. Introduction. Consider the linear programming (LP) problem in the standard. minimize subject to Ax = b, x 0,
A FAST SIMPLEX ALGORITHM FOR LINEAR PROGRAMMING PING-QI PAN Abstract. Recently, computational results demonstrated the superiority of a so-called largestdistance rule and nested pricing rule to other major
More informationLinear Programming. Course review MS-E2140. v. 1.1
Linear Programming MS-E2140 Course review v. 1.1 Course structure Modeling techniques Linear programming theory and the Simplex method Duality theory Dual Simplex algorithm and sensitivity analysis Integer
More informationLecture Notes 2: The Simplex Algorithm
Algorithmic Methods 25/10/2010 Lecture Notes 2: The Simplex Algorithm Professor: Yossi Azar Scribe:Kiril Solovey 1 Introduction In this lecture we will present the Simplex algorithm, finish some unresolved
More informationOnline algorithms for clustering problems
University of Szeged Department of Computer Algorithms and Artificial Intelligence Online algorithms for clustering problems Summary of the Ph.D. thesis by Gabriella Divéki Supervisor Dr. Csanád Imreh
More informationLARGE SCALE LINEAR AND INTEGER OPTIMIZATION: A UNIFIED APPROACH
LARGE SCALE LINEAR AND INTEGER OPTIMIZATION: A UNIFIED APPROACH Richard Kipp Martin Graduate School of Business University of Chicago % Kluwer Academic Publishers Boston/Dordrecht/London CONTENTS Preface
More informationPrimal Dual Schema Approach to the Labeling Problem with Applications to TSP
1 Primal Dual Schema Approach to the Labeling Problem with Applications to TSP Colin Brown, Simon Fraser University Instructor: Ramesh Krishnamurti The Metric Labeling Problem has many applications, especially
More informationCivil Engineering Systems Analysis Lecture XIV. Instructor: Prof. Naveen Eluru Department of Civil Engineering and Applied Mechanics
Civil Engineering Systems Analysis Lecture XIV Instructor: Prof. Naveen Eluru Department of Civil Engineering and Applied Mechanics Today s Learning Objectives Dual 2 Linear Programming Dual Problem 3
More informationParallel Auction Algorithm for Linear Assignment Problem
Parallel Auction Algorithm for Linear Assignment Problem Xin Jin 1 Introduction The (linear) assignment problem is one of classic combinatorial optimization problems, first appearing in the studies on
More information16.410/413 Principles of Autonomy and Decision Making
16.410/413 Principles of Autonomy and Decision Making Lecture 16: Mathematical Programming I Emilio Frazzoli Aeronautics and Astronautics Massachusetts Institute of Technology November 8, 2010 E. Frazzoli
More informationNotes for Lecture 18
U.C. Berkeley CS17: Intro to CS Theory Handout N18 Professor Luca Trevisan November 6, 21 Notes for Lecture 18 1 Algorithms for Linear Programming Linear programming was first solved by the simplex method
More informationOutline. Combinatorial Optimization 2. Finite Systems of Linear Inequalities. Finite Systems of Linear Inequalities. Theorem (Weyl s theorem :)
Outline Combinatorial Optimization 2 Rumen Andonov Irisa/Symbiose and University of Rennes 1 9 novembre 2009 Finite Systems of Linear Inequalities, variants of Farkas Lemma Duality theory in Linear Programming
More informationCOVERING POINTS WITH AXIS PARALLEL LINES. KAWSAR JAHAN Bachelor of Science, Bangladesh University of Professionals, 2009
COVERING POINTS WITH AXIS PARALLEL LINES KAWSAR JAHAN Bachelor of Science, Bangladesh University of Professionals, 2009 A Thesis Submitted to the School of Graduate Studies of the University of Lethbridge
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 informationPart 4. Decomposition Algorithms Dantzig-Wolf Decomposition Algorithm
In the name of God Part 4. 4.1. Dantzig-Wolf Decomposition Algorithm Spring 2010 Instructor: Dr. Masoud Yaghini Introduction Introduction Real world linear programs having thousands of rows and columns.
More informationThe Simplex Algorithm
The Simplex Algorithm Uri Feige November 2011 1 The simplex algorithm The simplex algorithm was designed by Danzig in 1947. This write-up presents the main ideas involved. It is a slight update (mostly
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 informationIDENTIFICATION AND ELIMINATION OF INTERIOR POINTS FOR THE MINIMUM ENCLOSING BALL PROBLEM
IDENTIFICATION AND ELIMINATION OF INTERIOR POINTS FOR THE MINIMUM ENCLOSING BALL PROBLEM S. DAMLA AHIPAŞAOĞLU AND E. ALPER Yıldırım Abstract. Given A := {a 1,..., a m } R n, we consider the problem of
More informationTowards a practical simplex method for second order cone programming
Towards a practical simplex method for second order cone programming Kartik Krishnan Department of Computing and Software McMaster University Joint work with Gábor Pataki (UNC), Neha Gupta (IIT Delhi),
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 informationAlgorithms for Integer Programming
Algorithms for Integer Programming Laura Galli November 9, 2016 Unlike linear programming problems, integer programming problems are very difficult to solve. In fact, no efficient general algorithm is
More informationCivil Engineering Systems Analysis Lecture XV. Instructor: Prof. Naveen Eluru Department of Civil Engineering and Applied Mechanics
Civil Engineering Systems Analysis Lecture XV Instructor: Prof. Naveen Eluru Department of Civil Engineering and Applied Mechanics Today s Learning Objectives Sensitivity Analysis Dual Simplex Method 2
More informationOn Covering a Graph Optimally with Induced Subgraphs
On Covering a Graph Optimally with Induced Subgraphs Shripad Thite April 1, 006 Abstract We consider the problem of covering a graph with a given number of induced subgraphs so that the maximum number
More informationAdvanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras
Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture 16 Cutting Plane Algorithm We shall continue the discussion on integer programming,
More informationRules for Identifying the Initial Design Points for Use in the Quick Convergent Inflow Algorithm
International Journal of Statistics and Probability; Vol. 5, No. 1; 2016 ISSN 1927-7032 E-ISSN 1927-7040 Published by Canadian Center of Science and Education Rules for Identifying the Initial Design for
More informationCSC 8301 Design & Analysis of Algorithms: Linear Programming
CSC 8301 Design & Analysis of Algorithms: Linear Programming Professor Henry Carter Fall 2016 Iterative Improvement Start with a feasible solution Improve some part of the solution Repeat until the solution
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 - 05 Lecture - 24 Solving LPs with mixed type of constraints In the
More informationPerformance evaluation of a family of criss-cross algorithms for linear programming
Intl. Trans. in Op. Res. 10 (2003) 53 64 Performance evaluation of a family of criss-cross algorithms for linear programming Tibérius Bonates and Nelson Maculan Universidade Federal do Rio de Janeiro,
More information