Skip to main content

From the Problem to its Mathematical Formulation

  • Chapter
  • First Online:
Business Optimization Using Mathematical Programming

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

  • 1128 Accesses

Abstract

This chapter will cover the fundamentals of modeling problems such as the one introduced in the previous chapter but now with a view to modeling and solving much larger problems. By modeling we mean taking all the features of the original industrial or commercial problem and encapsulating the ideas in it as a mathematical programming problem. We aim for a one-to-one correspondence between the original problem and the model.

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

Access this chapter

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.

    In the LP community variables are also called activities or just columns.

  2. 2.

    Maple is a registered trademark of Waterloo Maple Inc.

  3. 3.

    MathCAD is a registered trademark of MathSoft, Inc.

  4. 4.

    Conventionally variables with zero coefficients are omitted from the expression, so not all variables are necessarily present in the expression. Also a coefficient of 1.0 is conventionally not shown next to its associated variable, i.e., 1x is written as x.

  5. 5.

    Modelers in the refinery industry call these constraints quality constraints. Quality constraints describe concentrations, sulfur content in streams and similar quantities. These constraints, which are always related to properties of streams or materials, might also be called property constraints.

  6. 6.

    A minimization problem has been chosen as the standard form; since any maximization problem can be formulated as a minimization problem, this is not a limitation.

  7. 7.

    Often a feasible point is also called feasible solution. We do not want to do this in this book because the aim of optimization is to determine the optimal point, or in case of ambiguity also optimal points, and therefore only those can be regarded as a solution.

  8. 8.

    LOTUS 1-2-3 is a registered trademark of Lotus Development Corp.

  9. 9.

    EXCEL is a registered trademark of Microsoft Corp.

  10. 10.

    What’s Best? is a registered trademark of Lindo Systems Inc.

  11. 11.

    LINDO is a registered trademark of Lindo Systems Inc.

  12. 12.

    MS-EXCEL is a registered trademark of Microsoft Corp.

  13. 13.

    The DISKDATA command for reading text data is supported by mp-model’s successor FICO Xpress Mosel by FICO. Just LOTUS is probably not much used these days.

References

  1. Dantzig, G.B.: Linear Programming and Extensions. Princeton University Press, Princeton, NJ (1963)

    Book  Google Scholar 

  2. Eley, M.: A bottleneck assignment approach to the multiple container loading problem. OR Spectrum 25, 113–130 (2003)

    Article  Google Scholar 

  3. Floudas, C.A.: Deterministic Global Optimization: Theory, Methods and Applications. Kluwer Academic Publishers, Dordrecht (2000)

    Book  Google Scholar 

  4. Floudas, C.A., Gounaris, C.E.: A review of recent advances in global optimization. J. Glob. Optim. 45, 3–38 (2009)

    Article  Google Scholar 

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

    Article  Google Scholar 

  6. Harding, S.T., Floudas, C.A.: Locating heterogeneous and reactive azeotropes. Ind. Eng. Chem. Res. 39, 1576–1595 (2000)

    Article  Google Scholar 

  7. Helber, S.: Operations Management Tutorial. S. Helber (2014). https://books.google.de/books?id=HUTioQEACAAJ

  8. Horst, R., Pardalos, P.M. (eds.): Handbook of Global Optimization. Kluwer Academic Publishers, Dordrecht (1995)

    Google Scholar 

  9. Ierapetriou, M.G., Floudas, C.A.: Effective continuous-time formulation for short-term scheduling. 1. Multipurpose batch processes. Ind. Eng. Chem. Res. 37, 4341–4359 (1998)

    Google Scholar 

  10. Ierapetriou, M.G., Floudas, C.A.: Effective continuous-time formulation for short-term scheduling. 2. Continuous and semicontinuous processes. Ind. Eng. Chem. Res. 37, 4360–4374 (1998)

    Google Scholar 

  11. Ierapetriou, M.G., Hene, T.S., Floudas, C.A.: Continuous time formulation for short-term scheduling with multiple intermediate due dates. Ind. Eng. Chem. Res. 38, 3446–3461 (1999)

    Article  Google Scholar 

  12. Kalan, J.E.: Aspects of large-scale in-core linear programming. In: ACM Annual Conference Proceedings 1971 and Chicago, pp. 304–313. ACM, New York (1971)

    Google Scholar 

  13. Karmarkar, N.: A new polynomial time algorithm for linear programming. Combinatorica 4, 375–395 (1984)

    Article  Google Scholar 

  14. Khachian, L.G.: A polynomial algorithm in linear programming. Sov. Math. Dokl. 20, 191–194 (1979)

    Google Scholar 

  15. Klee, V., Minty, G.J.: How good is the simplex algorithm? In: Shisha, O. (ed.) Inequalities III, pp. 159–175. Academic Press, New York (1972)

    Google Scholar 

  16. Lin, X., Floudas, C.A.: Design, synthesis and scheduling of multipurpose batch plants via an effective continuous-time formulation. Comput. Chem. Eng. 25, 665–674 (2001)

    Article  Google Scholar 

  17. Lin, X., Floudas, C.A., Modi, S., Juhasz, N.M.: Continuous-time optimization approach for medium-range production scheduling of a multiproduct batch plant. Ind. Eng. Chem. Res. 41, 3884–3906 (2002)

    Article  Google Scholar 

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

    Article  Google Scholar 

  19. Mitchell, G.: The Practice of Operational Research. Wiley, Chichester (1993)

    Google Scholar 

  20. Padberg, M.: Linear Optimization and Extensions. Springer, Berlin, Heidelberg (1996)

    Google Scholar 

  21. Rebennack, S., Nahapetyan, A., Pardalos, P.M.: Bilinear modeling solution approach for fixed charged network flow problems. Optim. Lett. 3, 347–355 (2009)

    Article  Google Scholar 

  22. Suhl, L., Mellouli, T.: Optimierungssysteme: Modelle, Verfahren, Software, Anwendungen. Springer, Berlin, Heidelberg (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

2.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). From the Problem to its Mathematical Formulation. 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_2

Download citation

Publish with us

Policies and ethics