Method of inverse-convex programming and optimal goods packing


  • V. V. Ostapenko
  • L. A. Sobolenko
  • I. V. Prokhorovich


Formalization of the problem for optimal goods packing for an airplane is proposed. To solve the problem, the method of inverse-convex programming is used. Numerical calculations of test and real problems are presented.

Author Biographies

V. V. Ostapenko

Ostapenko V.V.

L. A. Sobolenko

Sobolenko L.A.

I. V. Prokhorovich

Prokhorovich I.V.



Methods of optimization, optimum control and theory of games