Linear programming related to homogeneous programming
Homogeneous programming problems are optimization problems with positively homogeneous objective functions and positively homogeneous constraints. Every linear programming problem is represented as a homogeneous programming problem. In this paper, it is stated that every homogeneous programming problem is equivalent to a linear programming problem formulated in an infinite-dimensional space. Furthermore the author notes that Kretschmer's condition for the duality in linear programming problems gives a new condition for the duality in homogeneous programming problems, which is a slight generalization of Gwinner's one.
positively homogeneous objective functions
scientific article; zbMATH DE number 4154241