Abstract
First-order necessary conditions of the Kuhn-Tucker type and strong duality are established for a general class of continuous time programming problems. To obtain these results a generalized Farkas' Theorem, stated in terms of convex and dual cones, is implemented in conjunction with a constraint qualification analogous to that found in finite-dimensional programming. The assumptions imposed are weaker than those needed in previous approaches to duality for this type of problem.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
