Skip to main content

MINLP: Trim-loss Problem

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Keywords

Problem Formulation

Linear Transformations

Parameterization Methods

Convex Transformations

  Exponential Transformation

  Square-Root Transformation

  Logarithmic and Square-Root Transformation

  Inverted Transformation

  Modified Square-Root Transformation

Example: A Numerical Problem

Conclusions

Notation

See also

References

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.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

References

  1. Adjiman CS, Androulakis IP, Floudas CA (1997) Global optimization of MINLP problems in process synthesis and design. Comput Chem Eng 21:S445–S450

    Google Scholar 

  2. Dakin RJ (1965) A tree search algorithm for mixed integer programming problems. Comput J 8:250–255

    Article  MathSciNet  MATH  Google Scholar 

  3. Gilmore PC, Gomory RE (1961) A linear programming approach to the cutting-stock problem. Oper Res 9:849–859

    Article  MathSciNet  MATH  Google Scholar 

  4. Haessler RW (1971) A heuristic programming solution to a non-linear cutting stock problem. Managem Sci 17:B793–B802

    Google Scholar 

  5. Harjunkoski I, Pörn R, Westerlund T, Skrifvars H (1997) Different strategies for solving bilinear integer problems with convex transformations. Comput Chem Eng 21:S487–S492

    Google Scholar 

  6. Harjunkoski I, Westerlund T, Isaksson J, Skrifvars H (1996) Different formulations for solving trim-loss problems in a paper converting mill with ILP. Comput Chem Eng 20:S121–S126

    Article  Google Scholar 

  7. Hinxman AI (1980) The trim-loss and assortment problems: A survey. Europ J Oper Res 5:8–18

    Article  MathSciNet  MATH  Google Scholar 

  8. Johnston RE (1986) Rounding algorithms for cutting stock problems. Asia–Pacific J Oper Res 3:166–171

    MATH  Google Scholar 

  9. Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671–680

    Article  MathSciNet  Google Scholar 

  10. Skrifvars H, Harjunkoski I, Westerlund T, Kravanja Z, Pörn R (1996) Comparison of different MINLP methods applied on certain chemical engineering problems. Comput Chem Eng 20:S333–S338

    Article  Google Scholar 

  11. Smith EMB, Pantelides CC (1997) Global optimization of nonconvex MINLPs. Comput Chem Eng 21:S791–S796

    Google Scholar 

  12. Westerlund T, Pettersson F (1995) An extended cutting plane method for solving convex MINLP problems. Comput Chem Eng 19:S131–S136

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Harjunkoski, I., Pörn, R., Westerlund, T. (2008). MINLP: Trim-loss Problem . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_387

Download citation

Publish with us

Policies and ethics