Abstract
Convex optimization can provide both global as well as local solution; in the case of non convex optimization, it is difficult to get global solution. This paper presents some optimality criteria for the non convex programming problem whose objective function is fuzzy pseudo convex functions.
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.
