Systems Analysis Design

Minimize 28X1 + 24X2
Subject to: [1] 4X1 + 5X2 ≤ 4,000
[2] X1 + X2 ≥ 600
[3] X1 ≥ 200
[4] X2 ≥ 100
All decision variables ≥ 0
Solve the linear program graphically with X1 on the horizontal axis and X2 on the vertical axis. Determine the corner points
for the feasible region (calculate the corner points by simultaneously solving 2 constraints). Label the constraints and the
corner points and shade the feasible region on the graph.

[The scale of the graph is 100 units per horizontal / vertical line.]
Calculate the objective function value for each of the corner point and determine the optimal solution.
Corner Points Objective Function Value Optimal Point (Yes / No)

On the EXCEL spreadsheet template for Problem #1 on Carmen, formulate the linear programming model and calculate the optimum
solution using Solver. If the problem has a multiple optimal solution, only one optimal point is necessary.
Business Management 2321 – Individual Practical Exercise #2
Due at the beginning of class #5
Version 8
Problem #2
Maximize 40X1 + 30X2
Subject to: [1] 2X1 + 4X2 ≤ 16
[2] ‒X1 + 2X2 ≥ 2
[3] X1 ≤ 2
All decision variables ≥ 0
Solve the linear program graphically with X1 on the horizontal axis and X2 on the vertical axis. Determine the corner points
for the feasible region (calculate the corner points by simultaneously solving 2 constraints). Label the constraints and the
corner points and shade the feasible region on the graph.

[The scale of the graph is 1 unit per horizontal / vertical line.]
Calculate the objective function value for each of the corner point and determine the optimal solution.
Corner Points Objective Function Value Optimal Point (Yes / No)

On the EXCEL spreadsheet template for Problem #2 on Carmen, formulate the linear programming model and calculate the optimum
solution using Solver. If the problem has a multiple optimal