Abstract
We consider a mathematical programming problem on a Banach space, and we derive necessary conditions for optimality in Lagrange multiplier form. We prove further that “most mathematical programming problems are normal.” The novelty of our approach lies on the one hand in the absence of both differentiability and convexity hypotheses on the functions delimiting the problem, and on the other hand in the method of proof, which is new. The approach unifies the well-known smooth and convex cases besides treating a new general class of problems. The main analytical tool in this paper is an extension to infinite-dimensional spaces of the “generalized gradient” previously introduced by the author. The calculus of the generalized gradient is explored as a preliminary step.
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.
