Abstract
AbstractIn this note, the weak duality theorem of symmetric duality in nonlinear programming and some related results are established under weaker (strongly Pseudo-convex/strongly Pseudo-concave) assumptions. These results were obtained by Bazaraa and Goode [1] under (stronger) convex/concave assumptions on the function.
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 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.
