Scribd
Upload
2 views

Linear-Programming

The document outlines the procedures for graphing linear inequalities and systems of inequalities, emphasizing the importance of identifying test points and the characteristics of bounded and unbounded solution sets. It also introduces linear programming problems, detailing how to find feasible and optimal solutions through graphical methods and the Method of Corners. Key theorems regarding the existence of solutions and optimization at vertices of the feasible set are presented.

Uploaded by

Kyle Isaac
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

Linear-Programming

The document outlines the procedures for graphing linear inequalities and systems of inequalities, emphasizing the importance of identifying test points and the characteristics of bounded and unbounded solution sets. It also introduces linear programming problems, detailing how to find feasible and optimal solutions through graphical methods and the Method of Corners. Key theorems regarding the existence of solutions and optimization at vertices of the feasible set are presented.

Uploaded by

Kyle Isaac
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 21

Linear

Programming
Graphing Linear Inequalities
Note that a linear equation in two variables x and y
ax+by+c=0
has a solution set that may be exhibited graohically as points on a straight line in the xy-
plane.
There is also a simple graphical representation for linear inequalities of two variables:
ax+by+c<0
ax+by+c≤0
ax+by+c>0
ax+by+c≥0
Procedure for Graphing Linear
Inequalities

1. Draw the graph of the equation obtained for the given


inequality by replacing the inequality sign with an equal
sign.
* Use a dashed or dotted line if the problem involves a
strict in equality (>,<)
* Otherwise, use a solid line to indicated that the line itself
constitutes part of the solution (≥,≤)
Procedure for Graphing Linear
Inequalities

2. Pick a test point lying in one of the half-planes determined


by the line sketched in step 1 and substitute the values of x
and y into the given inequality. (Use the origin whenever
possible)
3. If the inequality is satisfied, the graph of the inequality
includes the half-plane containing the test point.
(Otherwise, the solution includes the half-plane not
containing the test point)
Example 1

Determine the solution set for the inequality 2x+3y≥6.


Solution:
Replacing the inequality ≥ with an equality =, we obtain
the equation 2x+3y=6. To identify 2 points on the line in order
to graph, let x=0 and solve for y. Reversibly, let y=0 and solve
for x to obtain two ordered pairs.
Example 1

2x+3y=6
a. Let x=0 b. Let y=0
2x+3y=6 2x+3y=6
2(0)+3y=6 2x+3(0)=6
0+3y = 6 2x+0=6
3y=6 2x=6
y=2 x=3

Giving us the ordered pairs (0,2) and (3,0).


Example 1
Example 1

Determine the solution set for the inequality 2x+3y≥6.


*Picking the origin as a test point, we find 2(0)+3(0) ≥6, or 0 ≥6, which is false.
Thus, the solution set is:
Graphing Systems of Linear Inequalities

The solution set of a system of linear inequalities in two


variables x and y is the set of all points (x,y) that satisfy each
inequality of the system.
The graphical solution of such a system may be obtained by
graphing the solution set for each inequality independently
and then determining the region in common with each
solution set.
Example 2

Determine the solution set for the system


x+y≤6
2x+y ≤8
x,y ≥0
Graph the lines of both inequalities. The intersection
represents the solution to the system.
Example 2

For x+y≤6
Example 2

For 2x+y ≤8
Example 2

For x+y≤6 and 2x+y ≤8


Example 2

Since it is defined that x,y ≥0, then the solution set of


x+y≤6
2x+y ≤8
x,y ≥0, is
Bounded and Unbounded Sets

The solution set of a system of linear inequalities is bounded


if it can be enclosed by a circle. Otherwise, it is unbounded.

BOUNDED UNBOUNDED
Linear Programming Problem

A linear programming problem consists of a linear objective


function to be maximized or minimized subject to certain
constraints in the form of linear equations or inequalities.
Graphical Solutions of Linear
Programming Problems
Feasible Solution Set and Optimal
Solution

*The constraints in a linear programming problem form a system


of linear inequalities, which have a solution set S.
*Each point in S is a candidate for the solution of the linear
programming problem and is referred to as a feasible solution.
*The set S itself is referred to as a feasible set
*Among the points in the set S, the point that optimizes the
objective function of the linear programming problem is
called an optimal solution.
Theorem 1:Linear Programming

*If a linear programming problem has a solution, then it must


occur at a vertex, or corner point, of the feasible set S
associated with the problem.
*If the objective function is optimized at two adjacent vertices
of S, then it is optimized at every point on the line segment
joining these vertices, in which case there are infinitely
many solutions to the problem.
Theorem 2: Existence of a Solution

Suppose we are given a linear programming problem with a feasible set S


and an objective function P=ax+by.
*If S is bounded, then P has both a maximum and a minimum value on S.
*If S is unbounded and both a and b are nonnegative, then P has a
minimum value on S provided that the constraints defining S
include the inequalities x≥0 and y≥0.
*If S is the empty set, then the linear programming problem has no
solution: that is, P has neither a maximum nor a minimum value.
Method of Corners

1. Graph the feasible set.


2. Find the coordinates of all corner points.
3. Evaluate the objective function at each corner point.
4. Find the vertex that renders the objective function a maximum or a minimum.
*If there is only one such vertex, it constitutes a unique solution to the
problem.
*If there are two such adjacent vertices, there are infinitely many optimal
solutions given by the points on the line segment determined by these
vertices.

You might also like