Skip to main content
Log in

Mathematical programming via the least-squares method

Central European Journal of Mathematics

Abstract

The least-squares method is used to obtain a stable algorithm for a system of linear inequalities as well as linear and nonlinear programming. For these problems the solution with minimal norm for a system of linear inequalities is found by solving the non-negative least-squares (NNLS) problem. Approximate and exact solutions of these problems are discussed. Attention is mainly paid to finding the initial solution to an LP problem. For this purpose an NNLS problem is formulated, enabling finding the initial solution to the primal or dual problem, which may turn out to be optimal. The presented methods are primarily suitable for ill-conditioned and degenerate problems, as well as for LP problems for which the initial solution is not known. The algorithms are illustrated using some test problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Barnes E., Chen V., Gopalakrishnan B., Johnson E.L., A least-squares primal-dual algorithm for solving linear programming problems, Oper. Res. Lett., 2002, 30(5), 289–294

    Article  MATH  MathSciNet  Google Scholar 

  2. Bixby R.E., Implementing the simplex method: The initial basis, ORSA J. Comput., 1992, 4(3), 267–284

    MATH  MathSciNet  Google Scholar 

  3. Dantzig G.B., Orden A., Wolfe P., The generalized simplex method for minimizing a linear form under linear inequality restraints, Pacific J. Math., 1955, 5, 183–195

    MATH  MathSciNet  Google Scholar 

  4. Gale D., How to solve linear inequalities, Amer. Math. Monthly, 1969, 76(6), 589–599

    Article  MATH  MathSciNet  Google Scholar 

  5. Gill P.E., Murray W., Wright M.H., Practical Optimization, Academic Press, London, 1981

    MATH  Google Scholar 

  6. Lawson C.L., Hanson R.J., Solving Least Squares Problems, Classics in Applied Mathematics, 15, SIAM, Philadelphia, 1995

    Google Scholar 

  7. Leichner S.A., Dantzig G. B., Davis J.W., A strictly improving linear programming Phase I algorithm, Ann. Oper. Res., 1993, 46–47(2), 409–430

    Article  MathSciNet  Google Scholar 

  8. Netlib LP Test Problem Set, available at www.numerical.rl.ac.uk/cute/netlib.html

  9. Kong S., Linear Programming Algorithms Using Least-Squares Method, Ph.D. thesis, Georgia Institute of Technology, Atlanta, USA, 2007

    Google Scholar 

  10. Übi E., Least squares method in mathematical programming, Proc. Estonian Acad. Sci. Phys. Math., 1989, 38(4), 423–432, (in Russian)

    MATH  Google Scholar 

  11. Übi E., An approximate solution to linear and quadratic programming problems by the method of least squares, Proc. Estonian Acad. Sci. Phys. Math., 1998, 47(4), 19–28

    MATH  MathSciNet  Google Scholar 

  12. Übi E., On computing a stable least squares solution to the linear programming problem, Proc. Estonian Acad. Sci. Phys. Math., 1998, 47(4), 251–259

    MATH  MathSciNet  Google Scholar 

  13. Übi E., Application of orthogonal transformations in the revised simplex method, Proc. Estonian Acad. Sci. Phys. Math., 2001, 50(1), 34–41

    MATH  MathSciNet  Google Scholar 

  14. Übi E., On stable least squares solution to the system of linear inequalities, Cent. Eur. J. Math., 2007, 5(2), 373–385

    Article  MATH  MathSciNet  Google Scholar 

  15. Übi E., A numerically stable least squares solution to the quadratic programming problem, Cent. Eur. J. Math., 2008, 6(1), 171–178

    Article  MATH  MathSciNet  Google Scholar 

  16. Zoutendijk G., Mathematical Programming Methods, North Holland, Amsterdam-New York-Oxford, 1976

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Evald Übi.

About this article

Cite this article

Übi, E. Mathematical programming via the least-squares method. centr.eur.j.math. 8, 795–806 (2010). https://doi.org/10.2478/s11533-010-0049-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.2478/s11533-010-0049-9

MSC

Keywords

Navigation