A two-phase support method for solving linear programs: numerical experiments
type: Item
instance of: scholarly article
title: A two-phase support method for solving linear programs: numerical experiments
zbMATH Open document ID: 1264.90120
DOI: 10.1155/2012/482193
author: Mohand Bentobache
author: Mohand Ouamer Bibi
published in: Mathematical Problems in Engineering
publication date: 2013-06-11T00:00:00Z
review text: Summary: We develop a single artificial variable technique to initialize the primal support method for solving linear programs with bounded variables. We first recall the full artificial basis technique, then we will present the proposed algorithm. In order to study the performances of the suggested algorithm, an implementation under the MATLAB programming language has been developed. Finally, we carry out an experimental study about CPU time and iterations number on a large set of the NETLIB test problems. These test problems are practical linear programs modelling various real-life problems arising from several fields such as oil refinery, audit staff scheduling, airline scheduling, industrial production and allocation, image restoration, multisector economic planning, and data fitting. It has been shown that our approach is competitive with our implementation of the primal simplex method and the primal simplex algorithm implemented in the known open-source LP solver LP\_SOLVE.
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 6173319
describes a project that uses: GLPK
describes a project that uses: NETLIB LP Test Set
describes a project that uses: LPbook
describes a project that uses: Matlab
describes a project that uses: MINOS
describes a project that uses: LPAKO
describes a project that uses: lp_solve
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2012/482193
OpenAlex ID: W2002784966
Wikidata QID: Q58911765
cites work: Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
cites work: Q5808752
cites work: Q3844775
cites work: Q4051879
cites work: Direct and dual minimal feasible methods for solving a general linear programming problem
cites work: An effective generalization of the direct support method
cites work: Optimal feedback control
cites work: Q3025770
cites work: Q4187575
cites work: Q3703580
cites work: An algorithm for solving quadratic programming problems with linear equality and inequality constraints.
cites work: The long step rule in the bounded-variable dual simplex method: Numerical experiments
cites work: Support method for solving a linear-quadratic problem with polythedral with polyhedral constraints on control
cites work: Dual support method for solving convex quadratic programs
cites work: A new polynomial-time algorithm for linear programming
cites work: A Simplified Procedure for Quadratic Programming
cites work: The Composite Simplex Algorithm
cites work: Implementing the Simplex Method: The Initial Basis
cites work: New crash procedures for large systems of linear constraints
cites work: Strategies for Creating Advanced Bases for Large-Scale Linear Programming Problems
cites work: Evolution of linear programming computing techniques
cites work: LPAKO: A Simplex-based Linear Programming Program
cites work: Nonadjacent extreme point methods for solving linear programs
cites work: Linear programming. Foundations and extensions
cites work: A deficient-basis dual counterpart of Paparrizos, Samaras and Stephanides’ primal-dual simplex-type algorithm†
cites work: The simplex method of linear programming using LU decomposition
cites work: A practical anti-cycling procedure for linearly constrained optimization
cites work: An efficient simplex type algorithm for sparse and dense linear programs.
cites work: Updated triangular factors of the basis to maintain sparsity in the product form simplex method
description: scientific article; zbMATH DE number 6173319