Question

Consider the linear programming model for player 1 given near the end of Sec. 15.5 for variation 3 of the political campaign problem (see Table 15.6). Verify the optimal mixed strategies for both players given in Sec. 15.5 by applying an automatic routine for the simplex method to this model to find both its optimal solution and its optimal dual solution.


$1.99
Sales0
Views23
Comments0
  • CreatedSeptember 22, 2015
  • Files Included
Post your question
5000