On the generalized Wolf problem: preprocessing of nonnegative large-scale linear programming problems with group constraints. (English. Russian original) Zbl 1143.93303
Autom. Remote Control 68, No. 8, 1401-1409 (2007); translation from Avtom. Telemekh. 2007, No. 8, 116-125 (2007).
Summary: Nonnegative large-scale linear programming problems with group constraints are extremely important for different applications in economics, technology, and other spheres. In this paper, we describe a new approach to preprocessing of these problems to reduce their dimensions considerably by defining and removing redundant constraints and variables.
Software:
QPReferences:
| [1] | Ioslovich, I.V. and Makarenkov, Yu.M., On Methods for Dimension Reduction of Linear Programming Problems, Ekonom. Mat. Metody, 1975, vol. 11, no. 3, pp. 316–324. |
| [2] | Ioslovich, I., Robust Reduction of a Class of Large-Scale Linear Programs, SIAM J. Optim., 2001, vol. 12, no. 1, pp. 262–282. · Zbl 0992.90046 · doi:10.1137/S1052623497325454 |
| [3] | Dantzig, G.B., Linear Programming and Extensions, Princeton: Princeton Univ. Press, 1963. · Zbl 0108.33103 |
| [4] | Gill, Ph.E., Murray, W., and Wright, M.H., Numerical Linear Algebra and Optimization, Redwood City: Addison-Wesley, 1991. · Zbl 0714.65063 |
| [5] | Adler, I., Resende, G.C., Veiga, G., and Karmarkar, N., An Implementation of Karmarkar’s Algorithm for Linear Programming, Math. Program., Ser. A, 1989, vol. 44, no. 3, pp. 297–335. · Zbl 0682.90061 · doi:10.1007/BF01587095 |
| [6] | Bradley, G.H., Brown, G.G., and Graves, G.W., Structural Redundancy in Large-Scale Optimization Models, Karwan, M.H. et al., Eds., in Redundancy in Mathematical Programming, Heidelberg: Springer-Verlag, 1983, pp. 145–169. |
| [7] | Tomlin, J.A. and Welch, J.S., Formal Optimization of Some Reduced Linear Programming Problems, Math. Program., 1983, vol. 27, no. 2, pp. 232–240. · Zbl 0535.90059 · doi:10.1007/BF02591947 |
| [8] | Karwan, M.H., Lofti, F., Telgen, J., and Zionts, S., Redundancy in Mathematical Programming, Berlin: Springer-Verlag, 1983. |
| [9] | Fourer, R. and Gay, D.M., Experience with a Primal Presolve Algorithm, in Large Scale Optimization: State of the Art, Hager, W.W., Hearn, D.W., and Pardalos, P.M., Eds., Dordrecht: Academic, 1994, pp. 135–154. · Zbl 0816.90101 |
| [10] | Gould, N. and Toint, P.L., Preprocessing for Quadratic Programming, Math. Program., Ser. B, 2004, vol. 100, no. 1, pp. 95–132. · Zbl 1146.90491 |
| [11] | Cormen, T.H., Leiserson, R.L., and Rivest, R.L., Introduction to Algorithms, Cambridge: MIT Press, 2001. · Zbl 1047.68161 |
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
