ON ONE CLASS OF MULTI-CRITERIA TRANSPORT-TYPE QUADRATIC PROGRAMMING PROBLEMS |
6 | |
2009 |
scientific article | 519.847 | ||
178-183 | multi-criteria quadratic programming, lexicographic convolution, algorithm with an О ( |
A specific class of multi-criteria quadratic programs of practical application is considered. An approximate algorithm based on the direct search of an optimal node of a multidimensional multivalued cube is proposed in case of lexicographic convolution of particular optimality criteria [1]. For the case of additive compression, a particular case of the problem has been considered, for which an algorithm with a О ( |
![]() |