Continuous-time fractional minmax programming

Necessary and sufficient optimality conditions for a continous-time fractional minmax programming problem are derived. Subsequently, these optimality conditions are utilized as a basis for formulating a dual, and appropriate duality theorems are proved in the framework of generalized convex functionals.