Abstract
Using a minmax approach, we establish saddle point optimality conditions and Lagrangian duality relations under generalized convexity hypotheses for a class of continuous-time programming problems with nonlinear operator equality and inequality constraints. We also discuss the implications of these results for differentiable problems.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
