Skip to main content
Erschienen in: Optimization and Engineering 2/2014

01.06.2014

Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production

verfasst von: Armin Fügenschuh, Christine Hayn, Dennis Michaels

Erschienen in: Optimization and Engineering | Ausgabe 2/2014

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

The industrial treatment of waste paper in order to regain valuable fibers from which recovered paper can be produced, involves several steps of preparation. One important step is the separation of stickies that are normally attached to the paper. If not properly separated, remaining stickies reduce the quality of the recovered paper or even disrupt the production process. For the mechanical separation process of fibers from stickies a separator screen is used. This machine has one input feed and two output streams, called the accept and the reject. In the accept the fibers are concentrated, whereas the reject has a higher concentration of stickies. The machine can be controlled by setting its reject rate. But even when the reject rate is set properly, after just a single screening step, the accept still has too many stickies, or the reject too many fibers. To get a better separation, several separators have to be assembled into a network. From a mathematical point of view this problem can be seen as a multi-commodity network flow design problem with a nonlinear, controllable distribution function at each node. We present a nonlinear mixed-integer programming model for the simultaneous selection of the network’s topology and the optimal setting of each separator. Numerical results are obtained via different types of linearization of the nonlinearities and the use of mixed-integer linear solvers, and compared with state-of-the-art global optimization software.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Anhänge
Nur mit Berechtigung zugänglich
Literatur
Zurück zum Zitat Ahmed S, Vielma JP, Nemhauser G (2009) Mixed-integer models for nonseparable piecewise linear optimization: unifying framework and extensions. Oper Res 58(2):303–315 Ahmed S, Vielma JP, Nemhauser G (2009) Mixed-integer models for nonseparable piecewise linear optimization: unifying framework and extensions. Oper Res 58(2):303–315
Zurück zum Zitat Almin KE, Steenberg B (1954) The capacity problem in single series screen cascades—studies in screening theory ii. Sven Papperstidning 57(2):37–40 Almin KE, Steenberg B (1954) The capacity problem in single series screen cascades—studies in screening theory ii. Sven Papperstidning 57(2):37–40
Zurück zum Zitat Ballerstein M, Kienle A, Kunde C, Weismantel R, Michaels D Towards global optimization of combined distillation–crystallization processes for the separation of closely boiling mixtures. In: Pistikopoulos EN, Georgiadis MC, Kokossis AC (eds) 21th European Symposium on Computer Aided Process Engineering—ESCAPE 21. Elsevier, Amsterdam, 2011, pp 552–556 Ballerstein M, Kienle A, Kunde C, Weismantel R, Michaels D Towards global optimization of combined distillation–crystallization processes for the separation of closely boiling mixtures. In: Pistikopoulos EN, Georgiadis MC, Kokossis AC (eds) 21th European Symposium on Computer Aided Process Engineering—ESCAPE 21. Elsevier, Amsterdam, 2011, pp 552–556
Zurück zum Zitat Ballerstein M, Michaels D, Seidel-Morgenstern A, Weismantel R (2010) A theoretical study of continuous counter-current chromatography for adsorption isotherms with inflection points. Comp Chem Eng 34(4):447–459CrossRef Ballerstein M, Michaels D, Seidel-Morgenstern A, Weismantel R (2010) A theoretical study of continuous counter-current chromatography for adsorption isotherms with inflection points. Comp Chem Eng 34(4):447–459CrossRef
Zurück zum Zitat Ballerstein M, Michaels D, Vigerske S (2013) Linear underestimators for bivariate functions with a fixed convexity behavoir. Technical report, ZIB Report 13-02, Konrad-Zuse-Zentrum für Informationstechnik Berlin (Germany). (revision in preparation) Ballerstein M, Michaels D, Vigerske S (2013) Linear underestimators for bivariate functions with a fixed convexity behavoir. Technical report, ZIB Report 13-02, Konrad-Zuse-Zentrum für Informationstechnik Berlin (Germany). (revision in preparation)
Zurück zum Zitat Bartholdi JJ, Goldsman P (2001) Continuous spatial indexing of surfaces. Part 1: standard triangulations. Technical report, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia Bartholdi JJ, Goldsman P (2001) Continuous spatial indexing of surfaces. Part 1: standard triangulations. Technical report, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia
Zurück zum Zitat Bauer MH, Stichlmair J (1996) Struktursynthese und Optimierung nicht-idealer Rektifizierprozesse. Chemie Ingenieur Technik 68:911–916CrossRef Bauer MH, Stichlmair J (1996) Struktursynthese und Optimierung nicht-idealer Rektifizierprozesse. Chemie Ingenieur Technik 68:911–916CrossRef
Zurück zum Zitat Belotti P, Lee J, Liberti L, Margot F, Wächter A (2009) Branching and bounds tightening techniques for non-convex MINLP. Optim Methods Softw (Special Issue: GLOBAL OPTIMIZATION) 24(4–5):597–634CrossRefMATH Belotti P, Lee J, Liberti L, Margot F, Wächter A (2009) Branching and bounds tightening techniques for non-convex MINLP. Optim Methods Softw (Special Issue: GLOBAL OPTIMIZATION) 24(4–5):597–634CrossRefMATH
Zurück zum Zitat Benson HP (2004) On the construction of convex and concave envelope formulas for bilinear and fractional functions on quadrilaterals. Comput Optim Appl 27:5–22CrossRefMATHMathSciNet Benson HP (2004) On the construction of convex and concave envelope formulas for bilinear and fractional functions on quadrilaterals. Comput Optim Appl 27:5–22CrossRefMATHMathSciNet
Zurück zum Zitat Bergamini ML, Aguirre P, Grossmann IE (2005) Logic-based outer approximation for globally optimal synthesis of process networks. Comput Chem Eng 29:1914–1933CrossRef Bergamini ML, Aguirre P, Grossmann IE (2005) Logic-based outer approximation for globally optimal synthesis of process networks. Comput Chem Eng 29:1914–1933CrossRef
Zurück zum Zitat Bergamini ML, Grossmann IE, Scenna N, Aguirre P (2008) An improved piecewise outer-approximation algorithm for the global optimization of MINLP models involving concave and bilinear terms. Comput Chem Eng 32:477–493CrossRef Bergamini ML, Grossmann IE, Scenna N, Aguirre P (2008) An improved piecewise outer-approximation algorithm for the global optimization of MINLP models involving concave and bilinear terms. Comput Chem Eng 32:477–493CrossRef
Zurück zum Zitat Cameron SH (1966) Piece-wise linear approximations. Technical report, IIT Research Institute Cameron SH (1966) Piece-wise linear approximations. Technical report, IIT Research Institute
Zurück zum Zitat Dantzig G, Johnson S, White W (1959) A linear programming approach to the chemical equilibrium problem. Manag Sci 5:38–43CrossRefMathSciNet Dantzig G, Johnson S, White W (1959) A linear programming approach to the chemical equilibrium problem. Manag Sci 5:38–43CrossRefMathSciNet
Zurück zum Zitat Dantzig GB (1963) Linear programming and extensions. Princeton University Press, LondonMATH Dantzig GB (1963) Linear programming and extensions. Princeton University Press, LondonMATH
Zurück zum Zitat de Boor C (2001) A practical guide to splines. Springer, BerlinMATH de Boor C (2001) A practical guide to splines. Springer, BerlinMATH
Zurück zum Zitat Duran MA, Grossmann IE (1986) An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math Program 36:307–339CrossRefMATHMathSciNet Duran MA, Grossmann IE (1986) An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math Program 36:307–339CrossRefMATHMathSciNet
Zurück zum Zitat Floudas CA (1987) Separation synthesis of multicomponent feed streams into multicomponent product streams. AIChE J 33:540–550CrossRef Floudas CA (1987) Separation synthesis of multicomponent feed streams into multicomponent product streams. AIChE J 33:540–550CrossRef
Zurück zum Zitat Floudas CA (1995) Nonlinear and mixed-integer optimization. Fundamentals and applications. Oxford University Press, New YorkMATH Floudas CA (1995) Nonlinear and mixed-integer optimization. Fundamentals and applications. Oxford University Press, New YorkMATH
Zurück zum Zitat Franke M, Górak A, Strube J (2004) Auslegung und Optimierung von hybriden Trennverfahren. Chemie Ingenieur Technik 76:199–210CrossRef Franke M, Górak A, Strube J (2004) Auslegung und Optimierung von hybriden Trennverfahren. Chemie Ingenieur Technik 76:199–210CrossRef
Zurück zum Zitat Franke MB, Nowotny N, Ndocko EN, Górak A, Strube J (2008) Design and optimization of a hybrid distillation/melt-crystallization process. AIChE J 54(11):2925–2942CrossRef Franke MB, Nowotny N, Ndocko EN, Górak A, Strube J (2008) Design and optimization of a hybrid distillation/melt-crystallization process. AIChE J 54(11):2925–2942CrossRef
Zurück zum Zitat Frey T, Brusis D, Stichlmair J, Bauer MH, Glanz S (2000) Systematische Prozesssynthese mit Hilfe mathematischer Methoden. Chemie Ingenieur Technik 72:812–821CrossRef Frey T, Brusis D, Stichlmair J, Bauer MH, Glanz S (2000) Systematische Prozesssynthese mit Hilfe mathematischer Methoden. Chemie Ingenieur Technik 72:812–821CrossRef
Zurück zum Zitat Friedler F, Tarjan K, Huang YW, Fan LT (1993) Graph-theoretic approach to process synthesis: polynomial algorithm for maximal structure generation. Comput Chem Eng 17:929–942CrossRef Friedler F, Tarjan K, Huang YW, Fan LT (1993) Graph-theoretic approach to process synthesis: polynomial algorithm for maximal structure generation. Comput Chem Eng 17:929–942CrossRef
Zurück zum Zitat Fügenschuh A, Herty M, Klar A, Martin A (2006) Combinatorial and continuous models for the optimization of traffic flows on networks. SIAM J Optim 16:1155 – 1176CrossRefMATHMathSciNet Fügenschuh A, Herty M, Klar A, Martin A (2006) Combinatorial and continuous models for the optimization of traffic flows on networks. SIAM J Optim 16:1155 – 1176CrossRefMATHMathSciNet
Zurück zum Zitat Galor O (2006) Discrete dynamical systems. Springer, New York Galor O (2006) Discrete dynamical systems. Springer, New York
Zurück zum Zitat Gangadwala J, Kienle A, Haus U-U, Michaels D, Weismantel R (2006) Global bounds on optimal solutions for the production of 2,3-dimethylbutene-1. Ind Eng Chem Res 45(7):2261–2271CrossRef Gangadwala J, Kienle A, Haus U-U, Michaels D, Weismantel R (2006) Global bounds on optimal solutions for the production of 2,3-dimethylbutene-1. Ind Eng Chem Res 45(7):2261–2271CrossRef
Zurück zum Zitat Gavrilovic MM (1975) Optimal approximation of convex curves by functions which are piecewise linear. J of Math Anal Appl 52:260–282CrossRefMATHMathSciNet Gavrilovic MM (1975) Optimal approximation of convex curves by functions which are piecewise linear. J of Math Anal Appl 52:260–282CrossRefMATHMathSciNet
Zurück zum Zitat Geißler B, Martin A, Morsi A, Schewe L (2010) Using piecewise linear functions for solving MINLPs. In: IMA Volume on MINLP. Springer, Berlin Geißler B, Martin A, Morsi A, Schewe L (2010) Using piecewise linear functions for solving MINLPs. In: IMA Volume on MINLP. Springer, Berlin
Zurück zum Zitat Grossmann IE (1985) Mixed-integer programming approache for the synthesis of integrated process flowsheets. Comput Chem Eng 9:463–482CrossRef Grossmann IE (1985) Mixed-integer programming approache for the synthesis of integrated process flowsheets. Comput Chem Eng 9:463–482CrossRef
Zurück zum Zitat Grossmann IE, Aguirre PA, Barttfeld M (2005) Optimal synthesis of complex distillation columns using rigorous models. Comput Chem Eng 29:1203–1215CrossRef Grossmann IE, Aguirre PA, Barttfeld M (2005) Optimal synthesis of complex distillation columns using rigorous models. Comput Chem Eng 29:1203–1215CrossRef
Zurück zum Zitat Gürth DA (2007) Approximation von bivariaten Funktionen mittels Orthogonalitätsrelationen für lineare Splines. Master’s thesis, TU Darmstadt, Fachbereich Mathematik Gürth DA (2007) Approximation von bivariaten Funktionen mittels Orthogonalitätsrelationen für lineare Splines. Master’s thesis, TU Darmstadt, Fachbereich Mathematik
Zurück zum Zitat Hamman B, Chen J (1994) Data point selection for piecewise linear curve approximation. Comput Aided Geom Des 11(3):289–301CrossRef Hamman B, Chen J (1994) Data point selection for piecewise linear curve approximation. Comput Aided Geom Des 11(3):289–301CrossRef
Zurück zum Zitat Haus U-U, Michaels D, Seidel-Morgenstern A, Weismantel R (2007) A method to evaluate the feasibility of TMB chromatography for reduced efficiency and purity requirements based on discrete optimization. Comput Chem Eng 31(11):1525–1534CrossRef Haus U-U, Michaels D, Seidel-Morgenstern A, Weismantel R (2007) A method to evaluate the feasibility of TMB chromatography for reduced efficiency and purity requirements based on discrete optimization. Comput Chem Eng 31(11):1525–1534CrossRef
Zurück zum Zitat Heckl I, Kovacs Z, Friedler F, Fan LT (2003) Super-structure generation for separation network synthesis involving different separation methods. Chem Eng Trans 3:1209–1214 Heckl I, Kovacs Z, Friedler F, Fan LT (2003) Super-structure generation for separation network synthesis involving different separation methods. Chem Eng Trans 3:1209–1214
Zurück zum Zitat Imai H, Iri M (1986) An optimal algorithm for approximating a piecewise linear function. J Inf Process 9:159–162MATHMathSciNet Imai H, Iri M (1986) An optimal algorithm for approximating a piecewise linear function. J Inf Process 9:159–162MATHMathSciNet
Zurück zum Zitat Johnson EL, Nemhauser GL, Savelsbergh MWP (2000) Progress in linear programming-based algorithms for integer programming: an exposition. INFORMS J Comput 12(1):2–23CrossRefMATHMathSciNet Johnson EL, Nemhauser GL, Savelsbergh MWP (2000) Progress in linear programming-based algorithms for integer programming: an exposition. INFORMS J Comput 12(1):2–23CrossRefMATHMathSciNet
Zurück zum Zitat Keha AB, de Farias IR, Nemhauser GL (2004) Models for representing piecewise linear cost functions. Oper Res Lett 32(1):44–48CrossRefMATHMathSciNet Keha AB, de Farias IR, Nemhauser GL (2004) Models for representing piecewise linear cost functions. Oper Res Lett 32(1):44–48CrossRefMATHMathSciNet
Zurück zum Zitat Khajavirad A, Sahidinidis NV (2012) Convex envelopes of products of convex and component-wise concave functions. J Glob Optim 52:391–409CrossRefMATH Khajavirad A, Sahidinidis NV (2012) Convex envelopes of products of convex and component-wise concave functions. J Glob Optim 52:391–409CrossRefMATH
Zurück zum Zitat Khajavirad A, Sahinidis NV (2013) Convex envelopes generated from finitely many compact convex sets. Math Program Ser A 137:371–408CrossRefMATHMathSciNet Khajavirad A, Sahinidis NV (2013) Convex envelopes generated from finitely many compact convex sets. Math Program Ser A 137:371–408CrossRefMATHMathSciNet
Zurück zum Zitat Koch T(2004) Rapid mathematical programming. PhD thesis, Technische Universität Berlin. ZIB-Report 04-58 Koch T(2004) Rapid mathematical programming. PhD thesis, Technische Universität Berlin. ZIB-Report 04-58
Zurück zum Zitat Kraemer K, Kossack S, Marquardt W (2009) Efficient optimization-based design of distillation processes for homogeneous azeotropic mixtures. Ind Eng Chem Res 48:6749–6764CrossRef Kraemer K, Kossack S, Marquardt W (2009) Efficient optimization-based design of distillation processes for homogeneous azeotropic mixtures. Ind Eng Chem Res 48:6749–6764CrossRef
Zurück zum Zitat Kubat J, Steenberg B (1955) Screening at low particle concentrations—studies in screening theory III. Sven Papperstidning 58(9):319–324 Kubat J, Steenberg B (1955) Screening at low particle concentrations—studies in screening theory III. Sven Papperstidning 58(9):319–324
Zurück zum Zitat Lee GS (1982) Piecewise linear approximation of multivariate functions. Bell Syst Tech J 61:1463–1486CrossRefMATH Lee GS (1982) Piecewise linear approximation of multivariate functions. Bell Syst Tech J 61:1463–1486CrossRefMATH
Zurück zum Zitat Lee J, Wilson D (2001) Polyhedral methods for piecewise-linear functions. I: the lambda method. Discret Appl Math 108(3):269–285CrossRefMATHMathSciNet Lee J, Wilson D (2001) Polyhedral methods for piecewise-linear functions. I: the lambda method. Discret Appl Math 108(3):269–285CrossRefMATHMathSciNet
Zurück zum Zitat Linderoth J (2005) A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs. Math Program 103(2, Ser. B):251–282CrossRefMATHMathSciNet Linderoth J (2005) A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs. Math Program 103(2, Ser. B):251–282CrossRefMATHMathSciNet
Zurück zum Zitat Lowe JK (1984) Modelling with integer variables. PhD thesis, Georgia Institute of Technology Lowe JK (1984) Modelling with integer variables. PhD thesis, Georgia Institute of Technology
Zurück zum Zitat Manis G, Papakonstantinou G, Tsanakas P (1977) Optimal piecewise linear approximation of digitized curves. In: 13th International Conference on Digital Signal Processing Proceedings, DSP 97, Volume: 2. Dept. of Electr. & Comput. Eng., Nat. Tech. Univ. of Athens, IEEE Xplore, pp 1079-1081. doi:10.1109/ICDSP.1997.628552 Manis G, Papakonstantinou G, Tsanakas P (1977) Optimal piecewise linear approximation of digitized curves. In: 13th International Conference on Digital Signal Processing Proceedings, DSP 97, Volume: 2. Dept. of Electr. & Comput. Eng., Nat. Tech. Univ. of Athens, IEEE Xplore, pp 1079-1081. doi:10.​1109/​ICDSP.​1997.​628552
Zurück zum Zitat McCormick GP (1976) Computability of global solutions to factorable nonconvex programs. I: convex underestimating problems. Math Program 10:147–175CrossRefMATHMathSciNet McCormick GP (1976) Computability of global solutions to factorable nonconvex programs. I: convex underestimating problems. Math Program 10:147–175CrossRefMATHMathSciNet
Zurück zum Zitat Meyer CA, Floudas CA (2003) Trilinear monomials with positive or negative domains: facets of the convex and concave envelopes. In: Floudas Christodoulos A, Pardalos PM (eds) Frontiers in global optimization. Kluwer Academic Publishers, Dordrecht, pp 327–352 Meyer CA, Floudas CA (2003) Trilinear monomials with positive or negative domains: facets of the convex and concave envelopes. In: Floudas Christodoulos A, Pardalos PM (eds) Frontiers in global optimization. Kluwer Academic Publishers, Dordrecht, pp 327–352
Zurück zum Zitat Meyer CA, Floudas CA (2004) Trilinear monomials with mixed sign domains: facets of the convex and concave envelopes. J Glob Optim 29:125–155CrossRefMATHMathSciNet Meyer CA, Floudas CA (2004) Trilinear monomials with mixed sign domains: facets of the convex and concave envelopes. J Glob Optim 29:125–155CrossRefMATHMathSciNet
Zurück zum Zitat Moritz S (2006) A mixed integer approach for the transient case of gas network optimization. PhD thesis, TU Darmstadt, Fachbereich Mathematik Moritz S (2006) A mixed integer approach for the transient case of gas network optimization. PhD thesis, TU Darmstadt, Fachbereich Mathematik
Zurück zum Zitat Muraki M, Hayakawa T (1984) Separation process synthesis for multicomponent products. J Chem Eng Jpn 17:533CrossRef Muraki M, Hayakawa T (1984) Separation process synthesis for multicomponent products. J Chem Eng Jpn 17:533CrossRef
Zurück zum Zitat Muraki M, Hayakawa T (1987) Multicomponent product separation synthesis with separation sharpness. J Chem Eng Jpn 20:195–198CrossRef Muraki M, Hayakawa T (1987) Multicomponent product separation synthesis with separation sharpness. J Chem Eng Jpn 20:195–198CrossRef
Zurück zum Zitat Nath R, Motard RL (1981) Evolutionary synthesis of separation processes. AIChE J 27:578–587CrossRef Nath R, Motard RL (1981) Evolutionary synthesis of separation processes. AIChE J 27:578–587CrossRef
Zurück zum Zitat Nemhauser GL, Vielma JP (2008) Modeling disjunctive constraints with a logarithmic number of binary variables and constraints. Lecture Notes in Computer Science. vol 5035, pp 199–213. Springer, New York Nemhauser GL, Vielma JP (2008) Modeling disjunctive constraints with a logarithmic number of binary variables and constraints. Lecture Notes in Computer Science. vol 5035, pp 199–213. Springer, New York
Zurück zum Zitat Nemhauser GL, Wolsey LA (1988) Integer and combinatorial optimization. Wiley Interscience, New YorkMATH Nemhauser GL, Wolsey LA (1988) Integer and combinatorial optimization. Wiley Interscience, New YorkMATH
Zurück zum Zitat Nishida N, Stephanopoulos G, Westerberg AW (1981) A review of process synthesis. AIChE J 27:321–351CrossRef Nishida N, Stephanopoulos G, Westerberg AW (1981) A review of process synthesis. AIChE J 27:321–351CrossRef
Zurück zum Zitat Ortega JM (1972) Iterative solution of nonlinear equations in several variables. Academic Press, New York Ortega JM (1972) Iterative solution of nonlinear equations in several variables. Academic Press, New York
Zurück zum Zitat Pozo C, Guillén-Gosálbez G, Sorribas A, Jeménez L (2011) A spatial branch-and-bound framework for the global optimization of kinetic models of metabolic networks. Ind Eng Chem Res 50:5225–5238CrossRef Pozo C, Guillén-Gosálbez G, Sorribas A, Jeménez L (2011) A spatial branch-and-bound framework for the global optimization of kinetic models of metabolic networks. Ind Eng Chem Res 50:5225–5238CrossRef
Zurück zum Zitat Rockafellar RT (1970) Convex analysis. Princeton Landmarks in Mathematics. Princeton University Press, PrincetonMATH Rockafellar RT (1970) Convex analysis. Princeton Landmarks in Mathematics. Princeton University Press, PrincetonMATH
Zurück zum Zitat Rosenthal RE (1988) GAMS: A user’s guide. The Scientific Press, Redwood City Rosenthal RE (1988) GAMS: A user’s guide. The Scientific Press, Redwood City
Zurück zum Zitat Sahinidis NV, Tawarmalani M (2005) BARON 7.2.5: Global optimization of mixed-integer nonlinear programs Sahinidis NV, Tawarmalani M (2005) BARON 7.2.5: Global optimization of mixed-integer nonlinear programs
Zurück zum Zitat Schönberger C (2007) Linearization methods for the optimization of screening processes in the recovered paper production. Master’s thesis, TU Darmstadt Schönberger C (2007) Linearization methods for the optimization of screening processes in the recovered paper production. Master’s thesis, TU Darmstadt
Zurück zum Zitat Schwarz HR, Köckler N (2006) Numerische Mathematik. Teubner Verlag, WiesbadenMATH Schwarz HR, Köckler N (2006) Numerische Mathematik. Teubner Verlag, WiesbadenMATH
Zurück zum Zitat Skiborowski M, Harwardt A, Marquardt W (2013) Conceptual design of distillation-based hybrid separation processes. Ann Rev Chem Biomol Eng 4:45–68 Skiborowski M, Harwardt A, Marquardt W (2013) Conceptual design of distillation-based hybrid separation processes. Ann Rev Chem Biomol Eng 4:45–68
Zurück zum Zitat Steenberg B (1953) Principles of screening system design—studies in screening theory I. Sven Papperstidning 56:771–778 Steenberg B (1953) Principles of screening system design—studies in screening theory I. Sven Papperstidning 56:771–778
Zurück zum Zitat Tawarmalani M, Richard J-P, Xiong C (2013) Explicit convex and concave envelopes through polyhedral subdivisions. Math Program Ser A 138(1-2):531–578CrossRefMATHMathSciNet Tawarmalani M, Richard J-P, Xiong C (2013) Explicit convex and concave envelopes through polyhedral subdivisions. Math Program Ser A 138(1-2):531–578CrossRefMATHMathSciNet
Zurück zum Zitat Tawarmalani M, Sahinidis NV (2001) Semidefinite relaxations of fractional programs via novel convexification techniques. J Glob Optim 20:137–158CrossRefMATHMathSciNet Tawarmalani M, Sahinidis NV (2001) Semidefinite relaxations of fractional programs via novel convexification techniques. J Glob Optim 20:137–158CrossRefMATHMathSciNet
Zurück zum Zitat Tawarmalani M, Sahinidis NV (2002) Convex extensions and envelopes of lower semi-continuous functions. Math Program A 93:247–263CrossRefMATHMathSciNet Tawarmalani M, Sahinidis NV (2002) Convex extensions and envelopes of lower semi-continuous functions. Math Program A 93:247–263CrossRefMATHMathSciNet
Zurück zum Zitat Tawarmalani M, Sahinidis NV (2004) Global optimization of mixed-integer nonlinear programs: a theoretical and computational study. Math Program 99:563–591CrossRefMATHMathSciNet Tawarmalani M, Sahinidis NV (2004) Global optimization of mixed-integer nonlinear programs: a theoretical and computational study. Math Program 99:563–591CrossRefMATHMathSciNet
Zurück zum Zitat Tawarmalani M, Sahinidis NV (2005) A polyhedral branch-and-cut approach to global optimization. Math Program 103(2, Ser. B):225–249CrossRefMATHMathSciNet Tawarmalani M, Sahinidis NV (2005) A polyhedral branch-and-cut approach to global optimization. Math Program 103(2, Ser. B):225–249CrossRefMATHMathSciNet
Zurück zum Zitat The MathWorks. Matlab version 7.9 (R2009b), 2009 The MathWorks. Matlab version 7.9 (R2009b), 2009
Zurück zum Zitat Tomek I (1974) Two algorithms for piecewise-linear continuous approximation of functions of one variable. IEEE Trans Comput 23:445–448CrossRefMATH Tomek I (1974) Two algorithms for piecewise-linear continuous approximation of functions of one variable. IEEE Trans Comput 23:445–448CrossRefMATH
Zurück zum Zitat Tomlin JA (1981) A suggested extension of special ordered sets to nonseparable nonconvex programming problems. In: Studies on graphs and discrete programming (Brussels, 1979), volume 11 of Ann. Discrete Math., pp 359–370. North-Holland Tomlin JA (1981) A suggested extension of special ordered sets to nonseparable nonconvex programming problems. In: Studies on graphs and discrete programming (Brussels, 1979), volume 11 of Ann. Discrete Math., pp 359–370. North-Holland
Zurück zum Zitat Urselmann M, Barkmann S, Sand G, Engell S (2011) Optimization-based design of reactive distillation columns using a memetic algorithm. Comput Chem Eng 35:787–805CrossRef Urselmann M, Barkmann S, Sand G, Engell S (2011) Optimization-based design of reactive distillation columns using a memetic algorithm. Comput Chem Eng 35:787–805CrossRef
Zurück zum Zitat Valkama J-P (2006) Erabeitung eines Analysewerkzeugs für Altpapier verarbeitende Papierfabriken zur objektiven Bewertung der Grenzen der Stickyabtrennung durch Sortierprozesse. Abschlussbericht AiF-Projekt 18990 N. Technical report, Fachgebiet Papierfabrikation und Mechanische Verfahrenstechnik, TU Darmstadt Valkama J-P (2006) Erabeitung eines Analysewerkzeugs für Altpapier verarbeitende Papierfabriken zur objektiven Bewertung der Grenzen der Stickyabtrennung durch Sortierprozesse. Abschlussbericht AiF-Projekt 18990 N. Technical report, Fachgebiet Papierfabrikation und Mechanische Verfahrenstechnik, TU Darmstadt
Zurück zum Zitat Valkama J-P (2007) Optimisation of Low Consistency Fine Screening Processes in Recycled Paper Production, volume 1 of Fortschritt-Berichte Papiertechnik /Progress in Paper Technology 1. Shaker Valkama J-P (2007) Optimisation of Low Consistency Fine Screening Processes in Recycled Paper Production, volume 1 of Fortschritt-Berichte Papiertechnik /Progress in Paper Technology 1. Shaker
Zurück zum Zitat Vandewalle J (1975) On the calculation of the piecewise linear approximation to a discrete function. IEEE Trans Comput 24:843–846CrossRefMATH Vandewalle J (1975) On the calculation of the piecewise linear approximation to a discrete function. IEEE Trans Comput 24:843–846CrossRefMATH
Zurück zum Zitat Wilson DL (1998) Polyhedral methods for piecewise-linear functions. PhD thesis, University of Kentucky, Department of Mathematics Wilson DL (1998) Polyhedral methods for piecewise-linear functions. PhD thesis, University of Kentucky, Department of Mathematics
Zurück zum Zitat Wolsey LA (1998) Integer programming. Wiley Interscience, New YorkMATH Wolsey LA (1998) Integer programming. Wiley Interscience, New YorkMATH
Zurück zum Zitat Wunderling R (1996) Paralleler und objektorientierter Simplex-Algorithmus. PhD thesis, Technische Universität Berlin Wunderling R (1996) Paralleler und objektorientierter Simplex-Algorithmus. PhD thesis, Technische Universität Berlin
Metadaten
Titel
Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production
verfasst von
Armin Fügenschuh
Christine Hayn
Dennis Michaels
Publikationsdatum
01.06.2014
Verlag
Springer US
Erschienen in
Optimization and Engineering / Ausgabe 2/2014
Print ISSN: 1389-4420
Elektronische ISSN: 1573-2924
DOI
https://doi.org/10.1007/s11081-014-9249-7

Weitere Artikel der Ausgabe 2/2014

Optimization and Engineering 2/2014 Zur Ausgabe

    Marktübersichten

    Die im Laufe eines Jahres in der „adhäsion“ veröffentlichten Marktübersichten helfen Anwendern verschiedenster Branchen, sich einen gezielten Überblick über Lieferantenangebote zu verschaffen.