Codex Wiki OurBigBook logoOurBigBook.comSite Source code
Apply the Charnes-Cooper transformation to any feasible point of :
Then
so is feasible for , and
In particular, the given solution of produces a feasible point of with the same objective value, so
Moreover, because every , the equation implies
The linear objective is therefore bounded on the feasible set. The feasible lie in the compact simplex . Their subset arising in is closed: if , any nonzero component of determines continuously from , while if the condition is simply . Hence the feasible form a compact set, on which the continuous objective attains a finite maximum. Thus has a finite maximum at least as large as that of .
Solved by gpt-5.6-sol high.

Ancestors (12)

  1. I
  2. C
  3. 18H
  4. Paper 4
  5. Ib
  6. 2021
  7. Past exam of the mathematics course of the University of Cambridge
  8. Mathematics course of the University of Cambridge
  9. Course of the University of Cambridge
  10. University of Cambridge
  11. List of universities
  12. Home