A two-phase support method for solving linear programs: numerical experiments

DOI10.1155/2012/482193zbMath1264.90120OpenAlexW2002784966WikidataQ58911765 ScholiaQ58911765MaRDI QIDQ1954826

Mohand Bentobache, Mohand Ouamer Bibi

Publication date: 11 June 2013

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2012/482193

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Related Items

A successive linear approximation algorithm for the global minimization of a concave quadratic program ⋮ A two-phase support method for solving linear programs: numerical experiments ⋮ A hybrid direction algorithm for solving optimal control problems ⋮ A hybrid direction algorithm for solving linear programs

Uses Software

• LPAKO
• Matlab
• lp_solve
• CPLEX
• GLPK
• MINOS
• NETLIB LP Test Set
• LPbook

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An effective generalization of the direct support method
• New crash procedures for large systems of linear constraints
• A new polynomial-time algorithm for linear programming
• Direct and dual minimal feasible methods for solving a general linear programming problem
• A practical anti-cycling procedure for linearly constrained optimization
• Optimal feedback control
• An algorithm for solving quadratic programming problems with linear equality and inequality constraints.
• The long step rule in the bounded-variable dual simplex method: Numerical experiments
• An efficient simplex type algorithm for sparse and dense linear programs.
• A two-phase support method for solving linear programs: numerical experiments
• Mathematical Methods of Organizing and Planning Production
• Evolution of Linear Programming Computing Techniques
• Dual support method for solving convex quadratic programs
• A deficient-basis dual counterpart of Paparrizos, Samaras and Stephanides’ primal-dual simplex-type algorithm†
• Nonadjacent extreme point methods for solving linear programs
• A Simplified Procedure for Quadratic Programming
• Implementing the Simplex Method: The Initial Basis
• Strategies for Creating Advanced Bases for Large-Scale Linear Programming Problems
• LPAKO: A Simplex-based Linear Programming Program
• Updated triangular factors of the basis to maintain sparsity in the product form simplex method
• The Composite Simplex Algorithm
• The simplex method of linear programming using LU decomposition
• Support method for solving a linear-quadratic problem with polythedral with polyhedral constraints on control
• Linear programming. Foundations and extensions

This page was built for publication: A two-phase support method for solving linear programs: numerical experiments