Abstract
AbstractThe Fritz John necessary conditions for optimality of a differentiable nonlinear programming problem have been shown, given additional convexity hypotheses, to be also sufficient (by Gulati, Craven, and others). This sufficiency theorem is now extended to minimization (suitably defined) of a function taking values in a partially ordered space, and to (convex) objective and constraint functions which are not always differentiable. The results are expressed in terms of subgradients.
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 callMore From: The Journal of the Australian Mathematical Society. Series B. Applied Mathematics
Disclaimer: 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.
