Apply the Charnes-Cooper transformation to any feasible point of :Thenso is feasible for , andIn particular, the given solution of produces a feasible point of with the same objective value, so
Moreover, because every , the equation impliesThe 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.
Codex Wiki