0
$\begingroup$

Can someone please help me with this question, I don't even know where to start.

enter image description here

For part bi) I think the answer is

$ minimise \sum_{i=1}^{m} x_{i} = \frac{1}{v} subject to \sum_{i=1}^{m}a_{ij} x_{i} \geq 1 $

don't know how to write the LP for player B?

And i have no idea how to do part (bii) Please could anyone help me with this part.

$\endgroup$
  • $\begingroup$ If A wants to maximize their minimum value, then B wants to minimize the maximum value (because that value is for A). $\endgroup$ – The Chaz 2.0 Jan 2 '18 at 22:43
  • $\begingroup$ How do I get $ p* = v(A^{T})^{-1}u $ $\endgroup$ – italy Jan 2 '18 at 23:18
  • $\begingroup$ Can you please post the problem as text (instead of pasting an image) so that future visitors can at least search for this question using a search engine? $\endgroup$ – Gaurang Tandon Jan 3 '18 at 1:27

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.