• DocumentCode
    2990786
  • Title

    Discrete interception problem research by methods of polyhedral programming

  • Author

    Filimonov, A.B. ; Filimonov, N.B.

  • Author_Institution
    Russian Peoples´ Friendship Univ.
  • fYear
    2000
  • fDate
    2000
  • Firstpage
    109
  • Lastpage
    113
  • 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;
  • fLanguage
    English
  • Publisher
    ieee
  • 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
  • Type

    conf

  • DOI
    10.1109/APEIE.2000.913100
  • Filename
    913100
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2990786