Solving linear programming problems exactly

DOI10.1016/0096-3003(95)00309-6MaRDI QIDQ1354256zbMATH OpenOpenAlexFDO

Authors A. K. Maulloo, V. Lakshmikantham, Syamal K. Sen, Seenith Sivasundaram

Publication date 5 May 1997

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0096-3003(95)00309-6

zbMATH Keywords

\(p\)-adic arithmeticlinear programming

Mathematics Subject Classification ID

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

Review text

This is a theoretical paper concerned with a technique for solving linear programming problems without incurring rounding errors. A method using \(p\)-adic arithmetic is proposed.

Recommendations

• Exact solutions to linear programming problems
• Solving linear programming problems via linear minimax problems
• scientific article; zbMATH DE number 16591
• scientific article; zbMATH DE number 3943551
• scientific article; zbMATH DE number 528888
• Exact solution to a parametric linear programming problem
• scientific article; zbMATH DE number 3867061
• Presolving in linear programming
• Solving possibilistic linear programming problems
• scientific article; zbMATH DE number 1168999

Cites work

• A new polynomial-time algorithm for linear programming
• An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
• An approach to nonlinear programming
• An Explicit Solution of a Special Class of Linear Programming Problems
• An inequality sorting algorithm for a class of linear programming problems
• Branch and Bound Methods for Mathematical Programming Systems
• Computing a matrix symmetrizer exactly using modified multiple modulus residue arithmetic
• Error-free matrix symmetrizers and equivalent symmetric matrices
• scientific article; zbMATH DE number 3644821 (Why is no real title available?)
• scientific article; zbMATH DE number 3124334 (Why is no real title available?)
• scientific article; zbMATH DE number 3167495 (Why is no real title available?)
• scientific article; zbMATH DE number 3874496 (Why is no real title available?)
• scientific article; zbMATH DE number 4145233 (Why is no real title available?)
• scientific article; zbMATH DE number 3713095 (Why is no real title available?)
• scientific article; zbMATH DE number 3373921 (Why is no real title available?)
• Optimal iterative schemes for computing the Moore-Penrose matrix inverse
• The Pseudoinverse of a Rectangular or Singular Matrix and Its Application to the Solution of Systems of Linear Equations

Cited in

(12)

• \(O(n^ 3)\) noniterative heuristic algorithm for linear programs with error-free implementation.
• Special issue: Lakshmikantham's legacy: a tribute on his 75th birthday
• A brief biography and survey of collected works of V. Lakshmikantham
• Solving linear optimization over arithmetic constraint formula
• A direct heuristic algorithm for linear programming
• Best \(k\)-digit rational bounds for irrational numbers: pre- and super-computer era
• 2ⁿ in scientific computation and beyond
• scientific article; zbMATH DE number 5811179 (Why is no real title available?)
• scientific article; zbMATH DE number 47963 (Why is no real title available?)
• Linear Programming Isn't Always the Answer
• Solving linear program as linear system in polynomial time
• Open problems in computational linear algebra

This page was built for publication: Solving linear programming problems exactly

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