2003
DOI: 10.1016/s0098-1354(03)00006-1
|View full text |Cite
|
Sign up to set email alerts
|

Erratum to “Dynamic optimization of batch processes I. Characterization of the nominal solution”

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
320
0
6

Year Published

2004
2004
2017
2017

Publication Types

Select...
7
1

Relationship

3
5

Authors

Journals

citations
Cited by 163 publications
(332 citation statements)
references
References 0 publications
0
320
0
6
Order By: Relevance
“…PMP and the introduction of the Hamiltonian function H(t) allow (i) assigning the NCO separately to path and terminal objectives, and (ii) expressing them in terms of meeting constraints and sensitivities, as illustrated in Table 4. The solution is generally discontinuous and consists of several intervals or arcs 73,75 . Each arc is characterized by a different set of active path constraints, that is, this set changes between successive arcs.…”
Section: Pontryagin's Minimum Principlementioning
confidence: 99%
“…PMP and the introduction of the Hamiltonian function H(t) allow (i) assigning the NCO separately to path and terminal objectives, and (ii) expressing them in terms of meeting constraints and sensitivities, as illustrated in Table 4. The solution is generally discontinuous and consists of several intervals or arcs 73,75 . Each arc is characterized by a different set of active path constraints, that is, this set changes between successive arcs.…”
Section: Pontryagin's Minimum Principlementioning
confidence: 99%
“…In the analysis of linear control problems one distinguishes three cases: bang-bang arcs, sensitivity-seeking arcs, and path-constrained arcs, [41], where an arc is defined to be a nonzero time-interval. Of course a problem's solution can show two or even all three behaviors at the same time on different arcs.…”
Section: Applicationsmentioning
confidence: 99%
“…The first-order necessary conditions of optimality (NCO) can be partitioned as follows (Srinivasan et al, 2003b):…”
Section: Measurement-based Optimization Via Nco-trackingmentioning
confidence: 99%
“…The optimal solution is typically discontinuous and characterized by various intervals that are either constraint-or sensitivity-seeking (Srinivasan et al, 2003b). The NCO-tracking scheme enforces the four conditions in (4), some on-line and the others over successive batches.…”
Section: Measurement-based Optimization Via Nco-trackingmentioning
confidence: 99%
See 1 more Smart Citation