Abstract
We present a more efficient version of the Active-Set-on-a-Graph (ASG) algorithm described in an earlier letter [1].
Original language | English |
---|---|
Pages (from-to) | 23-27 |
Number of pages | 5 |
Journal | Applied Mathematics Letters |
Volume | 7 |
Issue number | 5 |
DOIs | |
Publication status | Published - 1994 |
Externally published | Yes |
Keywords
- Active set methods
- Network optimization
- Nonlinear optimization
- Optimal control problems
- Original and relaxed controls
- Proper relaxation procedures
- Systems with time delays
- Two-commodity flow.