Method of inverse-convex programming and optimal goods packing

Authors

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

Abstract

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.

Downloads

Issue

No. 2 (2004)

Section

Methods of optimization, optimum control and theory of games

License

This is an open access journal which means that all content is freely available without charge to the user or his/her institution. Users are allowed to read, download, copy, distribute, print, search, or link to the full texts of the articles in this journal without asking prior permission from the publisher or the author. This is in accordance with the BOAI definition of open access.