« Previous « Start

References

[1]

J.E. Hoogenboom T. Illés E. de Klerk C. Roos A.J. Quist, R. van Geemert and T. Terlaky. Optimization of a nuclear reactor core reload pattern using nonlinear optimization and search heuristics. 1997.

[2]

N.I.M. Gould A.R. Conn and Ph.L. Toint. Lancelot: a fortran package for large-scale nonlinear optimization (release a). 1992.

[3]

N.I.M. Gould A.R. Conn and Ph.L. Toint. Methods for nonlinear constraints in optimization calculations. To appear in "The State of the Art in Numerical Analysis", I. Duff and G.A. Watson (eds.), 1996.

[4]

B. Borchers and J.E. Mitchell. An improved branch and bound algorithm for Mixed Integer Nonlinear Programming. Computers and Operations Research, 21, 1994.

[5]

B. Borchers and J.E. Mitchell. A computational comparison of branch and bound and outer approximation methods for 0-1 mixed integer nonlinear programs. Computers and Operations Research, 24, 1997.

[6]

R.J. Dakin. A tree search algorithm for mixed integer programming problems. Computer Journal, 8:250–255, 1965.

[7]

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

[8]

M. El-Hallabi and R.A. Tapia. An inexact trust-region feasible-point algorithm for nonlinear systems of equalities and inequalities. 1995.

[9]

R. Fletcher. Practical Methods of Optimization, 2^nd edition. 1987.

[10]

R. Fletcher and S. Leyffer. Solving mixed integer nonlinear programs by outer approximation. Mathematical Programming, 66:327–349, 1994.

[11]

R. Fletcher and S. Leyffer. Nonlinear programming without a penalty function. 1997.

[12]

R. Fletcher and S. Leyffer. User manual for filterSQP. 1998.

[13]

O.E. Flippo and A.H.G. Rinnoy Kan. Decomposition in general mathematical programming. Mathematical Programming, 60:361–382, 1993.

[14]

C.A. Floudas. Nonlinear and mixed–integer optimization. 1995.

[15]

A.M. Geoffrion. Generalized benders decomposition. Journal of Optimization Theory and Applications, 10:237–260, 1972.

[16]

I.E. Grossmann and Z. Kravanja. Mixed–integer nonlinear programming: A survey of algorithms and applications. 1997.

[17]

I.E. Grossmann and R.W.H. Sargent. Optimal design of multipurpose batch plants. Ind. Engng. Chem. Process Des. Dev., 18:343–348, 1979.

[18]

O.K. Gupta and A. Ravindran. Branch and bound experiments in convex nonlinear integer programming. Management Science, 31:1533–1546, 1985.

[19]

S.P. Han. A globally convergent method for nonlinear programming. Journal of Optimization Theory and Application, 22, 1977.

[20]

R. Horst and H. Tuy. A radial basis function method for global optimization. Global Optimization: Deterministic Approaches, 2^nd edition, 1993.

[21]

M. El-Alem J.E. Dennis and K.A. Williamson. A trust-region approach to nonlinear systems of equalities and inequalities. SIAM Journal on Optimization, 9:291–315, 1999.

[22]

G.R. Kocis and I.E. Grossmann. Global optimization of nonconvex mixed–integer nonlinear programming (MINLP) problems in process synthesis. Industrial Engineering Chemistry Research, 27:1407–1421, 1988.

[23]

A.H. Land and A.G Doig. An automatic method for solving discrete programming problems. Econometrica, 28:497–520, 1960.

[24]

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

[25]

M.J.D. Powell. A fast algorithm for nonlinearly constrained optimization calculations. In G.A. Watson, editor, Numerical Analysis, 1977, pages 144–157, 1978.

[26]

I. Quesada and I.E. Grossmann. An LP/NLP based branch–and–bound algorithm for convex MINLP optimization problems. Computers and Chemical Engineering, 16:937–947, 1992.

[27]

R.A. Stubbs and S. Mehrotra. A branch–and–cut method for 0–1 mixed convex programming. Technical report 96-01, Department of IE/MS, Northwestern University, Evanston, IL 60208, USA, 1996.

[28]

J. Isaksson T. Westerlund and I. Harjunkoski. Solving a production optimization problem in the paper industry. Report 95–146–A, Department of Chemical Engineering, Abo Akademi, Abo, Finland, 1995.

[29]

J. Viswanathan and I.E. Grossmann. Optimal feed location and number of trays for distillation columns with multiple feeds. 32:2942–2949, 1993.

[30]

R.B. Wilson. A simplicial algorithm for concave programming. 2001.

[31]

Y. Yuan. Trust region algorithms for nonlinear equations. 1994.

« Previous « Start