This paper proposes a linear programming approach for onboard optimization of rocket trajectories, motivated by the need for reliable and computationally efficient trajectory optimization methods in real-time applications. To reformulate rocket trajectory optimization problems within a linear programming framework, a polytopal approximation method is developed. The polytopal approximation method approximates the thrust magnitude constraint using a set of artificial variables and linear constraints. Compared with a state-of-the-art approximation method, the polytopal approximation method demonstrates a higher accuracy-to-size ratio, enabling rocket trajectory optimization problems to be cast into linear subproblems without significantly increasing problem sizes. As linear subproblems can be readily solved by linear programming solvers, the proposed trajectory optimization approach inherits the solver’s reliability and computational efficiency, making it potentially useful for critical onboard applications. An ascent trajectory optimization problem is provided as an illustrative example to demonstrate the effectiveness of the proposed linear programming approach.