# Category:Sensitivity-seeking arcs

We define sensitivity-seeking (also compromise-seeking) arcs in the sense of Srinivasan and Bonvin [Srinivasan2003]**Author: ** *Srinivasan, B.; Palanki, S.; Bonvin, D.***Journal: ** *Computers \& Chemical Engineering***Pages: ** *1--26***Title: ** *Dynamic Optimization of Batch Processes: I. Characterization of the Nominal Solution***Volume: ** *27***Year: ** *2003*

as arcs which are neither bang-bang nor path-constrained and for which the optimal control can be determined by time derivatives of the Hamiltonian. For control-affine systems this implies so-called *singular arcs*.

A classical small-sized benchmark problem for a sensitivity-seeking (singular) arc is the Lotka Volterra fishing problem. The treatment of sensitivity-seeking arcs is very similar to the one of path-constrained arcs. As above, an approximation up to any a priori specified tolerance is possible, probably at the price of frequent switching.

## References

[Srinivasan2003] | Srinivasan, B.; Palanki, S.; Bonvin, D. (2003): Dynamic Optimization of Batch Processes: I. Characterization of the Nominal Solution. Computers \& Chemical Engineering, 27, 1--26 |

## Pages in category "Sensitivity-seeking arcs"

The following 16 pages are in this category, out of 16 total.