You are on page 1of 9

Linear Inequalities in two variables

A solution of a linear inequality in two variables is a set of points
which satisfies the inequality. Graphically, It is a region in the XY
For < or > inequalities we use a dashed line. For ≥∨≤
inequalities we use a solid line.

A solid line is included in the solution, a dashed line is not.
To solve a linear inequality graphically, We will sketch the line
corresponding to the equation and then strike out the points we
do not need.
1. Solve

y ≤ 10 ;

Sketch the line y = 10 in the XY plane. Shade the region we not
not need.

For inequalities of > or < form, we used dotted lines to sketch.
The points on the dotted line are NOT part of the solution.

2. Solve the inequality 2 (2 x− y ) <2 ( x+ y )−4
4 x −2 y <2 x+ 2 y + 4

4 x −4 y <2 x−4

2) a solution? Is ( 6. Is ( 0.2) a solution? Is (1.1 x-y>4.2) a solution? Verify mathematically or see the graph!!! Solve the following system of inequalities graphically. x<2. Strike out the region below the line.x y > +1 2 Sketch y – x/2 +1=0 as a dotted line.y>-5 > . and clearly indicate the feasible region: Q.

0 ≤ y. and clearly indicate the feasible region: Q. 0≤x.> > Solve the following system of inequalities graphically.3x+y≤6 > .2 x+y≤4.

.> > Is ( 0.2) a solution? Is (1. Sketch the line corresponding to each inequality separately and strike out the region we do not need.2) a solution? Verify mathematically or see the graph!!! Solving systems of inequalities.2) a solution? Is ( 6.

Set up the linear inequality for this restriction. Let x = total no. y ≥ 0. . Application: A firm manufactures two products. we have x ≥ 0. of units produced of product A Y = total no. Product A requires 4 hiours per unit. of units produced of product B Total hours in production cannot exceed 60. So 2 x + 4 y ≤ 60 Since x and y are production levels. We require the region above the line! Any point lying in the unshaded region along with the borders will satisfy both inequalities. The production time available in the coming week is 60 hours. product B requires 2 hours per unit. The products must be processed through one department. We require the region above the line! Line 2: y = x-2.x +10 { y ≥−2 y ≥ x−2 Line 1: y = -2x + 10.

Points to think about: . If A requires 3 hours per unit and B requires 5 hours per unit and there are a total of 75 hours available. x ≥ 0. Each point in this region gives a combination of the two products which can be produced.Graphical Solution for 2 x + 4 y ≤ 60 . 3 x+5 y ≤75 Solution is the area ABCD. y ≥ 0. set up the inequality describing this and sketch the solution on the same graph. 1 y= ( 60−2 x ) 4 We need the region lying below this line: Also only consider the first quadrant as production levels cannot be negative. Suppose the products need to be processed through another department also.

The LP model for this problem is: Maximize z = 5x + 6y Subject to 2 x + 4 y ≤ 60 3 x+5 y ≤75 x≥0 .Do points on AB satisfy the solution. . Maximize z = 5x + 6y The objective is to see the feasible solution which will give a maximum possible profit. formulate the objevtive function which will maximize profit. On BC?? Why are combinations in the triangle AEB not possible? Why are combinations in the triangle BCF not possible? Objective: If each unit of x costs $5 and each unit pf y costs $6.

Feasible Region: The set of all feasible points is called the feasible region. Objective Function: Function to be maximized or minimized Constraints: Restricitons/Conditions applied on our decision variables are called constraints. Nonnegativity Constraint: Every LP practical optimization problem has this constraint which says that the variables cannot be negative.e. . the optimal way. Decision variables: These are the variables for which certain decisions need to be made in order to achieve our objective. where we try to maximize or minimize some objective. The adjective linear means that all the mathematical functions in this model are required to be linear functions. y ≥ 0.. Feasible Points: The set of all solutions to the system of linear constraints are feasible points. The most common application of LP is allocating limited resources among competing activities in a best possible way i. Linear Programming This is a mathematical optimization technique. There could be infinitely many feasible points.