Abstract
AbstractThe aim of this paper is to study optimality conditions for differentiable linearly constrained pseudoconvex programs. The stated results are based on new transversality conditions which can be used instead of complementarity ones. Necessary and sufficient optimality conditions are stated under suitable generalized convexity properties. Moreover, two different pairs of dual problems are proposed and weak and strong duality results proved. Finally, it is shown how transversality conditions can be applied to characterize optimality of convex quadratic problems and to efficiently solve a particular class of Max-Min problems
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.
