Maximization Exercise The Really Big Shoe manufacturer of basketball and soccer sports shoesExample of Linear Programming - Graphical Method
We want to Maximize the following problem:
- Objective Function
- Z = X1 + X2
- Subject to the following constraints
300000X1 + 1000000X2 ≤ 30000000
120X1 + 96X2 ≤ 4000
X1, X2 ≥ 0
- Maximization Exercise The Really Big Shoe manufacturer of basketball and soccer sports shoesThe Really Big Shoe is a manufacturing of basketball and football shoes. Ed Sullivan, the manager of marketing must decide the best way to spend advertising resources. Each football team sponsored requires 120 pairs of shoes. Each basketball team requires 32 pairs of shoes. Football coaches receive $ 300,000 for shoe sponsorship, and basketball coaches receive $ 1,000,000. Sullivan's promotional budget is $ 30,000,000. The Really Big Shoe has a limited supply (4 liters or 4000 cc) of flubber, a rare and costly compound used in athletic shoes. Each pair of basketball shoes requires 3 cc of flubber, and each pair of football shoes requires 1 ce. Sullivan wants to sponsor as many basketball and football teams as resources allow. Formulate the problem as a LP problem and solve the problem graphically.
To solve the problem we will calculate the feasible region which is formed by the area satisfying the set of constraints.
Below we present the detailed calculations and graphs to solve the problem:
Non-negativity: X1, X2 ≥ 0
The decision variables of the problem must comply with the non-negativityconstraint; that is, their values can be from 0 to plus.
In our graph, it means that the feasible region will be in the first quadrant:
Note: You can zoom the chart using the scroll wheel, as well as move the view by dragging it with the mouse.
Learn with step-by-step explanations
At PM Calculators we strive to help you overcome those tricky subjects in an easier way.
With access to our membership you will have access to 13 applications to learn projects, linear programming, statistics, among others.
What calculators are included?
Critical Path PERT and CPM
Linear Programming Methods
Break-even and more
Purchase our monthly subscription from