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.