| Автор | Arsham, H. |
| Автор | Oblak, M. |
| Дата выпуска | 1995 |
| dc.description | The family of network optimization problems includes the following prototype models: assignment, critical path, max flow, shortest path, and transportation. Although it is long known that these problems can be modeled as linear programs (LP), this is generally not done. Due to the relative inefficiency and complexity of the simplex methods (primal, dual, and other variations) for network models, these problems are usually treated by one of over 100 specialized algorithms. This leads to several difficulties. The solution algorithms are not unified and each algorithm uses a different strategy to exploit the special structure of a specific problem. Furthermore, small variations in the problem, such as the introduction of side constraints, destroys the special structure and requires modifying andjor restarting the algorithm. Also, these algorithms obtain solution efficiency at the expense of managerial insight, as the final solutions from these algorithms do not have sufficient information to perform postoptimality analysis.Another approach is to adapt the simplex to network optimization problems through network simplex. This provides unification of the various problems but maintains all the inefficiencies of simplex, as well as, most of the network inflexibility to handle changes such as side constraints. Even ordinary sensitivity analysis (OSA), long available in the tabular simplex, has been only recently transferred to network simplex.This paper provides a single unified algorithm for all five network models. The proposed solution algorithm is a variant of the self-dual simplex with a warm start. This algorithm makes available the full power of LP perturbation analysis (PA) extended to handle optimal degeneracy. In contrast to OSA, the proposed PA provides ranges for which the current optimal strategy remains optimal, for simultaneous dependent or independent changes from the nominal values in costs, arc capacities, or suppliesJdemands. The proposed solution algorithm also facilitates incorporation of network structural changes and side constraints. It has the advantage of being computationally practical, easy for managers to understand and use, and provides useful PA information in all cases. Computer implementation issues are discussed and illustrative numerical examples are provided in the Appendix |
| Формат | application.pdf |
| Издатель | Gordon and Breach Science Publishers |
| Копирайт | Copyright Taylor and Francis Group, LLC |
| Тема | Linear network optimization |
| Тема | Assignment problem |
| Тема | Critical path |
| Тема | Max flow |
| Тема | Min flow |
| Тема | Shortest path |
| Тема | Transportation problem |
| Тема | Perturbation analysis |
| Тема | Sensitivity analysis |
| Тема | Parametric sensitivity analysis |
| Тема | Tolerance analysis |
| Тема | The 100% rule |
| Тема | Linear program |
| Тема | Self-dual simplex |
| Тема | More-for-less paradox |
| Тема | Degeneracy |
| Тема | Redundancy |
| Название | A comprehensive simplex-like algorithm for network optimization and perturbation analysis |
| Тип | research-article |
| DOI | 10.1080/02331939508844049 |
| Electronic ISSN | 1029-4945 |
| Print ISSN | 0233-1934 |
| Журнал | Optimization |
| Том | 32 |
| Первая страница | 211 |
| Последняя страница | 267 |
| Аффилиация | Arsham, H.; Information and Quantitatice Sciences, Uniuersity of Baltimore |
| Аффилиация | Oblak, M.; Information and Quantitatice Sciences, Uniuersity of Baltimore |
| Выпуск | 3 |
| Библиографическая ссылка | Adlakha, V., Gladysz, B. and Kamburowski, J. 1991. Minimum flow in (s,t) planar networks. Networks, 21: 767–773. |
| Библиографическая ссылка | Aggarwal, V. 1985. A Lagrangian-relaxation method for the constrained assignment problem. Computers & Operations Research, 12: 97–106. |
| Библиографическая ссылка | Ahuja, R., Magnanti, T. and Orlin, J. 1993. Network Flows: Theory, Algorithms, and Applications, Engelwood Cliffs, New Jersey: Prentice-Hall. |
| Библиографическая ссылка | Ahuja, R., Magnanti, T. and Orlin, J. 1991. Some recent advances in network flows. SIAM Review, 33: 175–219. |
| Библиографическая ссылка | Ahuja, R., Mehlhorn, K., Orlin, J. and Tarjan, R. 1990. Faster algorithms for the shortest path Problem. Journal of ACM, 37: 213–223. |
| Библиографическая ссылка | Ahuja, R. and Orlin, J. 1991. A fast and simple algorithm for the maximum flow problem. Operations Research, 37: 748–759. |
| Библиографическая ссылка | Ahuja, R. and Orlin, J. 1992. The scaling network simplex algorithm. Operations Research, 40(1): S5–S13. |
| Библиографическая ссылка | Ali, A., Allen, P., Barr, R. and Kennington, J. 1986. Reoptimization procedures for bounded variable primal simplex network algorithms. European Journal of Operational Research, 23(1): 256–263. |
| Библиографическая ссылка | Ali, A., Padman, R. and Thiagarajan, R. 1989. Dual algorithms for pure network problem. Operations Research, 37(1): 159–171. |
| Библиографическая ссылка | Anderson, D., Sweeny, D. and Williams, T. 1994. An Introduction to Management Science, St.Paul, MA: West Publishing Co. |
| Библиографическая ссылка | Arsham, H. 1994. The Gauss-Jordan matrix inversion is not optimal: A symbolic adaptation. In the Proceedings of the Fifth SIAM Conf. on. Applied Linear Algebra. 1994. pp.528–532. |
| Библиографическая ссылка | Arsham, H. 1994. A solution algorithm with sensitivity analysis for optimal matchings and related problems. Congressus Numerantium, 100: 1–40. |
| Библиографическая ссылка | Arsham, H. 1993. A solution algorithm for the shortest path problem with application to communication networks design and operation. In the Proceedings of the ISMM Conf: Comput. Appls. in Design, Simul. and Analysis. 1993. pp.81–84. |
| Библиографическая ссылка | Arsham, H. 1993. Managing project activity-duration uncertainties. Omega, 21: 111–122. |
| Библиографическая ссылка | Arsham, H. 1992. Postoptimality analyses of the transportation problem. Journal of the Operational Research Society, 43: 121–139. |
| Библиографическая ссылка | Arsham, H. 1989. A tabular simplex-type algorithm as a teaching aid for general LP models. Mathematical and Computer Modelling, 12: 1051–1056. |
| Библиографическая ссылка | Arsham, H., Davani, D. and Yu, J. 1993. A linear symbolic-based approach to matrix inversion. Mathematics and Computers in Simulation, 35: 493–500. |
| Библиографическая ссылка | Arsham, H. and Kahn, A. 1990. A complete solution algorithm for linear fractional programs. Computers & Mathematics with Applications, 20: 11–23. |
| Библиографическая ссылка | Arsham, H. and Kahn, A. 1989. A refined simplex algorithm for the classical transportation problem with application to parametric sensitivity analysis. Mathematical and Computer Modelling, 12: 1035–1044. |
| Библиографическая ссылка | Arsham, H. and Kahn, A. 1989. A simplex-type algorithm for general transportation problem: An alternative to stepping stone. Journal of the Operational Research Society, 40: 581–590. |
| Библиографическая ссылка | Arsham, H. and Oblak, M. 1990. Perturbation analysis of general LP models: A unified approach to sensitivity, parametric tolerance, and more-for-less analysis. Mathematical and Computer Modelling, 12: 1437–1446. |
| Библиографическая ссылка | Arsham, H. and Yu, J. 1993. “A detailed description of a prototype DSS for regional planning and control of labs’ inspection”. In Commission of Ofice Laboratory Accreditation, Zürich: The usaional Congress of Mathematicans. Silver Spring, MD. Abstracted in the Short Communications of The ICM 94 |
| Библиографическая ссылка | Bako, A. 1973. On the determination of the shortest path in a network having gains. Optimization, 4: 63–68. |
| Библиографическая ссылка | Barr, R., Glover, F. and Klingman, D. 1974. An improved version of the out-of-kilter method and a comparative study of computer codes. Mathematical Programming, 7: 60–86. |
| Библиографическая ссылка | Barr, r., Glover, F. and Klingman, D. 1974. The alternating basis algorithm for assignment problems. Mathematical Programming, 13: 1–13. |
| Библиографическая ссылка | Barr, R. and Hickman, B. 1994. Parallel simplex for large pure network problems: Computational testing and sources of speedup. Operations Research, 42: 65–80. |
| Библиографическая ссылка | Baybars, I. and Kortanek, K. 1984. Transmission facility planning in telecommunication networks: A heuristic approach. European Journal of Operational Research, 16: 59–83. |
| Библиографическая ссылка | Bazaraa, M., Jarvis, J. and Sherali, H. 1990. Linear Programming and Network Flow, New York: Wiley. |
| Библиографическая ссылка | Bryson, N. 1989. Parametric programming and Lagrangian relaxation: The case of the network problem with a single side-constraint. Computers & Operations Research, 18: 130–141. |
| Библиографическая ссылка | Belling-Seib, K., Mevert, P. and Muller, C. 1988. Network flow problems with side constraint: A comparison of three solution methods. Computers & Operations Research, 15: 381–394. |
| Библиографическая ссылка | Bertsekas, D. 1992. Auction algorithm for network problems: A tutorial introduction. Computational Optimization and Applications, 1: 7–66. |
| Библиографическая ссылка | Bertsekas, D. 1991. Linear Network Optimization: Algorithms and Codes, Cambridge, MA: The MIT Press. |
| Библиографическая ссылка | Bertsekas, D. and Gallager, R. 1992. Data Networks, Englewood Cliffs, NJ: Prentice-Hall. |
| Библиографическая ссылка | Bixby, R. 1992. Implementing the simplex method: The initial basis. ORSA Journal of Computing, 4: 267–282. |
| Библиографическая ссылка | Bland, R. and Jensen, D. 1992. On the computational behavior of a polynomial-time network flow algorithm. Mathematical Programming, 54: 1–39. |
| Библиографическая ссылка | Bradley, S., Hax, A. and Magnanti, T. 1977. Applied Mathematics Programming, Reading, Mass: Addison-Wesley. |
| Библиографическая ссылка | Brameller, A. 1985. “Sparsity in transportation problems”. In in Sparsity and its Applications, Edited by: Evans, D. Cambridge: Cambridge University Press. |
| Библиографическая ссылка | Brown, G. and McBride, R. 1984. Solving generalized networks. Management Science, 30: 1497–1523. |
| Библиографическая ссылка | Camm, J. and Burwell, T. 1991. Sensitivity analysis in linear programming model with common input. Decision Sciences, 22: 512–518. |
| Библиографическая ссылка | Caamm, J., Raturi, A. and Tsubakitani, S. 1990. Cutting big M down to sizes. Interfaces, 20: 61–66. |
| Библиографическая ссылка | Carstensen, P. 1983. Complexity of some parametric integer and network programming problems. Mathematical Programming, 26: 64–75. |
| Библиографическая ссылка | Chandy, K. and Misra, J. 1982. Distributed computation on graph: Shortest path algorithms. Communications of ACM, 25: 833–837. |
| Библиографическая ссылка | Chang, Y. and Sullivan, R. 1986. QSB: Quantitative Systems for Business, Englewood Cliffs, NJ: Prentice-Hall. |
| Библиографическая ссылка | Chang, M. and Chen, C. 1989. An improved primal simplex variant for pure processing networks. ACM Transaction on Mathematical Software, 15: 64–78. |
| Библиографическая ссылка | Charnes, A., Duffuaa, S. and Ryan, M. 1980. Degeneracy and the more-for-less paradox. Journal of Information & Optimization Sciences, 1: 52–56. |
| Библиографическая ссылка | Charnes, A., Harnes, S., Duffuaa, S. and Ryan, M. 1987. The more-for-less paradox in linear programming. European Journal of Operational Research, 31: 194–197. |
| Библиографическая ссылка | Charnes, A., Karney, D., Kilingman and Stuts, J. 1975. Past, present and future of large scale transshipment computer codes and application. Computers and Operations Research, 2: 71–81. |
| Библиографическая ссылка | Chen, W. 1990. Theory of Nets: Flow in Networks, New York, NY: Wiley. |
| Библиографическая ссылка | Choi, W. and Tufekci, S. 1992. “Dynamic basis partitioning for network flows with side constraints”. In in Combinatiorial Optimization, Berlin: Spring-Verlag. |
| Библиографическая ссылка | Chvatal, V. 1983. Linear Programming, New York: Freeman and Co. |
| Библиографическая ссылка | Clausen, J. 1987. A note on the Edmonds-Fukuda pivoting rule for simplex algorithms. European Journal of Operational Research, 29: 378–383. |
| Библиографическая ссылка | Cunningham, W. 1976. Theoretical properties of the network simplex method. Mathematics of Operations Research, 4: 196–208. |
| Библиографическая ссылка | Cunningham, W. and Klincewicz, J. 1983. On cycling in the network simplex method. Mathematical Programming, 26: 182–189. |
| Библиографическая ссылка | Dantzig, G. 1968. Linear Programming and Extensions, NJ: Princeton University Press. |
| Библиографическая ссылка | Deo, N. and Pang, C. 1984. Shortest path algorithms: Taxonomy and annotations. Networks, 14: 275–323. |
| Библиографическая ссылка | Derigs, U. 1988. “Lecture Notes in Economics and Mathematical Systems”. In Programming in Network and Graph, Berlin: Springer-Verlag. |
| Библиографическая ссылка | Dinescu, C. and Savulescu, B. 1984. Sensitivity and parametric analysis of maximum flow in a network. Optimization, 15: 263–273. |
| Библиографическая ссылка | Divoky, J. and Hung, M. 1990. Performance of the shortest path algorithms in network flow problems. Management Science, 36: 661–673. |
| Библиографическая ссылка | Duff, I., Erisman, E. and Reid, J. 1986. Direct Methods for Sparse Matrices, Oxford, , England: Oxford University Press. |
| Библиографическая ссылка | Eiselt, H., Pederzoli, . and Sandblom, . 1987. Continuous Optimization Models, Berlin: Walter de Gruyter. |
| Библиографическая ссылка | Ford, L.R. and Fulkerson, D.R. 1962. Flows in Networks, New Jersey: Princeton University Press. |
| Библиографическая ссылка | Forrest, J. and Tomlin, J. 1979. Updating triangular factors of the basis to maintain sparsity in the product form simplex method. Mathematical Programming, 2: 263–278. |
| Библиографическая ссылка | Freund, R. 1991. A potential-function reduction algorithm for solving a linear program directly from an infeasible “warm start“. Mathematical Programming, 52: 441–466. |
| Библиографическая ссылка | Gal, T. 1991. “An updated survey on degeneracy in mathematical programming and degeneracy graphs: A survey with new results”. In Operational Research ’90, 689–701. Oxford, UK: Pergamon Press. |
| Библиографическая ссылка | Gal, T. 1979. Postoptimality Analyses, Parametric Programmings and Related Topics, New York: McGrow Hill. |
| Библиографическая ссылка | Gamble, A., Conn, A. and Pulleyblank, P. 1991. A network penalty method. Mathematical Programming, 50: 53–73. |
| Библиографическая ссылка | Garvish, B., Schweitzer, P. and Shlifer, E. 1977. The zero pivot phenomenon in transportation and assignment problems and its computational implications. Mathematical Programming, 13: 226–240. |
| Библиографическая ссылка | Gill, P., Murray, W., Saunders, M. and Wright, M. 1989. A practical anti-cycling procedure for linear constrained optimization. Mathematical Programming, 45: 437–474. |
| Библиографическая ссылка | Gillett, B. 1976. Introduction to Operations Research A computer-Oriented Algorithmic Approach, New York: McGraw-Hill. |
| Библиографическая ссылка | Glover, F., Klingman, D. and Phillips, N. 1992. Network Models in Optimization and their Application in Practice, New York: Wiley. |
| Библиографическая ссылка | Goldberg, A., Grigoriadis, M. and Tarjan, R. 1991. Use of dynamic trees in a network simplex algorithm for maximum flow problem. Mathematical Programming, 50: 277–290. |
| Библиографическая ссылка | Goldberg, A. and Tarjan, R. 1988. A new approach to the maximum-flow problem. Journal of the ACM, 35: 921–940. |
| Библиографическая ссылка | Golden, R. and Magnanti, T. 1977. Determinitsic network optimization: A bibliography. Networks, 7: 149–183. |
| Библиографическая ссылка | Goldfarb, D. 1985. Efficient dual simplex algorithm for the assignment problem. Mathematical Programming, 33: 187–203. |
| Библиографическая ссылка | Goldfarb, D. 1977. On the Bartles-Gould decomposition for linear programming basis. Mathematical Programming, 13: 272–279. |
| Библиографическая ссылка | Goldfarb, D. and Hao, J. 1990. A primal simplex algorithm that solves the maximum flow problem in at most mn pivots and O(n<sup>2</sup>m) time. Mathematical Programming, 47: 353–365. |
| Библиографическая ссылка | Goldfarb, D. and Hao, J. 1990. Anti-stalling pivot rules for the network simplex algorithm. Networks, 20: 79–91. |
| Библиографическая ссылка | Goldfarb, D., Hao, J. and Kai, S.R. 1990. Efficient shortest path simplex algorithms. Operations Research, 38: 624–628. |
| Библиографическая ссылка | Goldfarb, D. and Reid, J. 1977. A practicable steepest-edge simplex algorithm. Mathematical Programming, 12: 361–371. |
| Библиографическая ссылка | Golud, G. and Reid, J. 1989. New crash procedures for large systems of linear constraints. Mathematical Programming, 45: 475–501. |
| Библиографическая ссылка | Greenberg, H.J. 1985. Advanced basis construction in linear programming. Annals of Operations Research, 5: 413–424. 1986 |
| Библиографическая ссылка | Grigoriadis, M. 1986. An efficient implementation of network simplex method. Mathematical Programming, 26: 83–111. |
| Библиографическая ссылка | Gupta, A., Khanna, S. and Puri, M. 1992. Paradoxical situations in transportation problems. Cahiers de Centre d’Etudes de Recherche Operationnell, 34: 37–49. |
| Библиографическая ссылка | Hattersley, B. and Wilson, J. 1988. A dual approach to primal degeneracy. Mathematical Programming, 42: 135–145. |
| Библиографическая ссылка | Hung, M. 1983. A polynomial simplex method for the assignment problem. Operations Research, 31: 595–600. |
| Библиографическая ссылка | Jarvis, J. and Shier, D. 1990. Netsolve: Interactive software for network optimization. Operations Research Letters, 9: 275–282. |
| Библиографическая ссылка | Jonker, R. and Volgenant, T. 1986. Improving the Hungarian assignment algorithm. Operations Research Letters, 5: 171–175. |
| Библиографическая ссылка | Kennington, J. and Helagason, R. 1980. Algorithms for Network Programming, New York: Wiley. |
| Библиографическая ссылка | Klafszky, E. and Terlaky, T. 1989. Variants of the Hungarian method for solving linear programming problems. Optimization, 20: 79–91. |
| Библиографическая ссылка | Klingman, D. and Russell, R. 1975. Solving constrained transportation problems. Operations Research, 23: 91–106. |
| Библиографическая ссылка | Lasdon, L. 1978. “Large scale programming”. In in Handbook of Operations Research, Edited by: Moder, J. and Elmaghraby, S. 267–293. New York: Van Nostrand Reinhold Co. |
| Библиографическая ссылка | Lawler, E.L. 1976. Combinatorial Optimization: Networks and Matroids, New York: Holt, Rinehart and Winston Publisher. |
| Библиографическая ссылка | Lehmann, R. 1984. Contribution to the Hungarian method. Math. Operationforsch. u. Statist., ser. Optimization, 15: 91–97. |
| Библиографическая ссылка | Lovasz, L. and Plummer, M.D. 1986. Matching Theory, Amsterdam: North-Holland. |
| Библиографическая ссылка | McBride, D. 1980. A bump triangular dynamic factorization algorithm for the simplex method. Mathematical Programming, 18: 49–61. |
| Библиографическая ссылка | Magnanti, T. and Orlin, J. 1988. Parametric Linear programing and anti-cycling pivoting rules. Mathematical Programming, 41: 317–325. |
| Библиографическая ссылка | Magnanti, T. and Wong, R. 1984. Network design and transportation planning: Models and algorithm. Transportation Science, 18: 1–55. |
| Библиографическая ссылка | Maurras, J., Trumper, K. and Akgul, M. 1981. Polynomial algorithms for a class of linear programs. Mathematical Programming, 21: 121–136. |
| Библиографическая ссылка | Megiddo, N. 1979. Combinatorial optimization with rational objective function. Mathematics of Operations Research, 4: 414–424. |
| Библиографическая ссылка | More, J.J. and Wright, S.J. 1993. Optimization Software Guide, Philadelphia: SIAM. |
| Библиографическая ссылка | Mulvey, J. 1978. Testing of a large-scale network optimization program. Mathernatical Programming, 15: 291–314. |
| Библиографическая ссылка | Murty, K. 1992. Network Programming, Englewood Cliff, NJ: Prentice-Hall. |
| Библиографическая ссылка | Nazareth, J. 1987. Computer Solution of Linear Programs, New York: Oxford University Press. |
| Библиографическая ссылка | O’hEingeartaigh, M., Lenstra, J. and Rinnooy Kan, A. 1985. Combinatorial Optimization: Annotated Bibliographies, New York: Wiley. |
| Библиографическая ссылка | Orlin, J. 1985. On the simplex algorithm for network and generalized network. Mathmatical Programming Study, 24: 166–178. |
| Библиографическая ссылка | Orlin, J.B. and Ahuja, R.K. 1992. New scaling algorithms for the assignment and minimum mean cycle problems. Mathematical Programming, 54: 41–56. |
| Библиографическая ссылка | Pan, P. 1991. A simplex-like method with bisection for linear programming. Optimization, 54: 717–743. |
| Библиографическая ссылка | Paparrizos, K. 1991. An infeasible (exterior point) simplex algorithm for assignment problems. Mathematical Programming, 51: 45–54. |
| Библиографическая ссылка | Phillips, D. and Garcia-Diaz, A. 1990. Fundamental of Network Analysis, Englewood Cliffs, NJ: Prentice-Hall. |
| Библиографическая ссылка | Phillips, D., Ravindran, A. and Solberg, J. 1976. Operations Research: Principles and Practice, New York: Wiley. |
| Библиографическая ссылка | Pissanetzky, S. 1984. Sparse Matrix Technology, New York: Academic Press. |
| Библиографическая ссылка | Pierce, A. 1975. Bibliography on algorithms for shortest path, shortest spanning trees, and related circuit routing problems (1956-1974). Networks, 5: 129–149. |
| Библиографическая ссылка | Prasa, V.R. 1993. On integer fractional linear programming. Opsearch, 30: 174–176. |
| Библиографическая ссылка | Price, W. and Gravel, M. 1984. Solving network manpower problems. European Journal of Operational Research, 15: 196–202. |
| Библиографическая ссылка | Ravi, N. and Wendell, R. 1988. The tolerance approach to sensitivity analysis in network linear programming. Networks, 18: 159–171. |
| Библиографическая ссылка | Reid, J. 1982. A sparsity-exploiting variant of the Bartles-Golub decomposition for linear program basis. Mathematical Programming, 24: 55–69. |
| Библиографическая ссылка | Rockafellar, R. 1984. Network Flow and Monotopic Optimization, NY: Wiley. New York |
| Библиографическая ссылка | Ruhe, G. 1985. Characterization of all optimal solutions and parametric maximal flows in networks. optimization, 16: 51–61. |
| Библиографическая ссылка | Ruhe, G. 1988. Parametric maximal flows in generalized networks: Complexity and algorithms. Optimization, 19: 235–251. |
| Библиографическая ссылка | Ruhe, G. 1991. Algorithmic Aspects of Flow in Networks, Dordrecht, , Netherlands: Kluwer Academic Publishers. |
| Библиографическая ссылка | Ryan, M. 1978. “More-for-less paradox in the distribution model”. In in Extermal Methods and Systems Analysis, Edited by: Fiacco, A. and Kortanek, K. 275–303. New York: Springer-Verlag. |
| Библиографическая ссылка | Schmidt, S., Jensen, R. and Barnes, J. 1982. An advanced dual incremental network algorithm. Networks, 12: 475–492. |
| Библиографическая ссылка | Schonherr, S. 1985. Resource allocation on condition of random resource demand of networkactivities. Optimization, 16: 715–731. |
| Библиографическая ссылка | Schrage, L. 1991. LINDO: An Optimization Modeling, South San Francisco, CA: The Scientific Press. |
| Библиографическая ссылка | Schrijver, A. 1986. Theory of Linear and Integer Programming, New York: Wiley. |
| Библиографическая ссылка | Shamir, R. 1987. The efficiency of the simplex method: A survey. Management Science, 33: 301–334. |
| Библиографическая ссылка | Shier, D. and Witzgall, C. 1980. Arcs tolerance in shortest path and network flow problems. Networks, 10: 277–291. |
| Библиографическая ссылка | Spira, P. and Pan, P. 1975. On finding and updating spanning trees and shortest paths. SIAM Journal of Computing, 4: 375–380. |
| Библиографическая ссылка | Srinivansan, V. and Thompson, G. 1977. Cost operator algorithms for the transportation problem. Mathematical Programming, 12: 372–391. |
| Библиографическая ссылка | Stancu-Minasian, I.M. 1992. A fourth bibliography of fractional programming. Optimization, 23: 53–71. |
| Библиографическая ссылка | Steinberg, D. and Aucamp, D. 1983. On ranging cost coefficients in dual degenerate linear programming problems. Decision Sciences, 14: 440–441. |
| Библиографическая ссылка | Tarjan, R. 1986. Algorithms for maximum network flow. Mathematical Programming Study, 26: 1–11. |
| Библиографическая ссылка | Tarjan, R. 1983. “SIAM Regional Conference Series in Applied Mathematics”. In Data Structures and Network Algorithms Philadelphia, PA |
| Библиографическая ссылка | Tarjan, R. 1982. Sensitivity analysis of minimum spanning trees and shortest path. Information Processing Letters, 27: 30–33. |
| Библиографическая ссылка | Trumper, K. 1992. Matroid Decomposition, San Diego, CA: Academic Press. |
| Библиографическая ссылка | Vuren, V. and Jansen, G. 1988. Recent developments in path finding algorithms: A review. Transportation Planning and Technology, 12: 57–71. |
| Библиографическая ссылка | Wang, H.F. and Huang, C.S. 1993. Multi-parametric analysis of the maximum tolerance in a linear programming problem. European Journal of Operational Research, 67: 75–87. |
| Библиографическая ссылка | Ward, J. and Wendell, R. 1990. Approaches to sensitivity analysis in linear programming. Annals of Operations Research, 27: 3–38. |
| Библиографическая ссылка | Weber, G.M. 1981. Sensitivity analysis of optimal matchings. Networks, 11: 41–56. |
| Библиографическая ссылка | Winston, W. 1994. Operations Research: Applications and Algorithms, Boston, MA: PWS-KENT Pub. Co. |
| Библиографическая ссылка | Winter, P. 1986. “Topological network synthesis”. In synthesis, in Combinatorial Optimization, Edited by: Wimeone, B. 282–303. Berlin: Springer-Verlag. |
| Библиографическая ссылка | Wondolowski, F. Jr. 1991. A generalization of Wendell’s tolerance approach to sensitivity analysis in linear programming. Decision Sciences, 22(4): 792–810. |
| Библиографическая ссылка | Yannakakis, M. 1991. Expressing combinatorial optimization problems by linear programming. Journal of Computer and System Sciences, 43(4): 441–466. |
| Библиографическая ссылка | Zadeh, N. 1973. A bad network problem for the simplex method and other minimum cost flow algorithms. Mathematical Programming, 5(4): 255–266. |
| Библиографическая ссылка | Zenios, S. 1990. Integrating network optimization capabilities into a high-level modeling language. ACM Transactions on Mathematical Software, 16(4): 113–142. |
| Библиографическая ссылка | Zhang, X.S. and Liu, D.G. 1990. A note on the continuity of solutions of parametric linear programs. Mathematical Programming, 47(4): 143–153. |
| Библиографическая ссылка | Zionts, S. 1974. Lecture Notes in Economics and Mathematical Systems, Englewood Cliffs, NJ: Prentice-Hall. |
| Библиографическая ссылка | Zornig, P. 1991. “Lecture Notes in Economics and Mathematical Systems”. In Degeneracy Graphs and Simplex Cycling, Berlin: Springer-Verlag. |
