Photo from academic.microsoft.com
Abstract This paper contains a generalized Gordan-type alternative theorem for set-valued maps which characterizes set relations without any convexity assumptions using certain evaluation functions. As a direct consequence and as… Click to show full abstract
Abstract This paper contains a generalized Gordan-type alternative theorem for set-valued maps which characterizes set relations without any convexity assumptions using certain evaluation functions. As a direct consequence and as a good example, we discuss robustness (or stability) of linear programming problems for modelling error. Moreover, this theorem can be utilized for that of general vector optimization problems in special cases due to reformation of the evaluation functions.
Keywords:
theorem set;
valued maps;
alternative theorem;
set valued;
set relations
Journal Title: Optimization
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!
Journal Title: Optimization
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!