2004
DOI: 10.1023/b:jogo.0000049091.73047.7e
|View full text |Cite
|
Sign up to set email alerts
|

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

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
20
0
1

Year Published

2006
2006
2020
2020

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 75 publications
(21 citation statements)
references
References 39 publications
0
20
0
1
Order By: Relevance
“…Current research focus is towards general non-linear models, for which recent results on global multi-parametric programming (Dua et al 2004) can be used; and general dynamic multi-level problems, for which a dynamic programming approach coupled with parametric programming can be applied (Faísca et al 2007a). …”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Current research focus is towards general non-linear models, for which recent results on global multi-parametric programming (Dua et al 2004) can be used; and general dynamic multi-level problems, for which a dynamic programming approach coupled with parametric programming can be applied (Faísca et al 2007a). …”
Section: Discussionmentioning
confidence: 99%
“…For the sake of clarity, the methodology is described using formulations with quadratic cost functions and linear constraints, however, it is applicable to general non-linear problems using suitable multi-parametric programming algorithms (Dua et al 2004). …”
Section: Proposed Methodologymentioning
confidence: 99%
“…Degenerate solutions are avoided. mp-NLP Dua et al [97]; Dua et al [99] Non-convex optimization. Generate convex overestimator and underestimator.…”
Section: Multi-parametric Moving Horizon Policiesmentioning
confidence: 99%
“…In terms of numerical and theoretical results of parameterized QIPs, an early computational study by McBride and Yormark [41] considers a sequence of 0-1 QIPs parameterized over the right-hand side of a single constraint. More recently, Dua et al [20] develops a global optimization algorithm for solving a general class of nonconvex mixed-integer programs parameterized over the right-hand sides of a set of possibly nonlinear constraints. Their proposed algorithmic approach utilizes convex under-and over-estimators within a generic branch-and-bound algorithm.…”
Section: Quadratic Integer Programmingmentioning
confidence: 99%