Graphical solution of optimization problem for the

objective functions of two variables

Linear Inequalities
 Graphing Linear Inequalities
The graph of a linear inequality is a region bordered by a line called a boundary line. The solution region of a linear
inequality is the set of all points (including the boundary line) that satisfy the inequality.
Consider the inequality . The boundary line of the solution region is , since the points satisfying this linear equation
are on the border of the solution region.
We need to find all points () that satisfy the inequality. We know that all points on the line satisfy the inequality.
Which points off the line satisfy the inequality?
Let’s pick a few points off the line and test them to see if they satisfy the inequality. In order to satisfy the inequality,
must be at least 4.
 Example: Graphing the Solution Region of a Linear Inequality
Graph the solution region of the linear inequality .
The x-intercept is easily found by dividing the constant term by the coefficient on the x term:
The point (2, 0) is the x-intercept.
The y-intercept is found by dividing the constant term by the coefficient on the y term:
The point (0,4) is the y-intercept. We graph the x- and y-intercepts and then
draw the line through the intercepts, as shown in Figure.

Next, we will pick the point (0, 0) to plug into the inequality:

The statement is true, so all points on the same side of the line as the origin are
in the solution region. We shade the solution region.
 Exercise

1. Write constraints for each of the following:

a) A batch of cookies requires 3 cups of flour, and a cake requires 4. Write a constraint limiting the
amount of cookies and cakes that can be made with 24 cups of flour.

b) Box type 1 can hold 20 books and box type 2 can hold 12. Write a constraint for the number of boxes
needed in order to box up 100 books.

c) If it takes you 4 minutes to bike a mile, 9 minutes to run a mile and 14 minutes to walk a mile, write a
constraint that limits how many miles of each type of exercise you can get in a 45-minute lunch break.
 Graphing Systems of Linear Inequalities
Suppose you have two constraints as follows:
2x1 + 3x2 ≤ 34
3x1 + 5x2 ≤ 54
Also assume that x1 and x2 are objects and must be ≥ 0.
You can graph these inequalities…

x2

x1
 Graphical Optimization
The overlap of these graphs is known as the feasible region. A solution to the problem
must
lie in the region in order to obey both
of the constraints.
x2

And, because the constraints are linear, the

maximum and minimum must lie on the
boundary.

x1
 Graphical Optimization
In fact, it is most likely that the optimum occurs at one of the corner points.
We can even find the values of the corner points with a little algebra…

x2

(0, 10.8) Crossing point of x1 = 0 with 3x1 + 5x2 = 54

Crossing point of 2x1 + 3x2 = 34

(8, 6)
with 3x1 + 5x2 = 54

x1
(0, 0) (17, 0)
Crossing point of x2 = 0 with 2x1 + 3x2 = 34
 Exercise
Suppose a company hires both experienced and inexperienced workers.

Experienced workers are paid $15/hour and inexperienced workers are paid $10/hour. The company can
spend $1200/hour on labor.

Experienced workers require an average of 1 minute an hour of contact with a supervisor; inexperienced
workers require 2. There are two supervisors who can provide 120 minutes in an hour.

2. Convert both of these into inequality constraints. Graph them, find the feasible region, and find all four
corner points.
 Example: Graphing Systems of Linear Inequalities

We first rewrite the linear inequality as a linear inequality in slope-intercept form.

The boundary line is a line with slope -1.5 and y-intercept (0, 2.5). Since y is less than or equal to the expression -
1.5x+2.5, we will shade the region below the line, as shown in the Figure.
The next two inequalities ( and ) limit the solution region to positive values of x and y. The line is the y axis. The
line is the x axis. Therefore, the solution region of the system of inequalities is the triangular region to the right of
the line , above the line , and below the line y = 1.5x+2.5.
If it is possible to draw a circle around the solution region, the solution region is bounded.
If no circle can be drawn that will enclose the entire solution region, the solution region is
unbounded.
Example. Unbounded region.
Example. Empty solution region.
Example. Finding the corner points of a solution region.
Linear inequalities applications
Examples
 Solving Linear Programming Problems Graphically

Many products, such as printer ink, are sold to business customers at a discount if large quantities are ordered.
Profitable businesses want to minimize their supply costs yet have sufficient ink on hand to fulfill their
printing requirements. How much ink should they order? The process of acquiring, producing, and distributing
supplies can often be made more efficient by setting up and solving systems of linear inequalities.
We will look how a mathematical method called linear programming can help for example businesses
determine the most cost-effective way to manage their resources. We will demonstrate how linear
programming is used to optimize an objective function subject to a set of linear constraints. We will also reveal
how to find the whole-number solution of an integer programming problem.
we gave the example of a student earning $10.50 an hour delivering pizza and $8.00
an hour working in a campus computer lab. He had only 30 hours per week to work,
and he had to earn at least $252 during that period.
We let p be the number of hours he spent delivering pizza and c be the number of
hours he spent working in the computer lab. We had the constraints
Example: Solving a Linear Programming Problem Graphically
Exercise: Using Linear Programming to Do Investment Analysis
Table shows the average annual rate of return on two TIAA-CREF investment accounts
over a 10-year period.
Integer Programming Problems
Example: Using Linear Programming to Make Business Decisions

Solution. Let s be the number of single cartridges and t be the number

of three-packs. Since 10 or more cartridges will be ordered, shipping
will be free. Consequently, the equation of the objective function (the
cost function) is
 Active and Inactive Constraints
An optimal solution that lies at the intersection point of two constraints causes both of
those constraints to be considered active.

x2
active constraints

solution

x1
 Active and Inactive Constraints
An optimal solution that lies at the intersection point of two constraints causes both of
those constraints to be considered active.
x2
solution

inactive constraints
x1

If any of the constraint lines do not pass through the optimal point, those constraints
are called inactive.