Treffer: Some comments on a linear programming problem.

Besides the very known two exits of the Simplex Algorithm we consider two more cases when at least a solution exists and to decide whether or not the solution is unique. This situation occurred in a linear programming problem, on one hand applying the Simplex Algorithm and on the other hand using Matlab command linprog, that led to the case of unbounded solution set and its construc-tion. Some necessary conditions on data are given so that the set of solutions to be boundedless. [ABSTRACT FROM AUTHOR]

Copyright of Studia Universitatis Babeș-Bolyai, Mathematica is the property of Babes-Bolyai University, Cluj-Napoca, Romania and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)