|
Example of solving the Linear
Programming problem
1. Define the
constraints of the linear programming problem as a system of
inequalities.
2. Solve this system of inequalities.
3. Find the intersection points of the borderlines of the
inequalities’ graphs (polygon vertices).
4. Define the target function of the problem.
5. Display a level line that represents a possible target function.
6. Create a parallel to the drawn level line and move it through the
intersection points (polygon vertices).
7. Draw the level line which is the desired solution of the problem.
The solving process is presented on the following screens:
Step 1 - Define constraints of a
problem as a system of inequalities.
Step
2
- Solve the system of inequalities. Step
3
- Draw the level line and move it parallelly through the intersection points,
drawn in advance. Step
4
- Find the final target function graphically or, alternatively, calculate its
maximal (minimal) value with the built-in calculator.
|