作者: G.J Zalmai
DOI: 10.1016/0022-247X(90)90216-3
关键词:
摘要: Abstract Using a minmax approach, we establish saddle point optimality conditions and Lagrangian duality relations under generalized convexity hypotheses for class of continuous-time programming problems with nonlinear operator equality inequality constraints. We also discuss the implications these results differentiable problems.