solve the game by linear programming, Mathematics

UA and DU are preparing for the NCAA basketball game championship. They are setting up their strategies for the championship game. Assessing the strength of their "benches", each coach comes up with four strategies for rotating his players during the game. The ability of each team to score 2-pointers, 3-pointers, and free throws is a key factor in determining the final score of the game. The following table summarizes the net points UA will score per possession as a function of the different strategies available to each team.

 

2493_00.png

a.    Solve the game by linear programming and determine a strategy for the championship game.
b.    Based on the given information, which of the two teams is projected to win the championship?
c.    Suppose that the entire game will have a total of 60 possessions (30 for each team). Predict the expected number of points by which the championship will be won.

 

Posted Date: 3/13/2013 1:52:01 AM | Location : United States







Related Discussions:- solve the game by linear programming, Assignment Help, Ask Question on solve the game by linear programming, Get Answer, Expert's Help, solve the game by linear programming Discussions

Write discussion on solve the game by linear programming
Your posts are moderated
Related Questions
Kaylee makes 56 packages in seven hours Taylor makes 20% more packages in nine hours who makes more packages per hour


in the form of linear graph interpret the ralationship between two quantities

understandin rates and unitrates

Write following in terms of simpler logarithms.  (a) log 3 (9 x 4    / √y) Solution log 3 (9 x 4 / √y) =log ­ 3 9x 4 -  log  y (1/2) =log ­ 3 9 + log ­ 3 x 4

If the mass is 152.2g and the volume is 18cm3, then what is the density?

Differentiate following. Solution : It requires the product rule & each derivative in the product rule will need a chain rule application as well. T ′ ( x ) =1/1+(2x) 2

what does 4/100+1/10=

approximate the following problem as a mixed integer program. maximize z=e-x1+x1+(x2+1)2 subject to x12+x2 =0

Formulas for the volume of this solid V = ∫ b a A ( x) dx          V = ∫ d c A ( y ) dy where, A ( x ) & A ( y ) is the cross-sectional area of the solid. There are seve