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
Сборник материалов конференции
2000 5th International Conference on Actual Problems of Electronic Instrument Engineering, APEIE 2000 - Proceedings, Devoted to the 50th Anniversary of Novosibirsk State Technical University
Издательство
Institute of Electrical and Electronics Engineers Inc.
Язык
Английский
Страницы
109-113
Статус
Опубликовано
DOI
10.1109/APEIE.2000.913100
Номер
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
Цитировать
ГОСТ MLA RIS BibTex
Поделиться

Другие записи