Vector continuous-time programming without differentiability

摘要

In this work continuous-time programming problems of vector optimization are considered. Firstly, a nonconvex generalized Gordan’s transposition theorem is obtained. Then, the relationship with the associated weighting scalar problem is studied and saddle point optimality results are established. A scalar dual problem is introduced and duality theorems are given. No differentiability assumption is imposed.