Introduction to mathematical programming
Introduction to mathematical programming
4th Edition
ISBN: 9780534359645
Author: Jeffrey B. Goldberg
Publisher: Cengage Learning
Expert Solution & Answer
Book Icon
Chapter 4, Problem 23RP

Explanation of Solution

Optimal solution:

  • Consider the LP problem of football match between teams Miami dolphins, the Buffalo bills, and the New York Jets.
  • Each team is given these rating:
  • M=Miami rating
  • J=Jets rating
  • B=bills rating
  • Games played between the teams in the year 1972 are given in the table below:
MiamiBillsJets
27 17
28 24
2423 
3016 
 2441
 341
  • From the game board when Miami plays Jets they win by 27-17=10 points in the first game and 28-24=4 points in second game. Hence total points by which Miami wins is 10+4=14.
  • According, to rating system Miami is expected to win by M-B points. Hence, prediction error is |Bj1|0.22. Hence we have,
    • |MB1|14
  • Our predicted value should be close to observed value. Hence, introduce deviation variable as follows:
    • si+= Amount by which we numerically exceed the predicted value.
    • si= Amount by which we are numerically under the predicted value.
  • So,
    • MB1+s1+s1=14
  • Similarly, for match between Miami and Bills, Miami wins by 24-23=1 point in first match and by 30-16=14 points is second match. Miami wins by total of 1+14=15 points. Hence, we have,
    • MJ1+s2+s2=15
  • In the match between Bills and Jets, Jets win by 41-24=17 points in first match and 41-3=38 points in second match.
  • Jet wins by a total of 17+38=55 points and therefore,
    • JB1+s3+s3=55
  • We have to minimize the total deviation. Hence the minimization equation is
  • Minimize z=s1+s1+s2+s2+s3+s3
  • Hence the following LP is formulated.
  • Minimize z=s1++s1+s2++s2+s3++s3
  • Such that
    • MB1+s1+s1=14
    • MJ1+s2+s2=15
    • JB1+s3+s3=55
  • Enter the following LP equations in the file:
    • min sp1+sm1+sp2+sm2+sp3+sm3
    • Subject to
    • mj+sp1sm1=15
    • mb+sp2sm2=16
    • bj+sp3sm3=56
    • End
  • The output is given below:
    • Global optimal solution found.
    • Objective value: 57.00000
    • Infeasibilities: 0.000000
    • Total solver iterations: 4
    • Elapsed runtime seconds: 1.47
    • Model class: LP
    • Total variables: 9
    • Non-linear variables: 0
    • Integer variables: 0
    • Total constraints: 4
    • Non-linear constraints: 0
    • Total non-zeroes: 18
    • Non-linear non-zeroes: 0
VariableValue
sp10.000000
sm10.000000
sp21.000000
sm20.000000
sp356.000000
sm30.000000
m15.000000
j0.000000
b0.000000
RowSlack or Surplus
157.00000
20.000000
30.000000
40.000000
  • Therefore, it can be concluded that the rating of these teams should be
    • M=15
    • J=0
    • B=0
  • From the given results it can be said that this rating system is not accurate and cannot be used to rate teams early in the season.
  • Since Miami plays Jets 27+17=44 times and wins 27 times. So probability of winning is 27/44

Blurred answer
Students have asked these similar questions
Suppose, you are working in a company ‘X’ where your job is to calculate the profit based  on their investment.   If the company invests 100,000 USD or less, their profit will be based on 75,000 USD as  first 25,000 USD goes to set up the business in the first place. For the first 100,000 USD,  the profit margin is low: 4.5%. Therefore, for every 100 dollar they spend, they get a profit  of 4.5 dollar.  For an investment greater than 100,000 USD, for the first 100,000 USD (actually on 75,000  USD as 25,000 is the setup cost), the profit margin is 4.5% where for the rest, it goes up to  8%. For example, if they invest 250,000 USD, they will get an 8% profit for the 150,000  USD. In addition, from the rest 100,000 USD, 25,000 is the setup cost and there will be a  4.5% profit on the rest 75,000. Investment will always be greater or equal to 25,000 and  multiple of 100.  Complete the RECURSIVE methods below that take an array of integers (investments)  and an iterator (always sets to…
Suppose, you are working in a company ‘X’ where your job is to calculate the profit based  on their investment.   If the company invests 100,000 USD or less, their profit will be based on 75,000 USD as  first 25,000 USD goes to set up the business in the first place. For the first 100,000 USD,  the profit margin is low: 4.5%. Therefore, for every 100 dollar they spend, they get a profit  of 4.5 dollar.  For an investment greater than 100,000 USD, for the first 100,000 USD (actually on 75,000  USD as 25,000 is the setup cost), the profit margin is 4.5% whereas for the rest, it goes up to  8%. For example, if they invest 250,000 USD, they will get an 8% profit for the 150,000  USD. In addition, from the rest 100,000 USD, 25,000 is the setup cost and there will be a  4.5% profit on the rest 75,000. The investment will always be greater or equal to 25,000 and multiple of 100.  Complete the RECURSIVE methods below that take an array of integers (investments)  and an iterator (always sets to…
Suppose, you are working in a company ‘X’ where your job is to calculate the profit based on their investment.If the company invests 100,000 USD or less, their profit will be based on 75,000 USD as first 25,000 USD goes to set up the business in the first place. For the first 100,000 USD, the profit margin is low: 4.5%. Therefore, for every 100 dollar they spend, they get a profitof 4.5 dollar.For an investment greater than 100,000 USD, for the first 100,000 USD (actually on 75,000 USD as 25,000 is the setup cost), the profit margin is 4.5% where for the rest, it goes up to 8%. For example, if they invest 250,000 USD, they will get an 8% profit for the 150,000 USD. In addition, from the rest 100,000 USD, 25,000 is the setup cost and there will be a 4.5% profit on the rest 75,000. Investment will always be greater or equal to 25,000 and multiple of 100.Complete the RECURSIVE methods below that take an array of integers (investments)and an iterator (always sets to ZERO(‘0’) when the…

Chapter 4 Solutions

Introduction to mathematical programming

Ch. 4.5 - Prob. 1PCh. 4.5 - Prob. 2PCh. 4.5 - Prob. 3PCh. 4.5 - Prob. 4PCh. 4.5 - Prob. 5PCh. 4.5 - Prob. 6PCh. 4.5 - Prob. 7PCh. 4.6 - Prob. 1PCh. 4.6 - Prob. 2PCh. 4.6 - Prob. 3PCh. 4.6 - Prob. 4PCh. 4.7 - Prob. 1PCh. 4.7 - Prob. 2PCh. 4.7 - Prob. 3PCh. 4.7 - Prob. 4PCh. 4.7 - Prob. 5PCh. 4.7 - Prob. 6PCh. 4.7 - Prob. 7PCh. 4.7 - Prob. 8PCh. 4.7 - Prob. 9PCh. 4.8 - Prob. 1PCh. 4.8 - Prob. 2PCh. 4.8 - Prob. 3PCh. 4.8 - Prob. 4PCh. 4.8 - Prob. 5PCh. 4.8 - Prob. 6PCh. 4.10 - Prob. 1PCh. 4.10 - Prob. 2PCh. 4.10 - Prob. 3PCh. 4.10 - Prob. 4PCh. 4.10 - Prob. 5PCh. 4.11 - Prob. 1PCh. 4.11 - Prob. 2PCh. 4.11 - Prob. 3PCh. 4.11 - Prob. 4PCh. 4.11 - Prob. 5PCh. 4.11 - Prob. 6PCh. 4.12 - Prob. 1PCh. 4.12 - Prob. 2PCh. 4.12 - Prob. 3PCh. 4.12 - Prob. 4PCh. 4.12 - Prob. 5PCh. 4.12 - Prob. 6PCh. 4.13 - Prob. 2PCh. 4.14 - Prob. 1PCh. 4.14 - Prob. 2PCh. 4.14 - Prob. 3PCh. 4.14 - Prob. 4PCh. 4.14 - Prob. 5PCh. 4.14 - Prob. 6PCh. 4.14 - Prob. 7PCh. 4.16 - Prob. 1PCh. 4.16 - Prob. 2PCh. 4.16 - Prob. 3PCh. 4.16 - Prob. 5PCh. 4.16 - Prob. 7PCh. 4.16 - Prob. 8PCh. 4.16 - Prob. 9PCh. 4.16 - Prob. 10PCh. 4.16 - Prob. 11PCh. 4.16 - Prob. 12PCh. 4.16 - Prob. 13PCh. 4.16 - Prob. 14PCh. 4.17 - Prob. 1PCh. 4.17 - Prob. 2PCh. 4.17 - Prob. 3PCh. 4.17 - Prob. 4PCh. 4.17 - Prob. 5PCh. 4.17 - Prob. 7PCh. 4.17 - Prob. 8PCh. 4 - Prob. 1RPCh. 4 - Prob. 2RPCh. 4 - Prob. 3RPCh. 4 - Prob. 4RPCh. 4 - Prob. 5RPCh. 4 - Prob. 6RPCh. 4 - Prob. 7RPCh. 4 - Prob. 8RPCh. 4 - Prob. 9RPCh. 4 - Prob. 10RPCh. 4 - Prob. 12RPCh. 4 - Prob. 13RPCh. 4 - Prob. 14RPCh. 4 - Prob. 16RPCh. 4 - Prob. 17RPCh. 4 - Prob. 18RPCh. 4 - Prob. 19RPCh. 4 - Prob. 20RPCh. 4 - Prob. 21RPCh. 4 - Prob. 22RPCh. 4 - Prob. 23RPCh. 4 - Prob. 24RPCh. 4 - Prob. 26RPCh. 4 - Prob. 27RPCh. 4 - Prob. 28RP
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole