Scribd
Upload
10 views

Quick Review Chapter 5

The document summarizes key concepts from a chapter on linear inequalities and linear programming, including definitions of inequalities, linear inequalities in two variables, corner points of a solution region, feasible regions, and the procedure for determining an optimal solution which involves graphing constraints, finding corner points, and evaluating the objective function.

Uploaded by

Zaid Babar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
10 views

Quick Review Chapter 5

The document summarizes key concepts from a chapter on linear inequalities and linear programming, including definitions of inequalities, linear inequalities in two variables, corner points of a solution region, feasible regions, and the procedure for determining an optimal solution which involves graphing constraints, finding corner points, and evaluating the objective function.

Uploaded by

Zaid Babar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Suppose Math, session 2024

(Preparation for Lecturer Test)


Quick Review

Chapter # 05 Linear Inequalities and Linear Programming

These notes are the summary of the whole chapter which can be helpful
to prepare the objective as well as subjective part of paper.

1. Inequalities are expressed by the following four symbols:


> (greater than), <(less than), ≥ (greater than or equal to), ≤ (less than or equal to).
2. A linear inequality in two variables x and y can be one of the following forms:
ax + by < c, ax + by > c, ax + by ≤ c, ax + by ≥ c.
3. A point of a solution region where two of its boundary lines intersect, is called a corner point
or vertex of the solution region.
4. A linear inequality concerning the a certain problem from every day life is named as problem
constraint.
5. The system of linear inequalities involved in the problem concerned are called problem
constraints.
6. A solution region which is restricted to the first quadrant is known as feasible region for
the set of given constraints.
7. Each point of the feasible region is called a feasible solution of the system of linear
inequalities.
8. A set consisting of all the feasible solutions of the system of linear inequalities is called a
feasible solution set.
9. If the line segment obtained by joining any two points of a region lies entirely within the
region, then the region is called convex.
10. A function which is to be maximized or minimized is called an objective function.
11. The feasible solution which maximizes or minimizes the objective function is called the
solution.
12. According to theorem of linear programming, the maximum and minimum values of the
objective function occur at corner points of the feasible region.
13. Following is the procedure for determining the optimal solution:
ˆ Graph the solution set of problem constraints to determine feasible region.
ˆ Find the corner points of the feasible region.
ˆ Evaluate the objective function at each corner point to find the optimal solution.
I never dreamed about success. I worked for it. Estee Lauder

Best Of Luck

Notes by: Akhtar Abbas (M.Phil QAU), Lecturer at University of Jhang.

You might also like