In this paper hitherto existing statements of duality for homogeneous programming will be represented. Then the authors deal with general problems of homogeneous non-linear programming min  .with   The degrees of the objectiv function and constraints, all homogenous, may be at choice. For such problems theorems of duality are deducted. Known results have been produced by specialization.