Global Optimization Issues in Multiparametric Continuous and Mixed-Integer Optimization Problems

Authors:
V. Dua;K. P. Papalexandri;E. N. Pistikopoulos
Affiliations:
Centre for Process Systems Engineering, Department of Chemical Engineering, Imperial College, London SW7 2BY, U.K.;BP Exploration, Research and Engineering Centre, U.K.;Centre for Process Systems Engineering, Department of Chemical Engineering, Imperial College, London SW7 2BY, U.K. E-mail: e.pistikopoulos@ic.ac.uk, Tel: +442075946620, Fax: +4420 ...
Venue:
Journal of Global Optimization
Year:
2004

Citing 4
Cited 5

GAMS, a user's guide

ACM SIGNUM Newsletter
A Reduced Space Branch and Bound Algorithm for Globaloptimization

Journal of Global Optimization
Deterministic Global Optimization: Theory, Methods and (NONCONVEX OPTIMIZATION AND ITS APPLICATIONS Volume 37) (Nonconvex Optimization and Its Applications)

Deterministic Global Optimization: Theory, Methods and (NONCONVEX OPTIMIZATION AND ITS APPLICATIONS Volume 37) (Nonconvex Optimization and Its Applications)
The explicit linear quadratic regulator for constrained systems

Automatica (Journal of IFAC)

A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems

Journal of Global Optimization
A review of recent advances in global optimization

Journal of Global Optimization
Global optimization of multi-parametric MILP problems

Journal of Global Optimization
An integer programming approach for optimal drug dose computation

Computer Methods and Programs in Biomedicine
On the global solution of multi-parametric mixed integer linear programming problems

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a number of theoretical and algorithmic issues concerning the solution of parametric nonconvex programs are presented. In particular, the need for defining a suitable overestimating subproblem is discussed in detail. The multiparametric case is also addressed, and a branch and bound (B&B) algorithm for the solution of parametric nonconvex programs is proposed.