Homepage › Solution manuals › Dimitris Bertsimas › Introduction to Linear Optimization › Exercise 1.6 (Rocket control)
Exercise 1.6 (Rocket control)
Provide linear programming formulations of the two variants of the rocket control problem discussed at the end of Section 1.3.
Answers
First model. The first option described in the Section 1.3 is to minimize the total fuel consumption:
| (1) |
As shown in the previous exercise, for each , we can equivalently introduce nonnegative dummies and replace every occurrence of with and every occurrence of with . The resulting linear optimization problem is then the following:
Second model. The second option suggested in the book is to minimize the maximum thrust that is required for the rocket:
| (2) |
We can move the maximum function to the constraints section by writing
In a manner similar to the previous exercise, we replace by the double condition and :