Sven Leyffer  Home/Search
Context Related
| mcs.dundee.ac.uk:8080/~sl...BB_SQP.ps.Z maths.dundee.ac.uk/~sleyf...BB_SQP.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mcs.dundee.ac.uk:8080/~sleyffe... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper considers the solution of Mixed Integer Nonlinear Programming (MINLP) problems. Classical methods for the solution of MINLP problems decompose the problem by separating the nonlinear part from the integer part. This approach is largely due to the existence of packaged software for solving Nonlinear Programming (NLP) and Mixed Integer Linear Programming problems. In contrast, an integrated approach to solving MINLP problems is considered here. This new algorithm is based on... (Update)
Context of citations to this paper: More
.... continuous multiproduct plants [9] Al gorithms for solving MINLP problems include the following: Branch and Bound (BB) see [3] 10] and [15]) Outer Approximation (OA) see [6] 7] and [26] Generalized Benders Decomposition (GBD) 8] Extended Cutting Plane (ECP) 24]...
...in solving subproblem UB = max j UB j end while The root node is the problem with the integer restrictions relaxed. For more details consult [1, 4, 8]. When dealing with semi continuous variables, we need to change just a few things. A variable x k is considered...
Cited by: More
Branch-And-Bound Methods For An Minlp Model With.. - Kalvelagen (2003) (Correct)
Generalized Convex Disjunctive Programming: Nonlinear Convex.. - Grossmann, Lee (2001) (Correct)
Active bibliography (related documents): More All
0.8: Numerical experience with lower bounds for MIQP branch-and-bound - Fletcher, Leyffer (1995) (Correct)
0.6: Nonlinear Programming without a penalty function - Fletcher, Leyffer (2000) (Correct)
0.5: Nonlinear and Mixed-Integer Optimization in Chemical.. - Adjiman, Schweiger.. (Correct)
Similar documents based on text: More All
0.8: Mixed-Integer Nonlinear Programming - Armin (Correct)
0.7: Review of Nonlinear Mixed-Integer and Disjunctive Programming.. - Grossmann (2002) (Correct)
0.5: GAMS/DICOPT: A Discrete Continuous Optimization Package - Jagadisan (Correct)
Related documents from co-citation: More All
2: An improved branch and bound algorithm for mixed integer nonlinear programs (context) - Borchers, Mitchell - 1991
2: Branch and bound experiments in convex nonlinear integer programing (context) - Gupta, Ravindran - 1985
BibTeX entry: (Update)
Leyffer S., Integrating SQP and branch-and-bound for Mixed Integer Nonlinear Programming. Computational Optimization and Applications 18, (2001) 295-309. http://citeseer.ist.psu.edu/leyffer98integrating.html More
@article{ leyffer01integrating,
author = "S. Leyffer",
title = "Integrating {SQP} and branch-and-bound for mixed integer nonlinear programming",
journal = "Computational Optimization and Applications",
volume = "18",
pages = "295--309",
year = "2001",
url = "citeseer.ist.psu.edu/leyffer98integrating.html" }
Citations (may not include all citations):686 Practical Methods of Optimization (context) - Fletcher - 1987
125 LANCELOT: a Fortran package for large-scale nonlinear optimi.. (context) - Conn, Gould et al. - 1992
64 Global Optimization: Deterministic Approaches (context) - Horst, Tuy - 1993
58 Nonlinear programming without a penalty function - Fletcher, Leyffer - 1997
35 An outer-approximation algorithm for a class of mixed-- inte.. (context) - Duran, Grossmann - 1986
34 Generalized benders decomposition (context) - Geoffrion - 1972
33 A globally convergent method for nonlinear programming (context) - Han - 1977
25 An automatic method for solving discrete programming problem.. (context) - Land, Doig - 1960
17 An improved branch and bound algorithm for Mixed Integer Non.. (context) - Borchers, Mitchell - 1994
14 Branch and bound experiments in convex nonlinear integer pro.. (context) - Gupta, Ravindran - 1985
12 A tree search algorithm for mixed integer programming proble.. (context) - Dakin - 1965
9 A branch--and--cut method for 0--1 mixed convex programming (context) - Stubbs, Mehrotra - 1996
9 A simplicial algorithm for concave programming (context) - Wilson - 1963
7 Global optimization of nonconvex mixed--integer nonlinear pr.. (context) - Kocis, Grossmann - 1988
7 Solving mixed integer nonlinear programs by outer approximat.. - Fletcher, Leyffer - 1994
6 Mixed--integer nonlinear programming: A survey of algorithms.. (context) - Grossmann, Kravanja - 1997
4 Decomposition in general mathematical programming (context) - Flippo, Rinnoy - 1993
4 NLP based branch--and--bound algorithm for convex MINLP opti.. (context) - Quesada, Grossmann - 1992
4 Models and methods of solution of quadratic integer programm.. (context) - Volkovich, Roshchin et al. - 1987
3 Numerical Analysis Report NA (context) - Fletcher, Leyffer - 1998
3 A comparison of branch and bound and outer approximation met.. (context) - Borchers, Mitchell - 1995
2 The State of the Art in Numerical Analysis (context) - Conn, Gould et al. - 1996
1 Optimal feed location and number of trays for distillation c.. (context) - Viswanathan, Grossmann - 1993
1 Solving a production optimization problem in the paper indus.. (context) - Westerlund, Isaksson et al. - 1995
1 Optimal design of multipurpose batch plants (context) - Grossmann, Sargent - 1979
Documents on the same site (http://www.mcs.dundee.ac.uk:8080/~sleyffer/): More
Generalized Outer Approximation - Leyffer (Correct)
Nonlinear Programming without a penalty function - Fletcher, Leyffer (1998) (Correct)
On the Global Convergence of an SLP-Filter Algorithm - Fletcher, Leyffer, Toint (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC