Title :
Discrete interception problem research by methods of polyhedral programming
Author :
Filimonov, A.B. ; Filimonov, N.B.
Author_Institution :
Russian Peoples´ Friendship Univ.
Abstract :
The minimax and maximin problems of polyhedral programming with cost functions having the structure of polyhedral metric are discussed. The results are used for research on the discrete multistep interception game
Keywords :
convex programming; differential games; minimax techniques; convex polyhedrons; cost functions; discrete multistep interception game; gambling problems; guaranteed prediction error; maximin problems; minimax problems; polyhedral metric; polyhedral programming; Electronic mail; Functional programming; Level set; Minimax techniques; Proposals;
Conference_Titel :
Electronic Instrument Engineering Proceedings, 2000. APEIE-2000. Volume 1. 2000 5th International Conference on Actual Problems of
Conference_Location :
Novosibirsk
Print_ISBN :
0-7803-5903-8
DOI :
10.1109/APEIE.2000.913100
