1. A linear programming problem cost minimization problem has objective function: Minimize X +Y. It has two constraints 2X + 4Y ≥ 100 and 1X + 8Y ≤ 100, X≥ 0, Y≥0. (15 Points Total)
1.1. Use QM for Windows to plot the feasible region. Paste image of Linear Programming Results window and Solution List window here.
1.2. Paste image of Graph window here. Explain if each of the following statements below is true or false. Please make sure you provide a
reason.
1.3. There are four corner points including (50, 0) and (0, 12.5).
1.4. The two corner points are (0, 0) and (50, 12.5).
1.5. The feasible region is triangular in shape, bounded by (50, 0), (33-1/3, 8-1/3), and (100, 0).
1.6. The graphical origin (0, 0) is in the feasible region.