Cart (Loading....) | Create Account
Close category search window

Application of the Bernstein form for reliable global optimization of mixed-integer problems in process synthesis and design

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Patil, B.V. ; IDP in Syst. & Control Eng., IIT Bombay, Mumbai, India ; Nataraj, P.S.V. ; Bhartiya, S.

In this paper, we present a Bernstein polynomial approach to optimally and reliably solve polynomial class of mixed-integer programming (MIP) problems. We use the Bernstein form in the branch-and-bound framework to compute a global optimum of MIPs. We present two application examples of MIPs: optimal pump configuration problem and trim loss minimization, to demonstrate the Bernstein polynomial approach.

Published in:

Reliability, Safety and Hazard (ICRESH), 2010 2nd International Conference on

Date of Conference:

14-16 Dec. 2010

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.