Skip to main content
SpringerLink
Log in

Polylithic Modeling and Solution Approaches

  • Chapter
  • First Online:
Business Optimization Using Mathematical Programming

Part of the book series: International Series in Operations Research & Management Science ((ISOR,volume 307))

  • 1118 Accesses

Abstract

This chapter deals with polylithic modeling and solution approaches. Such approaches allow to considerably extending the set of solvable practical problems both in their quality (structure) and in their size (the number of variables and constraints). These approaches are illustrated by problems from paper industry, which were solved with the help of polylithic modeling and solution approaches. In detail, roll minimization based on column generation, simultaneous minimization of waste, and the number of used patterns, as well as format production, are treated.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 159.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Here, the term primal refers to the primary problem, i.e., the optimization problem in its original form. Primary heuristics and procedures provide only primal allowable points. Only by the addition of dual information, an optimality proof is possible.

  2. 2.

    This GAMS file and part of the description in this section are by Erwin Kalvelagen (www.amsterdamoptimization.com), who kindly gave his permission to make this file part of MCOL.

References

  1. Aiyoshi, E., Shimizu, K.: Hierarchical decentralized systems and its new solution by a barrier method. IEEE Trans. Syst. Man Cybernet. 40, 444–449 (1988)

    Google Scholar 

  2. Bard, J.F.: Convex two-level programming. Math. Program. 40, 15–27 (1988)

    Article  Google Scholar 

  3. Bard, J.F.: Practical Bilevel Optimization: Algorithms and Applications. Kluwer Academic Publishers, Dordrecht (1998)

    Book  Google Scholar 

  4. Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsberg, M.W.P., Vance, P.H.: Branch-and-price: column generation for solving huge integer programs. Oper. Res. 46(3), 316–329 (1998)

    Article  Google Scholar 

  5. Bazaraa, M.S., Sherali, H.D.: On the choice of step sizes in subgradient optimization. Eur. J. Oper. Res. 7, 380–388 (1981)

    Article  Google Scholar 

  6. Beale, E.M.L., Forrest, J.J.H.: Global optimization using special ordered sets. Math. Program. 10, 52–69 (1976)

    Article  Google Scholar 

  7. Benders, J.F.: Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 4, 238–252 (1962)

    Article  Google Scholar 

  8. Benoist, T., Bourreau, E.: Fast global filtering for eternity II. Constraint Program. Lett. 3, 35–50 (2008)

    Google Scholar 

  9. Birge, J.R., Louveaux, F.V.: Introduction to Stochastic Programming. Springer Series in Operations Research and Financial Engineering. Springer, New York (2000)

    Google Scholar 

  10. Bracken, J., McGill, J.M.: Mathematical programs with optimization problems in the constraints. Oper. Res. 21, 37–44 (1973)

    Article  Google Scholar 

  11. Chauhan, S.S., Eremeev, A.V., Romanova, A.A., Servakh, V.V.: Approximation of linear cost supply management problem with lower-bounded demands solutions. In: Kolokolov, A.A., Eremeev, A.V. (eds.) Proceedings of Discrete Optimization Methods in Production and Logistics (DOM 2004), OMSK, pp. 16–21 (2004)

    Google Scholar 

  12. Clark, P.A., Westerberg, A.W.: Bilevel programming for steady state chemical process design: fundamentals and algorithms. Comput. Chem. Eng. 14, 87–97 (1990)

    Article  Google Scholar 

  13. Conejo, A.J., Castillo, E., Mínguez, R., García-Bertrand, R.: Decomposition Techniques in Mathematical Programming: Engineering and Science Applications. Springer, Berlin (2006)

    Google Scholar 

  14. Danna, E., Rothberg, E., Le Pape, C.: Exploring relation induced neighborhoods to improve MIP solutions. Math. Program. 102, 71–90 (2005)

    Article  Google Scholar 

  15. Dantzig, B., Wolfe, P.: The decomposition algorithm for linear programming. Oper. Res. 8, 101–111 (1960)

    Article  Google Scholar 

  16. de Farias Jr., I.R., Johnson, E.L., Nemhauser, G.L.: A generalized assignment problem with special ordered sets: a polyhedral approach. Math. Program. Ser. A 89, 187–203 (2000)

    Google Scholar 

  17. de Farias Jr., I.R., Zhao, M., Zhao, H.: A special ordered set approach for optimizing a discontinuous separable piecewise linear function. Oper. Res. Lett. 36, 234–238 (2008)

    Google Scholar 

  18. Dempe, S.: Foundations of Bilevel Programming. Kluwer Academic Publisher, Dordrecht (2002)

    Google Scholar 

  19. Dempe, S., Kue, F.M.: Solving discrete linear bilevel optimization problems using the optimal value reformulation. J. Global Optim. 68(2), 255–277 (2017)

    Article  Google Scholar 

  20. Dempe, S., Kalashnikov, V., Pérez-Valdés, G.A., Kalashnykova, N.I.: Natural gas bilevel cash-out problem: convergence of a penalty function method. Eur. J. Oper. Res. 215(3), 532–538 (2011)

    Article  Google Scholar 

  21. Dempe, S., Khamisov, O.V., Kochetov, Y.: A special three-level optimization problem. J. Glob. Optim. 76(3), 519–531 (2020)

    Article  Google Scholar 

  22. Desrochers, M., Desrosiers, J., Solomon, M.M.: A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40(2), 342–354 (1992)

    Article  Google Scholar 

  23. Dinter, J.V., Rebennack, S., Kallrath, J., Denholm, P., Newman, A.: The unit commitment model with concave emissions costs: a hybrid benders’ decomposition with nonconvex master problems. Ann. Oper. Res. 210, 361–386 (2013)

    Article  Google Scholar 

  24. Ferris, M.C., Dirkse, S.P., Jagla, J.H., Meeraus, A.: An extended mathematical programming framework. Comput. Chem. Eng. 33, 87–97 (2009)

    Article  Google Scholar 

  25. Fischetti, M., Glover, F.: The feasibility pump. Math. Program. 104, 91–104 (2005)

    Article  Google Scholar 

  26. Fischetti, M., Lodi, A.: Local branching. Math. Program. 98, 23–47 (2003)

    Article  Google Scholar 

  27. Fisher, M.L.: An applications oriented guide to Lagrangian relaxation. Interfaces 15, 10–21 (1985)

    Article  Google Scholar 

  28. Floudas, C.A.: Nonlinear and Mixed-Integer Optimization : Fundamentals and Applications. Oxford University Press, Oxford (1995)

    Book  Google Scholar 

  29. Floudas, C.A., Pardalos, P.M., Adjiman, C.S., Esposito, W.R., Gümüs, Z.H., Harding, S.T., Klepeis, J.L., Meyer, C.A., Schweiger, C.A.: Handbook of Test Problems of Local and Global Optimization. Kluwer Academic Publishers, Dordrecht (1999)

    Book  Google Scholar 

  30. Galati, M.: Decomposition Methods for Integer Linear Programming. PhD thesis, Lehigh University (Industrial Engineering), Lehigh (2009)

    Google Scholar 

  31. Geoffrion, A.M.: Lagrangian relaxation and its uses in integer programming. Math. Program. Study 2, 82–114 (1974)

    Article  Google Scholar 

  32. Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem. Oper. Res. 9, 849–859 (1961)

    Article  Google Scholar 

  33. Gilmore, P.C., Gomory, R.E.: A linear programming approach to the cutting stock problem, part II. Oper. Res. 11, 863–888 (1963)

    Article  Google Scholar 

  34. Gomes, A.M., Oliveira, J.F.: A 2-exchange heuristic for nesting problems. Eur. J. Oper. Res. 141, 359–370 (2002)

    Article  Google Scholar 

  35. Gomes, A.M., Oliveira, J.F.: Solving irregular strip packing problems by hybridising simulated annealing and linear programming. Eur. J. Oper. Res. 171, 811–829 (2006)

    Article  Google Scholar 

  36. Guignard, M.: Lagrange relaxation. Sociedad de Estad ística e Investgaciǿn Operativa 11(2), 151–228 (2003)

    Google Scholar 

  37. Heinz, S., Schlechte, T., Stephan, R.: Solving steel mill slab design problems. Constraints 17, 39–50 (2012)

    Article  Google Scholar 

  38. Held, M.H., Wolfe, P., Crowder, H.D.: Validation of subgradient optimization. Math. Program. 6, 62–88 (1974)

    Article  Google Scholar 

  39. Kallrath, J.: Mixed-integer nonlinear programming applications. In: Ciriani, T.A., Gliozzi, S., Johnson, E.L., Tadei, R. (eds.) Operational Research in Industry, pp. 42–76. Macmillan, Houndmills, Basingstoke (1999)

    Chapter  Google Scholar 

  40. Kallrath, J.: Modeling difficult optimization problems. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, pp. 2284–2297. Springer, New York (2008)

    Chapter  Google Scholar 

  41. Kallrath, J.: Combined strategic design and operative planning in the process industry. Comput. Chem. Eng. 33, 1983–1993 (2009)

    Google Scholar 

  42. Kallrath, J.: Cutting circles and polygons from area-minimizing rectangles. J. Glob. Optim. 43, 299–328 (2009)

    Article  Google Scholar 

  43. Kallrath, J.: Polylithic modeling and solution approaches using algebraic modeling systems. Optim. Lett. 5, 453–466 (2011). https://doi.org/10.1007/s11590-011-0320-4

    Article  Google Scholar 

  44. Kallrath, J.: Packing ellipsoids into volume-minimizing rectangular boxes. J. Glob. Optim. 67(1), 151–185 (2017)

    Article  Google Scholar 

  45. Kallrath, J., Blackburn, R., Näumann, J.: Grid-enhanced polylithic modeling and solution approaches for hard optimization problems. In: Bock, H.G., Jäger, W., Kostina, E., Phu, H.X. (eds.) Modeling, Simulation and Optimization of Complex Processes HPSC 2018 – Proceedings of the 7th International Conference on High Performance Scientific Computing, Hanoi, March 19–23, 2018, pp. 1–15. Springer Nature, Cham (2020)

    Google Scholar 

  46. Kallrath, J., Frey, M.M.: Packing circles into perimeter-minimizing convex hulls. J. Glob. Optim. 73(4), 723–759 (2019)

    Article  Google Scholar 

  47. Kallrath, J., Maindl, T.I.: Real Optimization with SAP-APO. Springer, Heidelberg (2006)

    Google Scholar 

  48. Kallrath, J., Rebennack, S.: Cutting ellipses from area-minimizing rectangles. J. Glob. Optim. 59(2–3), 405–437 (2014)

    Article  Google Scholar 

  49. Kallrath, J., Rebennack, S., Kallrath, J., Kusche, R.: Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges. Eur. J. Oper. Res. 238, 374–389 (2014)

    Article  Google Scholar 

  50. Kalvelagen, E.: Branch-and-Bound methods for an MINLP model with semi-continuous variables (2003, discontinued on http://www.gams.com)

  51. Karelathi, J.: Solving the Cutting Stock Problem in the Steel Industry. Master thesis, Helsinki University of Technology, Department of Engineering Physics and Mathematics, Helsinki (2002)

    Google Scholar 

  52. Karuppiah, R., Grossmann, I.E.: A Lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures. J. Global Optim. 41, 163–186 (2008)

    Article  Google Scholar 

  53. Leao, A.A.S., Toledo, F.M.B., Oliveira, J.F., Carravilla, M., Alvarez-Valdes, R.: Irregular packing problems: a review of mathematical models. Eur. J. Oper. Res. 282(3), 803–822 (2019)

    Article  Google Scholar 

  54. Lin, X., Floudas, C.A., Kallrath, J.: Global solution approaches for nonconvex MINLP problems in product portfolio optimization. J. Glob. Optim. 32, 417–431 (2005)

    Article  Google Scholar 

  55. Litvinchev, I.: Decomposition-aggregation method for convex programming problems. Optimization 22(1), 47–56 (1991)

    Article  Google Scholar 

  56. Litvinchev, I., Espinosa, E.L.O.: Solving the two-stage capacitated facility location problem by the Lagrangian heuristic. In: Hu, H., Shi, X., Stahlbock, R., Voß, S. (eds.) Computational Logistics. ICCL 2012. Lecture Notes in Computer Science, vol. 7555, pp. 92–103 (2012)

    Article  Google Scholar 

  57. Litvinchev, I., Rangel, S.: Localization of the optimal solution and a posteriori bounds for aggregation. Comput. Oper. Res. 26(10-11), 967–988 (1999)

    Article  Google Scholar 

  58. Litvinchev, I., Tsurkov, V.: Aggregation in large-scale optimization. Appl. Optim. 83, 291 (2003)

    Google Scholar 

  59. Litvinchev, I., Mata, M., Rangel, S., Saucedo, J.: Lagrangian heuristic for a class of the generalized assignment problems. Comput. Math. Appl. 60(4), 1115–1123 (2010)

    Article  Google Scholar 

  60. Lübbecke, M.E., Desrosiers, J.: Selected topics in column generation. Oper. Res. 53(6), 1007–1023 (2005)

    Article  Google Scholar 

  61. Makhorin, A.: GNU Linear Programming Kit - Reference Manual (2009). Version 4.37, 2009. http://www.gnu.org/software/glpk

  62. Maniezzo, V., Stützle, T., Voß, S. (eds.): Matheuristics: Hybridizing Metaheuristics and Mathematical Programming. Springer, Heidelberg (2009)

    Google Scholar 

  63. Martin, R.K.: Large Scale Linear and Integer Optimization – A Unified Approach. Kluwer, Dortrecht (1999)

    Book  Google Scholar 

  64. Migdalas, A., Pardalos, P.M., Värbrand, P. (eds.): Multilevel Optimization: Algorithms and Applications. Kluwer Academic Publishers, Boston, MA (1998)

    Google Scholar 

  65. Mirrlees, J.A.: The theory of moral hazard and unobservable behaviour: part I. Rev. Econ. Stud. 66, 3–21 (1999)

    Article  Google Scholar 

  66. Misener, R., Floudas, C.A.: Piecewise-linear approximations of multidimensional functions. J. Optim. Theor. Appl. 145, 120–147 (2010)

    Article  Google Scholar 

  67. Muñoz, J., Gutierrez, G., Sanchis, A.: Evolutionary techniques in a constraint satisfaction problem: puzzle eternity II. In: Proceedings 2009 IEEE Congress on Evolutionary Computation, pp. 2985–2991 (2009)

    Google Scholar 

  68. Nowak, I.: Relaxation and Decomposition Methods for Mixed Integer Nonlinear Programming. Birkhäuser, Basel (2005)

    Google Scholar 

  69. Pillo, G.D., Lucidi, S., Rinaldi, F.: An approach to constrained global optimization based on exact penalty functions. J. Glob. Optim. 54, 251–260 (2012)

    Article  Google Scholar 

  70. Pochet, Y., Wolsey, L.A.: Production Planning by Mixed Integer Programming. Springer, New York (2006)

    Google Scholar 

  71. Poljak, B.T.: A general method of solving extremum problems. Sov. Math. Dokl. 8, 593–597. Transl. Dokl. Akad. Nauk. SSSR 174, 1967 (1967)

    Google Scholar 

  72. Rebennack, S., Kallrath, J.: Continuous piecewise linear delta-approximations for bivariate and multivariate functions. J. Optim. Theor. Appl. 167, 102–117 (2015)

    Article  Google Scholar 

  73. Rebennack, S., Kallrath, J.: Continuous piecewise linear delta-approximations for univariate functions: computing minimal breakpoint systems. J. Optim. Theor. Appl. 167, 617–643 (2015)

    Article  Google Scholar 

  74. Rebennack, S., Kallrath, J., Pardalos, P.M.: Column enumeration based decomposition techniques for a class of non-convex MINLP problems. J. Glob. Optim. 43, 277–297 (2009)

    Article  Google Scholar 

  75. Rebennack, S., Oswald, M., Theis, D.O., Seitz, H., Reinelt, G., Pardalos, P.M.: A branch and cut solver for the maximum stable set problem. J. Combin. Optim. 21, 434–457 (2011)

    Article  Google Scholar 

  76. Rebennack, S., Reinelt, G., Pardalos, P.M.: A tutorial on branch&cut algorithms for the maximum stable set problem. Int. Trans. Oper. Res. 19, 161–199 (2012)

    Article  Google Scholar 

  77. Ryu, J., Lee, M., Kim, D., Kallrath, J., Sugihara, K., Kim, D.S.: VOROPACK-D: real-time disk packing algorithm using Voronoi diagram. Appl. Math. Comput. 375, 125076 (2020)

    Google Scholar 

  78. Savelsbergh, M.W.P.: Branch-and-price: integer programming with column generation. In: Floudas, C.A., Pardalos, P. (eds.) Encyclopedia of Optimization, pp. 218–221. Kluwer Academic Publishers, Dordrecht, Holland (2001)

    Chapter  Google Scholar 

  79. Schrage, L.: Optimization Modeling with LINGO. LINDO Systems, Inc., Chicago, IL (2006)

    Google Scholar 

  80. Vielma, J.P., Ahmed, S., Nemhauser, G.: Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions. Oper. Res. 53, 303–315 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Astronomy, University of Florida, Gainesville, FL, USA

    Josef Kallrath

Authors
  1. Josef Kallrath
    View author publications

    You can also search for this author in PubMed Google Scholar

14.1 Electronic Supplementary Material

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Kallrath, J. (2021). Polylithic Modeling and Solution Approaches. In: Business Optimization Using Mathematical Programming. International Series in Operations Research & Management Science, vol 307. Springer, Cham. https://doi.org/10.1007/978-3-030-73237-0_14

Download citation

Publish with us

Policies and ethics

Search

Navigation