Class Of Continuous-time Programming Problems Research Articles

Optimality conditions and duality for a class of continuous-time programming problems with nonlinear operator equality and inequality constraints

Using a minmax approach, we establish saddle point optimality conditions and Lagrangian duality relations under generalized convexity hypotheses for a class of continuous-time programming problems with nonlinear operator equality and inequality constraints. We also discuss the implications of these results for differentiable problems.