Let P-n be a path with n vertices. In this article, we use linear programming to obtain two sharp lower bounds for the optimal (1, t)-pebbling number of P-n and then determine the exact value if t is even or t = 1 or t >= [n/2] - 1. (C) 2021 Elsevier B.V. All rights reserved.