Метод обернено-опуклого програмування та оптимальне пакування вантажів
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.
Gespeichert in:
| Datum: | 2019 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | Russisch |
| Veröffentlicht: |
The National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute"
2019
|
| Online Zugang: | http://journal.iasa.kpi.ua/article/view/172275 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Назва журналу: | System research and information technologies |
Institution
System research and information technologies| Zusammenfassung: | 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. |
|---|