Jump to ContentJump to Main Navigation
Show Summary Details
More options …

Open Mathematics

formerly Central European Journal of Mathematics

Editor-in-Chief: Gianazza, Ugo / Vespri, Vincenzo

1 Issue per year

IMPACT FACTOR 2017: 0.831
5-year IMPACT FACTOR: 0.836

CiteScore 2017: 0.68

SCImago Journal Rank (SJR) 2017: 0.450
Source Normalized Impact per Paper (SNIP) 2017: 0.829

Mathematical Citation Quotient (MCQ) 2017: 0.32

Open Access
See all formats and pricing
More options …
Volume 3, Issue 2


Volume 13 (2015)

Exact and stable least squares solution to the linear programming problem

Evald Übi
Published Online: 2005-06-01 | DOI: https://doi.org/10.2478/BF02479198


A linear programming problem is transformed to the finding an element of polyhedron with the minimal norm. According to A. Cline [6], the problem is equivalent to the least squares problem on positive ortant. An orthogonal method for solving the problem is used. This method was presented earlier by the author and it is based on the highly developed least squares technique. First of all, the method is meant for solving unstable and degenerate problems. A new version of the artifical basis method (M-method) is presented. Also, the solving of linear inequality systems is considered.

Keywords: Linear programming; method of least squares; M-method

Keywords: 90C05; 65K05

  • [1] E. Übi: “An Approximate Solution to Linear and Quadratic Programming Problems by the Method of least squares”, Proc. Estonian Acad. Sci. Phys. Math., Vol. 47, (1998), pp. 19–28. Google Scholar

  • [2] E. Übi: “On Computing a Stable Least Squares Solution to the Linear Programming Problem”, Proc. Estonian Acad. Sci. Phys. Math., Vol 47, (1998), pp. 251–259. Google Scholar

  • [3] E. Übi: “Finding Non-negative Solution of Overdetermined or Underdetermined System of Linear Equations by Method of Least Squares”, Trans. Tallinn Tech. Univ., Vol. 738, (1994), pp. 61–68. Google Scholar

  • [4] R. Cline and R. Plemmons: l 2—solutions to Underdetermined Linear Systems SIAM Review, Vol. 10, (1976), pp. 92–105. http://dx.doi.org/10.1137/1018004Google Scholar

  • [5] A. Cline: “An Elimination Method for the Solution of Linear Least Squares Problems”, SIAM J. Numer. Anal., Vol. 10, (1973), pp. 283–289. http://dx.doi.org/10.1137/0710027Google Scholar

  • [6] C. Lawson and R. Hanson: Solving Least Squares Problems, Prentice-Hall, New-Jersey, 1974. Google Scholar

  • [7] B. Poljak: Vvedenie v optimizatsiyu, Nauka, Moscow, 1983. Google Scholar

  • [8] T. Hu: Integer programming and Network flows, Addison-Wesley Publishing Company, Massachusetts, 1970. Google Scholar

About the article

Published Online: 2005-06-01

Published in Print: 2005-06-01

Citation Information: Open Mathematics, Volume 3, Issue 2, Pages 228–241, ISSN (Online) 2391-5455, DOI: https://doi.org/10.2478/BF02479198.

Export Citation

© 2005 Versita Warsaw. This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License. BY-NC-ND 3.0

Citing Articles

Here you can find all Crossref-listed publications in which this article is cited. If you would like to receive automatic email messages as soon as this article is cited in other publications, simply activate the “Citation Alert” on the top of this page.

E. Übi
Central European Journal of Mathematics, 2008, Volume 6, Number 1, Page 171
Evald Übi
Central European Journal of Mathematics, 2007, Volume 5, Number 2, Page 373

Comments (0)

Please log in or register to comment.
Log in