zbMATH — the first resource for mathematics

Generation of degenerate linear programming problems. (English) Zbl 1146.90038
Summary: We present a method for constructing linear programming problems with randomly generated data. Besides the number of variables and constraints, the dimensions of the primal and dual faces are given. We show that, for problems in which the constraint matrix is carelessly constructed with random entries, with probability one only one between primal degeneracy and dual degeneracy appears.

90C05 Linear programming
Full Text: DOI
[1] Goldman, A.J., Tucker, A.W.: Theory of linear programming. In: Kuhn, H.W., Tucker, A.W. (eds.) Linear Inequalities and Related Systems. Annals of Mathematical Studies, vol. 38, pp. 53–97. Princeton University Press, Princeton (1956) · Zbl 0072.37601
[2] Gonzaga, C.C.: Path-following methods for linear programming. SIAM Rev. 34(2), 167–224 (1992) · Zbl 0763.90063
[3] Gonzaga, C.C.: www.mtm.ufsc.br/\(\sim\)clovis/genlp.html
[4] Roos, C., Terlaky, T., Vial, J.P.: Theory and Algorithms for Linear Optimization: an Interior Point Approach. Wiley, Chichester (1997) · Zbl 0954.65041
[5] Wright, S.: Primal–Dual Interior-Point Methods. SIAM, Philadelphia (1997) · Zbl 0863.65031
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.