Abstract
A number of models of complex economical and engineering systems are formulated as optimization problems of large dimension in which certain variables are discrete (integer). In view of the hierarchical structure of constraints, one can distinguish in the set of variables the subsets (subsystems) associated with the presence of a small number of common variables and constraints. Such are many problems of branch planning, design of data processing systems, planning of manufacturing corporations, and resource allocation in manufacturing and engineering systems (see the survey [2]).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References to Chapter 3
Arkhipova T.T. and Sergienko I.V., O formalizatsii i reshenii nekotorykh zadach organizatsii vychislitel’nogo protsessa v sistemakh obrabotki dannykh (On the Formalization and Solution of Certain Organization Problems for a Computational Process in Data-Processing Systems), Kibernetika, 1973, no. 5, pp. 11–18.
Averbakh I.L. and Tsurkov V.I., Chelochislennye optimizatsionnye modeli blochnogo tipa (Block Integer Optimization Models), Mat. Model., 1990, vol. 2, no. 2, pp. 39–57.
Averbakh I.L. and Tsurkov V.I., Blochnye zadachi chastichno-tselochislennogo programmirovaniya so svyazyvayushchimi peremennymi (Block Mixed-Integer Programming Problems with Coupling Variables), Kibern, Vychisl. Tekh., 1991, no. 89, pp. 62–67.
Averbakh I.L., Teoretiko-gruppovoi metod dekompozitsii v tselochislennorn lineinom programmirovanii (A Group-Theoretical Method of Decomposition in Integer Linear Programming), Zh. Vychisl. Mat. Mat. Fiz., 1992, vol. 32, no. 8, pp. 1229–1243.
Averbakh I.L., Kombinirovannaya dekompozitsiya v blochnykh zadachakh tselochislennogo lineinogo programmirovaniya (Combined Decomposition in Block Integer Linear Programming Problems), Avtom. Telemekh., 1990, no. 7, pp. 108–115.
Averbakh I.L., Adaptivnyi metod optimizatsii dvukhetapnykh stokhasticheskykh sistem s diskretnymi peremennymi (An Adaptive Optimization Method for Two-Stage Stochastic Systems with Discrete Variables), Izv. Akad. Nauk SSSR, Ser. Tekh. Kibern., 1990, no. 1, pp. 162–166.
Averbakh I.L., Iterativnyi metod resheniya diskretnykh zadach stokhasticheskogo programmirovaniya s additivno-razdelyaemymi peremennymi (An Iterative Method for Solving Discrete Stochastic Programming Problems with Additively Separable Variables), Zh. Vychisl. Mat. Mat. Fiz., 1991, vol. 31, no. 6, pp. 810–818.
Averbakh I.L., Iterativnyi metod dekompozitsii v odnoetapnykh zadachakh stokhasticheskogo tselochislennogo programmirovaniya (An Iterative Method of Decomposition in Single-Stage Stochastic Integer Programming Problems), Zh. Vychisl. Mat. Mat. Fiz., 1990, vol. 30, no. 10, pp. 1467–1476.
Averbakh I.L., Skhema mnogourovnevoi dekompozitsii v blochom chastichotselochislennom programmirovaniya (A Multilevel Decomposition Scheme in Block Mixed-Integer Programming), Avtorn. Telemekh., 1991, no. 11, pp. 119–126.
Averbakh I.L. and Tsurkov V.I., Optimizatsiya v blochnykh zadachakh s tselochislennymi peremennymi (Optimization in Block Problems with Integer Variables), Moscow: Nauka, 1995.
Averbakh I.L., Dvukhurovnevye sistemy lestnichoi struktury so smeshannymi peremennymi (Two-Level Systems of Ladder Structure with Mixed Variables), Izv. Akad. Nauk SSSR, Ser. Tekh. Kibern., 1992, no. 3, pp. 114–121.
Ayupov R.S., Kombinatorno-nepreryvnyi metod resheniya blochnykh zadach diskretnogo programmirovaniya (A Combinatorial Continuous Method for Solving Block Discrete Programming Problems), Izv. Akad. Nauk SSSR, Ser. Tekh. Kibern., 1984, no. 3, pp. 34–39.
Barthers J. and Henley E., Branch and Bound Method as Decomposition Tools, In Decomposition of Large-Scale Problems, Amsterdam, 1973, pp. 15–42.
Benders J.F., Partitioning Procedures for Solving Mixed Variable Programming Problems, Numer. Math., 1977, vol. 1, pp. 117–144.
Dantzig G.B. and Wolfe P., Decomposition Principle for Linear Programs, Oper. Res., 1960, vol. 8, no. 1, pp. 101–112.
Emelichev V.A. and Bui Kat Tyong, Dekompozitsionnyi podkhod k resheniyu kvaziblochnykh zadach diskretnoi optimizatsii na osnove metoda postroeniya posledovatel’nosti planov (A Decomposition Approach to the Solution of Quasi-Block Problems of Discrete Optimization on the Basis of the Method of Sequential Construction of Plans), Kibernetika, 1988, no. 1, pp. 116–118.
Ermol’ev Yu.M., Metody stokhasticheskogo programmirovaniya (Methods of Stochastic Programming), Moscow: Nauka, 1976.
Everett H., Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources, Oper. Res., 1963, vol. 11, no. 3, pp. 399–417.
Finkelshtein Yu.Yu., Ob odnom klasse zadach programmirovaniya (On One Class of Programming Problems), Ekon. Mat. Metody, 1968, vol. 4, no. 4, pp. 652–655.
Fisher M., The Lagrangean Relaxation Method for Solving Integer Programming Problems, Manage. Sci., 1981, vol. 27, no. 1, pp. 1–18.
Forgo F., Dualitas es decompozicio egeszerteku programozasi feladatok eseteben, Szigma, 1976, vol. 9, no. 1–2.
Forgo F., Shadow Prices and Decomposition for Integer Programs, Dep. K. Marx Univ. Econ., Budapest, 1974, no. 6, pp. 1–31.
Garey M. and Johnson D.S., Computers and Intractability, San Francisco: Freeman, 1979.
Gens G.V., Zadachi raspredeleniya resursov v ierarkhicheskikh sistemakh (Resource Allocation Problems in Hierarchical Systems, Tekh. Kibern., 1984, no. 1, pp. 37–44.
Geoffrion A.M., Lagrangean Relaxation and Its Uses in Integer Programming, Mathematical Programming Study, 1974, vol. 2, pp. 82–114.
Glover F. and Klingman D., Layering Strategies for Creating Exploitable Structures in Linear and Integer Programs, Math. Programming, 1988, vol. 40, no. 2, pp. 165–181.
Glover F. and Mulvey J., Equivalence of the 0–1 Integer Programming Problem to Discrete Generalized and Pure Networks, Oper. Res., 1980, vol. 28, pp. 829–835.
Glover F., Glover R., and Martinson F., A Netform System for Resource Planning in the US Bureau of Land Management, J. Oper. Res. Soc., 1984, vol. 35, pp. 605–616.
Glover F., Hultz J., Klingman D., and Stutz J., Generalized Networks: A Fundamental Computer-Based Planning Tool, Manage. Sci., 1978, vol. 24, pp. 1209–1220.
Golshtein E.G., Teoriya dvoistvennosti v matematicheskom programmirovanii i ee prilozheniya (Duality Theory in Mathematical Programming and Its Applications), Moscow: Nauka, 1981.
Gomory R.E., On the Relation between Integer and Non-Integer Solutions to Linear Programs, Proc. Nat. Acad. Sci., 1965, vol. 53, pp. 250–256.
Guignard M. and Kim S., Lagrangean Decomposition: A Model Yielding Stronger Lagrangean Bounds, Math. Programming, 1987, vol. 39, no. 2, pp. 215–228.
Guilianetti S. and Lucertini M., A Decomposition Technique in Integer Linear Programming, Lect. Notes Comput. Sci., 1976, vol. 41, pp. 86–97.
Holm S. and Tind J., A Unified Approach for Price Directive Decomposition Procedures in Integer Programming, Discrete Appl. Math., 1988, vol. 20, pp. 205–219.
Hu T.C., Integer Programming and Network Flows, Reading: Addison-Wesley, 1970.
Johnson E.L., On the Group Problem and a Subadditive Approach to Integer Programming, Ann. Discrete Math., 1979, no. 5, pp. 97–112.
Kaufmann A. and Henry-Labordere A., Methodes et modeles de la recherche operationelle, Paris: Dunod, 1974, vol. 3.
Korbut A.A. and Finkelshtein Yu.Yu., Diskretnoe programmirovanie (Discrete Programming), Moscow: Nauka, 1969.
Korbut A.A., Sigal I.Kh., and Finkel’shtein Yu.Yu., Gibridnye metody v diskret-noi optimizatsii. Obzor (Hybrid Methods in Discrete Optimization: A Survey), Izv. Akad. Nauk SSSR, Ser. Tekh. Kibern., 1988, no. 1, pp. 65–77.
Kovalev M.M., Diskretnaya optimizatsiya (Discrete Optimization), Minsk: Beloruss. State Univ., 1977.
Lasdon L.S., Optimization Theory for Large Systems, New York: Macmillan, 1970.
Lawler E.L., A Procedure for Computing the Best Solutions to Discrete Optimization Problems and Its Applications to the Shortest Path Problem, Manage. Sci., 1972, vol. 18, pp. 401–405.
Lebedev S.S., Tselochislennoe programmirovaniye i mnozhiteli Lagranzha (Integer Programming and Lagrange Multipliers), Ekon. Mat. Metody, 1974, vol. 10, no. 3, pp. 592–610.
Lyapunov A.A., O vpolne additivnykh vektor-funktsiyakh (On Completely Additive Vector Functions), Izv. Akad. Nauk SSSR, Ser. Mat., 1940, vol. 4, no. 6, pp. 465–478.
Manne A.S., Programming of Economic Lot Sizes, Manage. Sci., 1958, vol. 14, pp. 115–135.
Mashchenko S.O., Dekompozitsionnyi algoritm resheniya chasticho-tselochislennykh zadach lineinogo programmirovaniya (A Decomposition Algorithm for Solving Mixed-Integer Linear Programming Problems), in Issledovanie zadach mnogokriterial’noi optimizatsii (Analysis of Multicriteria Optimization Problems), Kiev: Inst. Kibern., Akad. Nauk Ukr. 1984, pp. 49–63.
Mashchenko S.O., Dekompozitsionnyi algoritm resheniya chasticho-tselochislennykh zadach lineinogo programmirovaniya (A Sequential Algorithm for Solving Mixed Linear Programming Problems), in Issledovanie operatsii i ASU (Operations Research and Automatic Control Systems), Kiev: Vishcha Shkola, 1981, no. 21, pp. 33–39.
Mikhalevich V.S., Posledovatel’nye algoritmy optimizatsii i ikh primenenie. 1, 2 (Sequential Optimization Algorithms and Their Application. 1, 2), Kibernetika, 1965, no. 1, pp. 45–55; no. 2, pp. 85–89.
Mikhalevich V.S., Volkovich V.L., Voloshin A.F., and Mashchenko S.O., Posledovatel’nyi podkhod k resheniyu smeshannykh zadach lineinogo programmirovaniya (A Sequential Approach to Solving Mixed Linear Programming Problems), Kibernetika, 1983, no. 1, pp. 34–39.
Mikhalevich V.S., Volkovich V.L., Voloshin A.F., and Pozdnyakov Yu.M., Algoritmy posledovatel’nogo analiza i otseivaniya variantov v zadachakh diskret-noi optimizatsii (Algorithms of Sequential Analysis and Screening of Variants in Discrete Optimization Problems), Kibernetika, 1980, no. 3, pp. 76–85.
Pospelov G.S., Ven V.L., Solodov V.M., Shafranskii V.V., and Erlikh A.I., Problemy programmno-tselevogo planirovaniya i upravleniya (Problems of Program and Goal-Oriented Planning and Management), Moscow: Nauka, 1981.
Pozdnyakov Yu.M., Dekompozitsionnaya skhema resheniya zadach tselochislennogo programmirovaniya (A Decomposition Scheme for Solving Integer Programming Problems), Zh. Vychisl. Mat. Mat. Fiz., 1982, vol. 22, no. 1, pp. 57–67.
Pozdnyakov Yu.M. and Mashchenko S.O., Ob optimizatsii dekompozitsii (Optimization of Decomposition), in Issledovanie operatsii i ASU (Operations Research and Automatic Control Systems), Kiev: Vishcha Shkola, 1981, no. 18, pp. 27–35.
Sannomiya N. and Tsukabe M., A Method for Decomposing Mixed-Integer Linear Programming Problems with Angular Structure, Int. J. Syst. Sci., 1981, vol. 12, no. 9, pp. 1031–1043.
Sergienko I.V. and Golodnikov A.N., 0 primenenii metoda vektora spada v dekompozichionnykh skhemakh resheniya zadach tselochislennogo lineinogo programmirovaniya (Application of the Descent Vector Method to Decomposition Schemes for Solving Integer Linear Programming Problems), Kibernetika, 1984, no. 1, pp. 44–47.
Sergienko I.V., Lebedeva T.T., and Roshchin V.A., Priblizhennye metody resheniya diskretnykh zadach optimizatsii (Approximate Methods for Discrete Optimization Problems), Kiev: Naukova Dumka, 1980.
Shapiro J. Mathematical programming: structures and algorithms. N.Y.: J. Wiley and Sons, 1979.
Shcherbina O.A., O modifitsirovannom lokal’nom algoritme resheniya blochnykh zadach diskretnogo programmirovaniya (On a Modified Local Algorithm for Solving Block Discrete Programming Problems), Zh. Vychisl. Mat. Mat. Fiz., 1986, vol. 26, no. 9, pp. 1339–1349.
Shepardson F. and Marsten R., A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem, Manage. Sci., 1980, vol. 26, pp. 274–281.
Shilo V.P., Ob issledovanii odnogo klassa algoritmov tselochislennogo lineinogo programmirovaniya s bulevymi peremennymi (Analysis of One Class of Integer Linear Programming Algorithm with Boolean Variables), in Teoriya i programmnaya realizatsiya metodov diskretnoi optimizatsii. Sb. nauchnykh trudov (Theory and Program Implementation of Discrete Optimization Methods: Collection of Research Works ), Kiev, 1989, pp. 35–40.
Shlyk V.A., O teoretiko-gruppovom podkhode v tselochislennom lineinom programmirovanii (A Group-Theoretical Approach in Integer Linear Programming), Izv. Akad. Nauk SSSR, Ser. Tekh. Kibern., 1988, no. 1, pp. 94–105.
Shor N.Z., Metody minimizatsii nedifferentsiruemykh funktsii i ikh prilozheniya (Methods of Minimization of Nondifferentiable Functions and Their Applications), Kiev: Naukova Dumka, 1979.
Steinberg E. and Napier H., Optimal Multi-Level Lot Sizing for Requirements Planning Systems, Manage. Sci., 1980, vol. 26, pp. 1258–1271.
Sweeney D. and Murphy R., A Method of Decomposition for Integer Programs, Oper. Res., 1979, vol. 27, no. 6, pp. 1128–1141.
Tsarevskii N.A., Approksimatsionnyi dekompozitsionnyi algoritm dlya kombinatornoi zadachi razvitiya proizvodstvennykh moshchnostei otrasli promyshlennosti s blochnymi proizvodstvennymi ogranicheniyami. I (An Approximative Decomposition Algorithm for a Combinatorial Problem on the Development of Production Powers of an Industrial Branch with Block Production Constraints. 1), Izv. Akad. Nauk SSSR, Ser. Tekh. Kibern., 1984, no. 6, pp. 25–32.
Tsurkov V.I., Dekompozitsiya v zadachakh bol’shoi razmernosti (Decomposition in Problems of Large Dimension), Moscow: Nauka, 1981.
Tsurkov V.I., Blochoe tselochislennoe programmirovaniye (Block Integer Programming), in Chislennye metody i optimizatsiya. Materialy 4 simpoziuma (Numerical Methods and Optimization. Proceedings of the 4th Symposium), Tallinn, 1988, pp. 194–196.
Tsurkov V.I., Dekompozitsiya v blochnykh zadachakh s tselochislennymi peremennymi (Decomposition in Block Problems with Integer Variables), Izv. Akad. Nauk SSSR, Ser. Tekh. Kibern., 1990, no. 3, pp. 3–15.
Ul’m S.Yu., Metody dekompozitsii v zadachakh optimizatsii (Methods of Decomposition in Optimization Problems), Tallinn: Valgus, 1979.
Uzdemir A.P., Skhema posledovatel’noi dekompozitsii v zadachakh optimizatsii (A Scheme of Successive Decomposition in Optimization Problems), Avtom. Telemekh., 1980, no. 11, pp. 94–105.
Uzdemir A.P., Zadachi planirovaniya diskretnogo (shtuchogo) proizvodstva i chislennye metody ikh resheniya (Problems of Planning a Discrete Single-Piece Production and Numerical Methods for These Problems), Avtom. Telemekh., 1975, no. 9, pp. 115–122.
Van Roy T.J., Cross Decomposition for Mixed Integer Programming, Math. Programming, 1983, vol. 25, no. 1, pp. 46–63.
Volkovich V.L. and Voloshin A.F., Posledovatel’nyi podkhod k resheniyu zadach lineinogo chasticho-tselochislennogo programmirovaniya spetsial’noi struktury (A Sequential Approach to Solving Mixed-Integer Linear Programming Problems of Special Structure), Dokl. Akad. Nauk SSSR, Ser. Fiz.—Mat. Tekh. Nauk., 1987, no. 8, pp. 63–67.
Volkovich V.L. and Voloshin A.F., Ob odnoi skheme metoda posledovatel’nogo analiza i otseivaniya variantov (On One Scheme of the Method of Sequential Analysis and Screening of Variants), Kibernetika, 1978, no. 4, pp. 98–105.
Voloshin A.F. and Mashchenko S.O., Subeksponentsial’nyi algoritm resheniya zadachi o rantse (A Subexponential Algorithm for Solving a Knapsack Problem), Dokl. Akad. Nauk Ukr. SSR, 1986, no. 10, Ser. A, pp. 55–58.
Voloshin A.F., Nakhozhdenie suboptimal’nykh reshenii v diskretnykh optimizatsionnykh zadachakh metodom posledovatel’nogo analiza i otseivaniya variantov (Determination of Suboptimal Solutions in Discrete Optimization Problems by the Method of Sequential Analysis and Screening of Variants), in Vychislitel’nye aspekty v paketakh prikladnykh programm (Computational Aspects in Software Packages), Kiev: Inst. Kibern., Akad. Nauk Ukr. SSR, 1980, pp. 25–35.
Wolsey L.A., Integer Programming Duality: Price Functions and Sensitivity Analysis, Math. Programming, 1981, vol. 20, no. 2, pp. 173–195.
Yudin D.B., Zadachi i metody stokhasticheskogo programmirovaniya (Problems and Methods of Stochastic Programming), Moscow: Sov. Radio, 1979.
Yudin D.V., Matematicheskie metody upravleniya v usloviyakh nepolnoi informatsii (Mathematical Control Methods under Incomplete Information), Moscow: Soy. Radio, 1974.
Yudin D.V., Zadachi i metody stokhasticheskogo programmirovaniya (Problems and Methods of Stochastic Programming), Moscow: Sov. Radio, 1979. Numerical Techniques for Stochastic Optimization, Berlin: Springer, 1988.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Tsurkov, V. (2001). Introduction to Block Integer Programming. In: Large-scale Optimization — Problems and Methods. Applied Optimization, vol 51. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3243-6_3
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3243-6_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4848-9
Online ISBN: 978-1-4757-3243-6
eBook Packages: Springer Book Archive