Метод обернено-опуклого програмування та оптимальне пакування вантажів
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.
Saved in:
Date: | 2019 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | rus |
Published: |
The National Technical University of Ukraine "Igor Sikorsky Kyiv Polytechnic Institute"
2019
|
Online Access: | http://journal.iasa.kpi.ua/article/view/172275 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Journal Title: | System research and information technologies |