Solving multiscale linear programs using the simplex method in quadruple precision

DOI10.1007/978-3-319-17689-5_9MaRDI QIDQ3462312zbMATH OpenOpenAlexFDO

Authors Ding Ma, Michael A. Saunders

Publication date 5 January 2016

Published in Numerical Analysis and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-17689-5_9

zbMATH Keywords

numerical examplessimplex methodflux balance analysisMINOSquadruple precisiongfortran libquadmathmacromolecular expressionmetabolic expression modelmultiscale linear program

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Computational methods for problems pertaining to biology (92-08) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Recommendations

• Exact solutions to linear programming problems
• A numerically exact implementation of the simplex method
• Publication:3479462
• scientific article; zbMATH DE number 1303552
• scientific article; zbMATH DE number 3852786

Cites work

• A practical anti-cycling procedure for linearly constrained optimization
• A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints
• Exact solutions to linear programming problems
• Large-scale linearly constrained optimization
• Maintaining LU factors of a general sparse matrix
• On Wolfe's method for resolving degeneracy in linearly constrained optimization
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• Steepest-edge simplex algorithms for linear programming
• The final NETLIB-LP results
• The simplest examples where the simplex method cycles and conditions where EXPAND fails to prevent cycling

Cited in

(4)

• A regularization method for constrained nonlinear least squares
• A new analysis of iterative refinement and its application to accurate solution of ill-conditioned sparse linear systems
• Solving quadratic programs to high precision using scaled iterative refinement
• Design and implementation of a modular interior-point solver for linear optimization

Describes a project that uses

Uses Software

• libquadmath
• LUSOL
• NETLIB LP Test Set
• XPRESS
• QSopt_ex
• Mosek
• TOMLAB
• Gurobi
• CPLEX
• SoPlex
• OPERA
• NLPLIB
• SNOPT

This page was built for publication: Solving multiscale linear programs using the simplex method in quadruple precision

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3462312)