An attainbility of optimal solutions of the Lexicographical Knapsack Optimization Problem with alternative criteria
The method of finding of attainable optimum solutions of lexicographic knapsack problem with alternative criteria by reducing it to the problem of onecriterion optimization with a scalar objective function is considered.
Main Authors: | A. Ю. Брила, В. I. Гренджа |
---|---|
Format: | Article |
Language: | English |
Published: |
State University “Uzhhorod National University”
2017-06-01
|
Series: | Науковий вісник Ужгородського університету. Серія: Математика і інформатика |
Online Access: | http://visnyk-math.uzhnu.edu.ua/article/view/144032 |
Similar Items
-
On solving a Lexicographic-Lexicographical Optimization Problem with interval coefficients and alternative criteria
by: А. Ю. Брила
Published: (2019-12-01) -
On solving a Lexicographic Optimization Problem with interval coefficients and alternative criteria
by: А. Ю. Брила
Published: (2019-07-01) -
On lexicographic optimization problem with interval parameters
by: А. Ю. Брила
Published: (2018-06-01) -
Knapsack Problem Solution based on Knapsack Packing Tree Search
by: Mikhail Andreevich Kupriyashin, et al.
Published: (2014-02-01) -
FINDING OF OPTIMAL SUBSET STRUCTURE IN THE KNAPSACK PROBLEM
by: S. V. Chebakov, et al.
Published: (2019-10-01)