Sufficient optimality criteria in continuous time programming

AbstractSufficient optimality conditions are obtained in the case of continuous time programming problems under the assumptions that (i) particular linear combinations of the components of the constraint function are quasiconvex and objective functional is pseudoconcave “almost everywhere,” (ii) a particular linear combination of constraint function and objective functional is pseudoconcave “almost everywhere”