Linear Programming Problem


Determine whether the following linear programming problem is infeasible, unbounded, or has multiple optimal solutions. Draw a graph to find the feasible region ( if it exists) and explain your conclusion.

Maximize z = 20x + 25 y

subject to

2x + y <=15



x, y >=0


During the 2004 Olympic Games, Hill and Barton monitored contests in four combat sports: Greco-Roman wrestling, freestyle wrestling, boxing, and tae kwon do. Half of the competitors were assigned red outfits and half were assigned blue. The results indicate that participants wearing red won significantly more contests. Suppose that a sample of n=100 contests produced 60 winners wearing red and only 40 wearing blue.

A. is this enough evidence to justify a conclusion that wearing red produces significantly more wins than would be expected by chance? Used a two tailed test with a significance of .05

B. Because the outcome of the binomial test is a borderline z-score use the real limits for X=60 to determine if the entire z-score interval is located in the critical region. If any part of the interval is not in the critical region the correct decision is to fail to reject the null hypothesis.

Do you need help with this assignment? Or a different one? We got you covered.

Quality Guaranteed

Any Deadline

No Plagiarism