Consider the following problem related to entropy maximisation in information theory. For ease of solution you can solve the problem ignoring the non-negativity constraints on p and q and then verify that they are satisfied.
min p log P + q log q
subject to p+q =1
i. Solve the primal problem directly
ii. Obtain the dual problem and solve it. Verify it gives the same answer as the primal problem.
iii. By doing an internet search or looking up textbooks, explain why this problem would be
called an “entropy maximisation” problem.
It’s the most wonderful time of the year! There’ll be much hollying and jollying, but there will also be plenty…
APPROVED BY CLIENTS
There was many plagiarism mistakes but thankfully I requested it earlier than due. Really appreciative for this website for helping me to complete my research paper though with little work required from me. I made a 96 by the way! Thanks again!