Some comments on a linear programming problem

Marcel BOGDAN

doi:10.24193/subbmath.2018.2.10

Authors

Marcel BOGDAN “Petru Maior” University, Faculty of Sciences and Letters 1, N. Iorga Street, 540088 Tˆargu Mure¸s, Romania, e-mail: marcel.bogdan@science.upm.ro

DOI:

https://doi.org/10.24193/subbmath.2018.2.10

Keywords:

: Linear programming, simplex algorithm, multiple solutions.

Abstract

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 construction. Some necessary conditions on data are given so that the set of solutions to be boundedless.

Mathematics Subject Classification (2010): 90C05.

References

Breckner, E.B., De la poliedre la jocuri matriceale, Editura Funda¸tiei pentru Studii Europene, Cluj-Napoca, 2007.

Breckner, E.B., Popovici, N., Probleme de cercetare opera¸tionala˘, Editura Funda¸tiei pentru Studii Europene, Cluj-Napoca, 2006.

Breckner, W.W., Cercet˘ari opera¸tionale, curs litografiat, Cluj-Napoca, 1974.

Dantzig, G.B., Linear Programming and Extensions, Princeton University Press, 1963. [5] Dantzig, G.B., Linear Programming, Oper. Res., 50(2002), no. 1, 42-47.

Darvay, Zs., New Interior Point Algorithms in Linear Programming, Advanced Modeling and Optimization, 5(2003), no. 1, 51-92.

Griffin, C., Linear Programming: Penn State Math 484 Lecture Notes, 2009-2014, http://www.personal.psu.edu/cxg286/Math484−V 1.pdf

Robere, R., Interior Point Methods and Linear Programming, http://www.cs.toronto.edu/ robere/paper/interiorpoint.pdf

Roos, C., Terlaky, T., Vial, J.-Ph., Theory and Algorithms for Linear Optimization, Springer, New York, USA, 2005.

Wright, S.J., Primal-Dual Interior-Point Methods, SIAM, Philadelphia, USA, 1997. [11] Ye, Y., Interior Point Algorithms, Theory and Analysis, John Wiley & Sons, Chichester, UK, 1997.

Excel, http://www.solver.com/excel-solver-linear-programming

Matlab, http://www.mathworks.com/help/optim/ug/linprog.html

Octave, http://www.obihiro.ac.jp/ suzukim/masuda/octave/html3/octave−125.html [15] Octave, http://octave-online.net/