The Composite Simplex Algorithm

Previous article Next article The Composite Simplex AlgorithmPhilip WolfePhilip Wolfehttps://doi.org/10.1137/1007004PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout1 Leola Cutler, H. Judd and , W. Orchard-Hays, Linear programming routine RSLPSI, Vol. #161, SHARE Distribution Agency, 1956 Google Scholar2 W. Orchard-Hays and , D. M. Smith, Linear programming routine IKLP90, Vol. #1195, SHARE Distribution Agency, 1962 Google Scholar3 Roy Harvey and , R. McKnight, Linear programming routine SCM3, SHARE Distribution Agency, 1963 Google Scholar4 Richard Clasen, Linear programming routine RSMFOR, Vol. #1379, SHARE Distribution Agency, 1962 Google Scholar5 G. B. Dantzig, Composite simplex-dual simplex algorithm, RM-1274-PR, The RAND Corporation, 1954 Google Scholar6 William Orchard-Hays, A composite simplex algorithm—II, RM-1275-PR, The RAND Corporation, 1954 Google Scholar7 A. W. Tucker, Simplex method and theory, RM-3199-PR, The RAND Corporation, 1962 0116.12402 Google Scholar8 Philip Wolfe and , Leola Cutler, R. L. Graves and , P. Wolfe, Experiments in linear programmingRecent advances in mathematical programming, McGraw-Hill, New York, 1963, 177–200, Proceedings of the 1962 Symposium MR0155682 (27:5616) 0223.90001 Google Scholar9 A. W. Tucker, A simple example of cycling in Dantzig's simplex algorithm, 1962, Unpublished Google Scholar10 Philip Wolfe, A technique for resolving degeneracy in linear programming, J. Soc. Indust. Appl. Math., 11 (1963), 205–211 10.1137/0111016 MR0153485 (27:3451) 0127.36903 LinkISIGoogle Scholar11 Philip Wolfe, An extended composite algorithm for linear programming, The RAND Corporation, 1961, 2373– Google Scholar Previous article Next article FiguresRelatedReferencesCited ByDetails IntroductionLinear Programming Computation | 10 October 2013 Cross Ref Integer Linear Programming (ILP)Linear Programming Computation | 10 October 2013 Cross Ref Pivot RuleLinear Programming Computation | 10 October 2013 Cross Ref Dual Pivot RuleLinear Programming Computation | 10 October 2013 Cross Ref Simplex Phase-I MethodLinear Programming Computation | 10 October 2013 Cross Ref Dual Simplex Phase-l MethodLinear Programming Computation | 10 October 2013 Cross Ref Reduced Simplex MethodLinear Programming Computation | 10 October 2013 Cross Ref Improved Reduced Simplex MethodLinear Programming Computation | 10 October 2013 Cross Ref D-Reduced Simplex MethodLinear Programming Computation | 10 October 2013 Cross Ref Criss-Cross Simplex MethodLinear Programming Computation | 10 October 2013 Cross Ref Generalizing Reduced Simplex MethodLinear Programming Computation | 10 October 2013 Cross Ref Geometry of the Feasible RegionLinear Programming Computation | 10 October 2013 Cross Ref Deficient-Basis MethodLinear Programming Computation | 10 October 2013 Cross Ref Dual Deficient-Basis MethodLinear Programming Computation | 10 October 2013 Cross Ref Face MethodLinear Programming Computation | 10 October 2013 Cross Ref Dual Face MethodLinear Programming Computation | 10 October 2013 Cross Ref Pivotal Interior-Point MethodLinear Programming Computation | 10 October 2013 Cross Ref Special TopicsLinear Programming Computation | 10 October 2013 Cross Ref Simplex MethodLinear Programming Computation | 10 October 2013 Cross Ref Duality Principle and Dual Simplex MethodLinear Programming Computation | 10 October 2013 Cross Ref Implementation of the Simplex MethodLinear Programming Computation | 10 October 2013 Cross Ref Sensitivity Analysis and Parametric LPLinear Programming Computation | 10 October 2013 Cross Ref Variants of the Simplex MethodLinear Programming Computation | 10 October 2013 Cross Ref Decomposition MethodLinear Programming Computation | 10 October 2013 Cross Ref Interior-Point MethodLinear Programming Computation | 10 October 2013 Cross Ref ReferencesPractical Methods of Optimization | 8 July 2013 Cross Ref A Two-Phase Support Method for Solving Linear Programs: Numerical ExperimentsMathematical Problems in Engineering, Vol. 2012 | 1 Jan 2012 Cross Ref BibliographyLinear Programming and Network Flows | 15 August 2011 Cross Ref An artificial variable RZ decision method for geometric superfluity of condition constraint in linear programming problem2010 IEEE International Conference on Intelligent Systems and Knowledge Engineering | 1 Nov 2010 Cross Ref Constrained and Unconstrained OptimizationComprehensive Chemometrics | 1 Jan 2009 Cross Ref Constrained and Unconstrained OptimizationComprehensive Chemometrics | 1 Jan 2009 Cross Ref Progress in the dual simplex method for large scale LP problems: practical dual phase 1 algorithmsComputational Optimization and Applications, Vol. 37, No. 1 | 14 March 2007 Cross Ref BibliographyMathematical Programming | 1 Jan 2006 Cross Ref A generalized dual phase-2 simplex algorithmEuropean Journal of Operational Research, Vol. 149, No. 1 | 1 Aug 2003 Cross Ref Advances in design and implementation of optimization softwareEuropean Journal of Operational Research, Vol. 140, No. 2 | 1 Jul 2002 Cross Ref LPAKO: A Simplex-based Linear Programming ProgramOptimization Methods and Software, Vol. 17, No. 4 | 1 Jan 2002 Cross Ref Fast Heuristics for the Maximum Feasible Subsystem ProblemINFORMS Journal on Computing, Vol. 13, No. 3 | 1 Aug 2001 Cross Ref Strategies for Creating Advanced Bases for Large-Scale Linear Programming ProblemsINFORMS Journal on Computing, Vol. 10, No. 2 | 1 May 1998 Cross Ref A Piecewise Linear Dual Procedure in Mixed Integer ProgrammingNew Trends in Mathematical Programming | 1 Jan 1998 Cross Ref Programação linear por partes: revisão teórica e aplicaçõesProduction, Vol. 6, No. 2 | 1 Dec 1996 Cross Ref An effective polynomial-time heuristic for the minimum-cardinality IIS set-covering problemAnnals of Mathematics and Artificial Intelligence, Vol. 17, No. 1 | 1 Mar 1996 Cross Ref A Variant of the Dual Pivoting Rule in Linear ProgrammingJournal of Information and Optimization Sciences, Vol. 15, No. 3 | 1 Sep 1994 Cross Ref Recovering an optimal LP basis from an interior point solutionOperations Research Letters, Vol. 15, No. 4 | 1 May 1994 Cross Ref MOPS — Mathematical optimization systemEuropean Journal of Operational Research, Vol. 72, No. 2 | 1 Jan 1994 Cross Ref Steepest-edge simplex algorithms for linear programmingMathematical Programming, Vol. 57, No. 1-3 | 1 May 1992 Cross Ref Auswahl von theoriebezogenen VeröffentlichungenOptimierung | 1 Jan 1992 Cross Ref An Implementation of Variable Upper Bounds via SUB MethodologyJournal of Information and Optimization Sciences, Vol. 13, No. 1 | 1 Jan 1992 Cross Ref Linear reactive power optimization in a large power network using the decomposition approachIEEE Transactions on Power Systems, Vol. 5, No. 2 | 1 May 1990 Cross Ref A practical anti-cycling procedure for linearly constrained optimizationMathematical Programming, Vol. 45, No. 1-3 | 1 Aug 1989 Cross Ref Degeneracy in the presence of roundoff errorsLinear Algebra and its Applications, Vol. 106 | 1 Aug 1988 Cross Ref An improved general Phase-I method in linear programmingEuropean Journal of Operational Research, Vol. 36, No. 1 | 1 Jul 1988 Cross Ref A simplex algorithm for piecewise-linear programming II: Finiteness, feasibility and degeneracyMathematical Programming, Vol. 41, No. 1-3 | 1 May 1988 Cross Ref Aspects of Bus Crew Scheduling Using a Set Partitioning ModelComputer-Aided Transit Scheduling | 1 Jan 1988 Cross Ref Piecewise-linear programming: The compact (CPLP) algorithmMathematical Programming, Vol. 36, No. 2 | 1 Jun 1986 Cross Ref A general Phase-I method in linear programmingEuropean Journal of Operational Research, Vol. 23, No. 1 | 1 Jan 1986 Cross Ref A simplex algorithm for piecewise-linear programming I: Derivation and proofMathematical Programming, Vol. 33, No. 2 | 1 Nov 1985 Cross Ref Solving staircase linear programs by the simplex method, 2: PricingMathematical Programming, Vol. 25, No. 3 | 1 Oct 1983 Cross Ref Nonadjacent extreme point methods for solving linear programsNaval Research Logistics Quarterly, Vol. 30, No. 1 | 1 Mar 1983 Cross Ref Penalty FunctionsMathematical Programming The State of the Art | 1 Jan 1983 Cross Ref An implementation of the simplex method for linear programming problems with variable upper boundsMathematical Programming, Vol. 23, No. 1 | 1 Dec 1982 Cross Ref An example of cycling in a feasible point algorithmMathematical Programming, Vol. 20, No. 1 | 1 Dec 1981 Cross Ref A step toward probabilistic analysis of simplex method convergenceMathematical Programming, Vol. 19, No. 1 | 1 Dec 1980 Cross Ref Constrained differential dynamic programming and its application to multireservoir controlWater Resources Research, Vol. 15, No. 5 | 9 July 2010 Cross Ref Nonextreme point solution strategies for linear programsNaval Research Logistics Quarterly, Vol. 26, No. 3 | 1 Sep 1979 Cross Ref On the Bartels—Golub decomposition for linear programming basesMathematical Programming, Vol. 13, No. 1 | 1 Dec 1977 Cross Ref Bottleneck linear programmingMathematical Programming, Vol. 11, No. 1 | 1 Dec 1976 Cross Ref Partially normalized pivot selection in linear programmingComputational Practice in Mathematical Programming | 23 February 2009 Cross Ref Volume 7, Issue 1| 1965SIAM Review History Submitted:01 April 1964Published online:01 August 2006 InformationCopyright © 1965 © Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/1007004Article page range:pp. 42-54ISSN (print):0036-1445ISSN (online):1095-7200Publisher:Society for Industrial and Applied Mathematics