Vector continuous-time programming without differentiability (Q966105)

Multicriterial continuous-time optimization problems are investigated under the assumption that the functions are preinvex. For such problems a generalized Gordan's theorem on the alterative is derived. Moreover it is shown that properly efficient solutions can be computed using the well-known scalarization approach of multicriterial optimization. Moreover, properly efficient solutions are characterized using saddle-point and Karush-Kuhn-Tucker conditions. The paper is concluded with weak and strong duality results.