(i) Objective function
She wants to maximise the total distance travelled:
Maximise Z=x+y
(ii) Constraints
Diesel cost: 2x+5y≤100
Time (at most one hour): 25x+40y≤1, i.e. 8x+5y≤200
Non-negativity: x≥0, y≥0
(iii) Graph of the feasible region
The line 2x+5y=100 passes through A(50,0) and B(0,20). The line 25x+40y=1 passes through C(25,0) and D(0,40). Both inequalities are satisfied by O(0,0), so the feasible region lies on the origin side of both lines, in the first quadrant.

The two lines meet at E. Subtracting 2x+5y=100 from 8x+5y=200 gives 6x=100, so
x=350,y=5100−2x=340
The feasible region is the shaded quadrilateral OCEB, which is bounded.
(iii) OR — Corner points and maximum value
| Corner point | Z=x+y |
|---|
| O(0,0) | 0 |
| C(25,0) | 25 |
| E(350,340) | 30 (maximum) |
| B(0,20) | 20 |
Answer: the maximum value of Z is 30, at E(350,340). Seema can travel at most 30 km in one hour, going 350 km at 25 km/h and 340 km at 40 km/h.