Skip to main content
SpringerLink
Log in

Solving Large MINLPs on Computational Grids

  • Published:
Optimization and Engineering Aims and scope Submit manuscript

Abstract

We consider the solution of Mixed Integer Nonlinear Programming (MINLP) problems by a parallel implementation of nonlinear branch-and-bound on a computational grid or meta-computer. Computational experience on a set of large MINLPs is reported which indicates that this approach is efficient for the solution of these problems.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • I. Akrotirianakis, I. Maros, and B. Rustem, “An outer approximation based branch-and-cut algorithm for convex 0–1 MINLP problems,” Technical Report 2000–06, Department of Computing, Imperial College, London, June 2002.

    Google Scholar 

  • I. P. Androulakis and C. A. Floudas, “Distributed branch and bound algorithms for global optimization,” in Parallel Processing of Discrete Problems, P. Pardalos, ed., vol. 106 of The IMA Volumes in Mathematics and Its Applications. Springer: New York, 1999.

    Google Scholar 

  • K. Anstreicher, N. Brixius, J. P. Goux, and J. Linderoth, “Solving large quadratic assignment problems on computational grids,” Mathematical Programming vol. 91, no. 3, pp. 563–588, 2002.

    Google Scholar 

  • B. Borchers and J. E. Mitchell, “An improved branch and bound algorithm for mixed integer nonlinear programming,” Computers and Operations Research vol. 21, no. 4, pp. 359–367, 1994.

    Google Scholar 

  • Q. Chen and M. Ferris, “FATCOP: A fault tolerant condor-PVM mixed integer program solver,” Technical Report, University of Wisconsin, 1999.

  • Q. Chen, M. Ferris, and J. Linderoth, “FATCOP 2.0: Advanced features in an opportunistic mixed integer programming solver,” Annals of Operations Research vol. 103, pp. 17–32, 2001.

    Google Scholar 

  • A. R. Conn, N. I. M. Gould, and Ph. L. Toint, “Methods for nonlinear constraints in optimization calculations,” in The State of the Art in Numerical Analysis, I. Duff and G. A.Watson, eds., Oxford University Press, pp. 363–390, 1997.

  • R. J. Dakin, “A tree search algorithm for mixed integer programming problems,” Computer Journal vol. 8, pp. 250–255, 1965.

    Google Scholar 

  • M. Duran and I. E. Grossmann, “An outer-approximation algorithm for a class of mixed-integer nonlinear programs,” Mathematical Programming vol. 36, pp. 307–339, 1986.

    Google Scholar 

  • J. Eckstein, “Parallel branch-and-bound algorithms for general mixed integer programming on the CM-5,” SIAM Journal on Optimization vol. 4, no. 4, pp. 794–814, 1994.

    Google Scholar 

  • R. Fletcher, N. I. M. Gould, S. Leyffer, and Ph. L. Toint, “Global convergence of trust-region SQP-filter algorithms for general nonlinear programming,” Report 99/03, Department of Mathematics, University of Namur, 61, rue de Bruxelles, B-5000 Belgium, November 1999.

    Google Scholar 

  • R. Fletcher and S. Leyffer, “User manual for filterSQP,” Numerical Analysis Report NA/181, Dundee University, April 1998.

  • R. Fletcher, S. Leyffer, and Ph. L. Toint, “On the global convergence of an SLP-filter algorithm,” Numerical Analysis Report NA/183, University of Dundee, UK, August 1998.

    Google Scholar 

  • C. A. Floudas, P. A. Pardalos, C. S. Adjiman, W. R. Esposito, Z. H. Gumus, S. T. Harding, J. L. Klepeis, C. A. Meyer, and C. A. Schweiger, “Nonconvex optimization and its applications,” in Handbook of Test Problems in Local and Global Optimization. Kluwer Academic Publishers: Dordrecht, 1999. Test problems in GAMS available at titan.princeton.edu/TestProblems/.

    Google Scholar 

  • R. Fourer, D. M. Gay, and B. W. Kernighan, “AMPL: A Modelling Language for Mathematical Programming,” Boyd & Fraser: Massachusetts, 1993.

    Google Scholar 

  • GAMS, “The GAMS model library index,” Technical Report, also available at www.gams.com/modlib/ modlib.htm, 2000a.

  • GAMS, “GAMS MINLP world,” available at www-page, http://www.gamsworld.org/minlp/, 2000b.

  • GAMS, GAMS/SBB User Notes, March 2001.

  • D. M. Gay, “Automatic differentiation of nonlinear AMPL models,” in Automatic Differentiation of Algorithms: Theory, Implementation, and Application, A. Griewank and G. F. Corliss, eds., SIAM Proceedings, SIAM: Philadelphia, pp. 61–73, 1991.

    Google Scholar 

  • A. M. Geoffrion, “Generalized Benders decomposition,” Journal of Optimization Theory and Applications vol. 10, pp. 237–260, 1972.

    Google Scholar 

  • J.-P. Goux, S. Kulkarni, J. Linderoth, and M. Yoder, “An enabling framework for master-worker applications on the computation grid,” in Cluster Computing, pp. 43–50, 2000a. Proceedings of the Ninth IEEE Symposium on High Performance Distributed Computing (HPDC9).

  • J.-P. Goux, J. Linderoth, and M. Yoder, “Metacomputing and the master-worker paradigm,” Preprint MCS/ANL P792–0200, Computer Science Division, Argonne National Laboratory, USA, February 2000b.

    Google Scholar 

  • I. E. Grossmann, “Reviewof nonlinear mixed-integer and disjunctive programming techniques for process systems engineering,” Technical Report, Chemical Engineering Department, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA, June 2001.

    Google Scholar 

  • I. E. Grossmann and Z. Kravanja, “Mixed-integer nonlinear programming: A survey of algorithms and applications,” in Large-Scale Optimization with Applications, Part II: Optimal Design and Control, A. R. Conn, L. T. Biegler, T. F. Coleman, and F. N. Santosa, eds., Springer: New York, 1997.

    Google Scholar 

  • O. K. Gupta and A. Ravindran, “Branch and bound experiments in convex nonlinear integer programming,” Management Science vol. 31, pp. 1533–1546, 1985.

    Google Scholar 

  • I. Harjunkoski, “Application of MINLP methods to a scheduling problem in the paper-converting industry,” Ph.D. Thesis, Process Design Laboratory, Department of Chemical Engineering, Åbo Akademi, Finland, 1997.

    Google Scholar 

  • I. Harjunkoski, T. Westerlund, R. Pörn, and H. Skrifvars, “Different transformations for solving non-convex trim-loss problems by MINLP,” European Journal of Operational Research vol. 105, pp. 594–603, 1998.

    Google Scholar 

  • V. Jain and I. E. Grossmann, “Cyclic scheduling of continuous parallel-process units with decaying performance,” AIChE Journal vol. 44, pp. 1623–1636, 1998.

    Google Scholar 

  • A. H. Land and A. G. Doig, “An automatic method for solving discrete programming problems,” Econometrica vol. 28, pp. 497–520, 1960.

    Google Scholar 

  • P. S. Laursen, “Simple approaches to parallel branch and bound,” Parallel Computing vol. 19, pp. 143–152, 1993.

    Google Scholar 

  • P. S. Laursen, “Can parallel branch and bound without communication be effective?” SIAM J. Optimization vol. 4, no. 2, pp. 288–296, 1994.

    Google Scholar 

  • S. Leyffer, User Manual for MINLP BB, University of Dundee, 1998.

  • S. Leyffer, “Integrating SQP and branch-and-bound for mixed integer nonlinear programming,” Computational Optimization & Applications vol. 18, pp. 295–309, 2001.

    Google Scholar 

  • S. Leyffer, “MacMINLP: AMPL collection of mixed integer nonlinear programs,” Technical Report, University of Dundee. Also available at www.maths.dundee.ac.uk/~sleyffer/MacMINLP/, July 2000.

  • J. T. Linderoth and M.W. P. Savelsbergh, “A computational study of search strategies for mixed integer programming,” INFORMS Journal of Computing vol. 11, pp. 173–187, 1998.

    Google Scholar 

  • J. T. Linderoth and S. J. Wright, “Decomposition algorithms for stochastic programming on a computational grid,” Preprint P875–0401, MCS Division, Argonne National Laboratory, USA, April 2001.

    Google Scholar 

  • M. Livny, J. Basney, R. Raman, and T. Tannenbaum, “Mechanisms for high-throughput computing,” in Speedup 11, 1997. Available at http://www.cs.wisc.edu/condor/doc/htc mech.ps.

  • J. F. Pekny and D. L. Miller, “A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems,” Mathematical Programming vol. 55, no. 1, pp. 17–33, 1992.

    Google Scholar 

  • J. Pruyne and M. Livny, “Interfacing condor and PVM to harness the cycles of workstation clusters,” Journal on Future Generations of Computer Systems vol. 12, pp. 53–65, 1996.

    Google Scholar 

  • A. J. Quist, “Application of mathematical optimization techniques to nuclear reactor reload pattern design,” Ph.D. Thesis, Thomas Stieltjes Institute for Mathematics, Technische Universiteit Delft, The Netherlands, 2000.

    Google Scholar 

  • A. J. Quist, R. van Geemert, J. E. Hoogenboom, T. Illés, E. de Klerk, C. Roos, and T. Terlaky, “Optimization of a nuclear reactor core reload pattern using nonlinear optimization and search heuristics,” Draft paper, Department of Operation Research, Faculty of Applied Mathematics, Delft University of Technology, Mekelweg 4, 2628 CD Delft, The Netherlands, September 1997.

    Google Scholar 

  • N. V. Sahinidis, “BARON: A general purpose global optimization software package,” Journal of Global Optimization vol. 8, no. 2, pp. 201–205, 1996.

    Google Scholar 

  • E. A. Silver and I. Moon, “A fast heuristic for minimizing total average cycle stock subject to practical constraints,” Journal Operations Research Society vol. 50, pp. 789–796, 1999.

    Google Scholar 

  • R. A. Stubbs and S. Mehrotra, “A branch-and-cut method for 0–1 mixed convex programming,” Mathematical Programming vol. 86, pp. 515–532, 1999.

    Google Scholar 

  • F. Tin-Loi, “Modelling bar space truss design as MINLPs,” Private communication, University of New South Wales, April 2000.

  • O. V. Volkovich, V. A. Roshchin, and I. V. Sergienko, “Models and methods of solution of quadratic integer programming problems,” Cybernetics vol. 23, pp. 289–305, 1987.

    Google Scholar 

  • T. Westerlund and F. Pettersson, “An extended cutting plane method for solving convex MINLP problems,” Computers and Chemical Engineering Supplement vol. 19, pp. S131–S136, 1995. ESCAPE-95.

    Google Scholar 

  • H. P. Williams, Model Solving in Mathematical Programming, John Wiley & Sons: Chichester, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Artelys, 215 rue Jean-Jacques Rousseau, 92136, Issy-les-Moulineaux Cedex, France

    J.-P. Goux

  2. MCS Division, Argonne National Laboratory, 9700 South Cass Avenue, Argonne, IL, 60439, USA

    S. Leyffer

Authors
  1. J.-P. Goux
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Leyffer
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Goux, JP., Leyffer, S. Solving Large MINLPs on Computational Grids. Optimization and Engineering 3, 327–346 (2002). https://doi.org/10.1023/A:1021047328089

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1021047328089

Search

Navigation