The problem of the simple pursuit of an object in a plane by two other objects is considered. It is assumed that the pursuers' maximum velocities satisfy different bounds, while the evader moves at most as rapidly as the slower pursuer. The duration of the game is fixed. The payoff functional is the distance between the evader and the nearest pursuer at the end of the game. Without using the explicit form of the programmed maximin function, it is proved that the function is u-stable throughout the space, i.e., it is identical with the value of the differential game. It is also proved that the programmed absorption time equals the optimum response time. In a previous paper /1/, an optimum solution was found for this approach-game problem when the pursuers' velocities are bounded by the same quantity. This paper continues the investigations of /1–3/. The optimum response problem was solved in /4/ for the case of identical pursuers. The formalization of differential games employed here is that of /5–7/.