Abstract
Multivalued functions satisfying a general convexity condition are examined in the first section. The second section establishes a general transposition theorem for such functions and develops an abstract multiplier principle for them. In particular both convex inequality and linear equality constraints are seen to satisfy the same generalized constraint qualification. The final section examines quasi-convex programmes.
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.
