Synthesis, Presynthesis, Sufficient Conditions for Optimality and Subanalytic Sets

Author(s):  
H. J. Sussmann
2002 ◽  
Vol 65 (2) ◽  
pp. 289-306 ◽  
Author(s):  
Nguyen Xuan Ha ◽  
Do Van Luu

Under suitable assumptions we establish the formulas for calculating generalised gradients and generalised directional derivatives in the Clarke sense of the supremum and the infimum of an infinite family of Lipschitz functions. From these results we derive the results ensuring such a supremum or infimum are an invex function when all functions of the invex. Applying these results to a class of mathematical programs, we obtain necessary and sufficient conditions for optimality.


1974 ◽  
Vol 6 (04) ◽  
pp. 622-635 ◽  
Author(s):  
R. Morton ◽  
K. H. Wickwire

A control scheme for the immunisation of susceptibles in the Kermack-McKendrick epidemic model for a closed population is proposed. The bounded control appears linearly in both dynamics and integral cost functionals and any optimal policies are of the “bang-bang” type. The approach uses Dynamic Programming and Pontryagin's Maximum Principle and allows one, for certain values of the cost and removal rates, to apply necessary and sufficient conditions for optimality and show that a one-switch candidate is the optimal control. In the remaining cases we are still able to show that an optimal control, if it exists, has at most one switch.


Sign in / Sign up

Export Citation Format

Share Document