Key points are not available for this paper at this time.
Two effective methods of solving linear differential games of pursuit are constructed. These methods are based on a number of constructions connected with convex sets. Two specific pursuit processes are investigated by means of the results obtained. The paper is a complete exposition of results given in the author's notes in Soviet Math. Dokl. 8 (1967), 769-771 and 910-912 (MR 37 #1173). Bibliography: 2 titles.
Lev S. Pontrjagin (Thu,) studied this question.