Posted on

Linear_Programming Solution_Spokane_Television_station

Linear_Programming Solution_Spokane_Television_station

Linear_Programming Solution_Spokane_Television_station

Linear_Programming Solution_Spokane_Television_station

Linear_Programming Solution_Spokane_Television_station

A marketing firm has contracted to do a survey on a political issue for a Spokane television station. The firm conducts interviews during the day and at night, by telephone and in person. Each hour an interviewer works at each type of interview results in an average number of interviews. In order to have a representative survey, the firm has determined that there must be at least 400 day interviews, 100 personal interviews, and 1,200 interviews overall. The company has developed the following linear programming model to determine the number of hours of telephone interviews during the day (x1), telephone interviews at night (x2), personal interviews during the day (x3), and personal interviews at night (x4) that should be conducted to minimize cost:
Minimize Z = 2×1+3×2+5×3+7×4 (cost,$)
Subject to
10×1+4×3 ≥ 400 (day interviews)
4×3+5×4 ≥ 100 (personal interviews)
X1+x2+x3+x4 ≥ 1200 (total interviews)
X1,x2,x3,x4 ≥ 0
Solve this model using the simplex method.

For getting the instant digital download solution, Please click on the “PURCHASE” link below to get Linear_Programming Solution_Spokane_Television_station

For instant digital download of the above solution or tutorial, please click on the below link and make an instant purchase. You will be guided to the PAYPAL Standard payment page wherein you can pay and you will receive an email immediately with a download link. Please note that in case of technical glitch, the solutions will be emailed to you within 24 hours.

In case you find any problem in getting the download link or downloading the tutorial, please send us an email on mail@edusolutionguide.com