On the Nonemptiness and Boundedness of Solution Sets of Weakly Homogeneous Optimization Problems
Abstract: In this paper, we introduce a new class of optimization problems whose objective functions are weakly homogeneous relative to the constraint sets. By using the normalization argument in asymptotic analysis, we prove two criteria for the nonemptiness and boundedness of the solution set of a weakly homogeneous optimization problem. Moreover, the normalization argument enables us to study the existence and stability of the solution sets of linearly parametric optimization problems. Several examples are given to illustrate the derived results.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.