Back to Search
Start Over
Finding a compromise solution to the transportation problem under uncertainty
- Source :
- Adaptivni Sistemi Avtomatičnogo Upravlinnâ, Vol 1, Iss 36 (2020)
- Publication Year :
- 2020
- Publisher :
- Igor Sikorsky Kyiv Polytechnic Institute, 2020.
-
Abstract
- The paper considers the solution of one combinatorial optimization problem under uncertainty. Its functional in deterministic formulation is a linear convolution of weights and arbitrary characteristics of a feasible solution. A constructive algorithm for its solving is a general linear programming problem solution algorithm. Under the uncertainty we mean the ambiguity of the weight values in the functional we optimize. We propose a new approach for finding a compromise solution by the criterion of minimizing the total weighted excess of “desirable” upper bounds on the optimal values of particular functionals. The basis of this approach is the construction and solution of some linear programming problem. We illustrate this approach on a transportation problem example in conditions of uncertainty. Ref. 15, tabl. 2
Details
- Language :
- English, Russian, Ukrainian
- ISSN :
- 15608956 and 25229575
- Volume :
- 1
- Issue :
- 36
- Database :
- Directory of Open Access Journals
- Journal :
- Adaptivni Sistemi Avtomatičnogo Upravlinnâ
- Publication Type :
- Academic Journal
- Accession number :
- edsdoj.59858e0c7c8c420398777fb98a77979e
- Document Type :
- article
- Full Text :
- https://doi.org/10.20535/1560-8956.36.2020.209764