Global Optimization in Engineering Design
Mathematical Programming has been of significant interest and relevance in engineering, an area that is very rich in challenging optimization problems. In particular, many design and operational problems give rise to nonlinear and mixed-integer nonlinear
- PDF / 31,028,001 Bytes
- 390 Pages / 439.758 x 668.432 pts Page_size
- 36 Downloads / 195 Views
Nonconvex Optimization and Its Applications Volume 9
Managing Editors: Panos Pardalos University ofFlorida, U.S.A.
Reiner Horst University of Trier, Germany
Advisory Board: Ding-ZhuDu University ofMinnesota, U.S.A.
C. A. Floudas Princeton University, U.S.A.
G.lnfanger Stariford University, U.S.A.
J. Mockus Lithuanian Academy of Sciences, Lithuania H. D. Sherali Virginia Polytechnic Institute and State University, U.S.A.
I. E. Grossmann Carnegie Mellon University
The titles published in this series are listed at the end ofthis volume.
Global Optimization in Engineering Design Edited by
Ignacio E. Grossmann Carnegie Mellon University
SPRINGER-SCIENCE+BUSINESS MEDIA, B.V.
Library of Congress Cataloging-in-Publication Data Global optimization in engineering design 1 edited by Ignacio E. Grossmann. p. cm. --
v.
ISBN 978-1-4419-4754-3 ISBN 978-1-4757-5331-8 (eBook) DOI 10.1007/978-1-4757-5331-8
1. Chemical engineering--Mathematics. 2. Mathematical optimization. 3. Nonlinear programming. I. Grossmann, Ignacio E. II. Series. TP149.G55 1996 620' .0042'015197--dc20 95-48887
ISBN 978-1-4419-4754-3
Printed on acid-free paper
AU Rights Reserved © 1996 Springer Science+Business Media Dordrecht Originally published by Kluwer Academic Publishers in 1996
No part of the material protected by this copyright notice may be reproduced or utilized in any form or by any means, electronic or mechanical, including photocopying, recording or by any information storage and retrieval system, without written permission from the copyright owner.
TABLE OF CONTENTS Preface .....................................................
vii
1. Branch and Bound for Global NLP: New Bounding LP T. G. W. Epperly and R. E. Swaney ....................................... 1 2. Branch and Bound for Global NLP: Iterative LP Algorithm Be Results T. G. W. Epperly and R. E. Swaney ..................................... 37 3. New Formulations and Branching Strategies for the GOP Algorithm V. Visweswaran and C. A. Floudas ....................................... 75 4. Computational Results for an Efficient Implementation of the GOP Algorithm and Its Variants V. Visweswaran and C. A. Floudas ...................................... Ul 5. Solving Nonconvex Process Optimisation Problems Using Interval Subdivision Algorithms R. P. Byrne and I. D. L. Bogle .......................................... 155 6. Global Optimization of Nonconvex MINLP's by Interval Analysis R. Vaidyanathan and M. EI-Halwagi .................................... 175 7. Planning of Chemical Process Networks via Global Concave Minimization M.-L. Liu, N. V. Sahinidis and J. Parker Shecttnan ...•.................... 195 8. Global Optimization for Stochastic Planning, Scheduling and Design Problems M. G. Ierapetritou and E. N. Pistikopoulos .............................. 231 9. Global Optimization of Heat Exchanger Networks with Fixed Configuration for Multiperiod Design R. R. Iyer and I. E. Grossmann ......................................... 289 10. Alternative Bounding Approximations
