# Maximization Exercise The Really Big Shoe manufacturer of basketball and soccer sports shoesExample of Linear Programming - Graphical Method

### Problem Data

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

Description

## Solution

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:

### Step 1:

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.