New optimality conditions in vector continuous-time programming

Abstract

In this work vector continuous-time programming problem with inequality constraints is considered. The necessary and sufficient optimality conditions under generalized concavity assumptions are established. The results were formulated using differentiability.

A Constant Rank-type Constraint Qualification for Multi-Objective Continuous-Time Nonlinear Programming

“…More recently, Jović [4] presented necessary and sufficient optimality conditions under generalized concavity (quasiconcavity and pseudoconcavity) for vector continuous-time programming using the Mangasarian-Fromovitz constraint qualification given by Monte and de Oliveira [7]. In [5], Jović and Marinković derived zero order optimality conditions under convexity assumptions.…”