Erratum to the paper Bogdan, M., "Some comments on a linear programming problem"
DOI:
https://doi.org/10.24193/subbmath.2022.3.17Keywords:
linear programming, pivoting algorithm, simplex algorithm, multiple optimal solutionsAbstract
The present paper corrects an assertion of the author from\cite{Bogdan1}. The pivoting algorithms referred to, search for
solving the linear programming problem.
References
bibitem{Bogdan1} Bogdan, M., emph{Some comments on a linear programming problem}, Stud. Univ. Babec s-Bolyai Math., textbf{63}(2018),
no. 2, 269-284.
bibitem{Dantzig2} Dantzig, G.B., emph{Linear Programming}, Oper. Res.,
textbf{50}(2002), no. 1, 42-47.
bibitem{oo} Octave, http://octave-online.net/
bibitem{XSL} Xiaode, Z., Shengjia, X., Lei, L., emph{A way to find all
the optimal solutions in linear programming}, J. of Systems
Engineering and Electronics, textbf{11}(2000), no. 2, 11-16.
bibitem{WA} WolframAlpha, https://www.wolframalpha.com/
Downloads
Additional Files
Published
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Transfer of copyright agreement: When the article is accepted for publication, the authors and the representative of the coauthors, hereby agree to transfer to Studia Universitatis Babeș-Bolyai Mathematica all rights, including those pertaining to electronic forms and transmissions, under existing copyright laws, except for the following, which the authors specifically retain: the authors can use the material however they want as long as it fits the NC ND terms of the license. The authors have all rights for reuse according to the license.
