EXCHANGE ALGORITHM OF BIEXTREMAL SOLUTION TO HOMOGENEOUS ALLOCATION PROBLEM
An effective algorithm of constructing optimal solutions to homogeneous allocation problems is developed. It is called a biextremal solution algorithm because it permits to find the distribution carrying an extremum to two popular distribution evaluations simultaneously: uniformity of distribution c...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
Don State Technical University
2011-06-01
|
| Series: | Advanced Engineering Research |
| Subjects: | |
| Online Access: | https://www.vestnik-donstu.ru/jour/article/view/775 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | An effective algorithm of constructing optimal solutions to homogeneous allocation problems is developed. It is called a biextremal solution algorithm because it permits to find the distribution carrying an extremum to two popular distribution evaluations simultaneously: uniformity of distribution criterion and minimax criterion. The principle of its operation consists in formalizing structure transformation of the core-image matrix derived by Romanovsky’s algorithm with further formalized rearrangement of tasks between their executors. An example of incremental solution to the particular problem is provided. |
|---|---|
| ISSN: | 2687-1653 |