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.

Authors
Filimonov A.B. 1 , Filimonov N.B.2
Conference proceedings
2000 5th International Conference on Actual Problems of Electronic Instrument Engineering, APEIE 2000 - Proceedings, Devoted to the 50th Anniversary of Novosibirsk State Technical University
Publisher
Institute of Electrical and Electronics Engineers Inc.
Language
English
Pages
109-113
Status
Published
DOI
10.1109/APEIE.2000.913100
Number
913100
Year
2000
Organizations
  • 1 Russian Peoples' Friendship University, Russian Federation
  • 2 Bauman Moscow State Technical University, Russian Federation
Keywords
Interception problem; Maximin; Minimax; Multi-step; Electronics industry
Cite
ГОСТ MLA RIS BibTex
Share

Other records