Discrete interception problem research by methods of polyhedral programming
The minimax and maximin problems of polyhedral programming with paymenting functions having the structure of polyhedral metric are discussed. The given results are used for research of the discrete multistep interception game. © 2000 IEEE.
Авторы
Filimonov A.B.
1
,
Filimonov N.B.2
Сборник материалов конференции
Издательство
Institute of Electrical and Electronics Engineers Inc.
Язык
Английский
Страницы
109-113
Статус
Опубликовано
Номер
913100
Год
2000
Организации
- 1 Russian Peoples' Friendship University, Russian Federation
- 2 Bauman Moscow State Technical University, Russian Federation
Ключевые слова
Interception problem; Maximin; Minimax; Multi-step; Electronics industry
Дата создания
19.10.2018
Дата изменения
19.10.2018