DUALITY IN HOMOGENEOUS PROGRAMMING
CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER
Pagination or Media Count:
The problem of maximizing a concave function subject to linear constraints does not have a dual, as is the case in linear programming, in which primal optimizing variables do not appear. As a special case of the principal result it follows that such a dual does indeed exist whenever the objective function is also homogeneous.
- Numerical Mathematics