source: trunk/Bonmin/doc/BONMIN_UsersManual.tex @ 1

Last change on this file since 1 was 1, checked in by andreasw, 13 years ago

imported initial code

File size: 3.3 KB
Line 
1\documentclass{article}
2\usepackage[colorlinks=true]{hyperref}
3\usepackage{html}
4\usepackage{lscape}
5\usepackage{amsmath,amssymb}
6\usepackage{threeparttable}
7
8\usepackage{bonmin}
9
10
11\title{\Bonmin\ Users' Manual}
12\author{Pierre Bonami and Jon Lee}
13
14
15\begin{document}
16\maketitle
17
18\input{BOUM_Intro}
19
20\input{BOUM_Obtain}
21
22\input{BOUM_Install}
23
24\input{BOUM_use}
25
26\input{BOUM_options}
27%\section{{\Bonmin} output}
28%\Bonmin uses a number of optimization tools ({\
29%tt Ipopt}, {\tt Cbc}, {\tt Clp}, \ldots) which all have there own output.
30%As a consequence the output is very diverse and may be a little difficult to read.\\
31%
32%The output level for each of the building blocks of \Bonmin can be set through options (see Appendix \ref{app:opt_loglevel})
33%Here we briefly describes the output given at the different log level for each of those building blocks.
34%\subsection{BB\_log_level}
35%This corresponds to the output from the main branch-and-bound process in B-BB, B-QG, B-Hyb
36%(this is not available in the B-OA).
37%The output here comes from {\tt Cbc}, and each line of output has the prefix {\tt Cbc} and is followed by a number indicating the message type.
38%
39%\subsection{
40\begin{thebibliography}{10}
41
42
43\bibitem{Betal}
44P.~Bonami, A.~W\"achter, L.T.~Biegler, A.R.~Conn, G.~Cornu\'ejols,
45I.E.~Grossmann, C.D.~Laird, J.~Lee, A.~Lodi, F.~Margot and
46N.~Sawaya.
47\newblock An algorithmic framework for convex mixed integer nonlinear programs. IBM Research Report RC23771, Oct. 2005.
48
49\bibitem{Gupta80Nonlinear}
50O.K.~Gupta and V.~Ravindran.
51\newblock Branch and bound experiments in convex nonlinear integer programming.
52\newblock {\em Management Science}, 31:1533--1546, 1985.
53
54%\bibitem{fiacco} A.V.~Fiacco.
55%\newblock Introduction to Sensitivity and
56%    Stability Analysis in Nonlinear Programming.
57%\newblock {\em Academic Press, New
58%  York} (1983)
59
60\bibitem{DG}
61M.~Duran and I.E.~Grossmann.
62\newblock An outer-approximation algorithm for a class of mixed-integer nonlinear programs.
63\newblock {\em Mathematical Programming}, 36:307--339, 1986.
64
65\bibitem{FL}
66R.~Fletcher and S.~Leyffer.
67\newblock Solving mixed integer nonlinear programs by outer approximation.
68\newblock {\em Mathematical Programming}, 66:327--349, 1994.
69
70\bibitem{QG}
71I.~Quesada and I.E.~Grossmann.
72\newblock An {LP/NLP} based branched and bound algorithm for convex {MINLP} optimization problems.
73\newblock {\em Computers and Chemical Engineering}, 16:937--947, 1992.
74
75\bibitem{AMPL}
76R.~Fourer and D.M.~Gay and B.W.~Kernighan.
77\newblock AMPL: A Modeling Language for Mathematical
78Programming, Second Edition,
79\newblock Duxbury Press Brooks Cole Publishing Co., 2003.
80
81\bibitem{Gay}
82D.M.~Gay.
83\newblock Writing \texttt{\bf .nl} files.
84\newblock Sandia National Laboratories, Technical Report No. 2005-7907P, 2005.
85
86\bibitem{NocedalAdaptive}
87J.~Nocedal, A.~W\"achter, and R.~A. Waltz.
88\newblock Adaptive Barrier Strategies for Nonlinear Interior Methods.
89\newblock Research Report RC 23563, IBM T. J. Watson Research Center, Yorktown, USA (March 2005; revised January 2006)
90
91\bibitem{AndreasIpopt}
92A.~W\"achter and L.~T.~Biegler.
93\newblock On the Implementation of a Primal-Dual Interior Point Filter Line Search Algorithm for Large-Scale Nonlinear Programming.
94\newblock Mathematical Programming 106(1), pp. 25-57, 2006
95\end{thebibliography}
96
97\appendix
98\section{List of \Bonmin\ options}
99\label{sec:optList}
100\input{options}
101
102
103\end{document}
Note: See TracBrowser for help on using the repository browser.