Abstract

AbstractA constrained minimum of a vector valued function is defined, in terms of an ordering cone. The definition chosen leads to a vector analog of the Kuhn‐Tucker theorem, and to a duality theorem where the dual problem has a vector valued objective function, and weak duality is defined by appropriate cone orderings. Also proved are a vector valued converse duality theorem, and a vector quasiduality theorem which does not require convexity. The results are related to perturbations of the objective function in a minimization problem.

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 call

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.