Scribd
Upload
7 views2 pages

Short Notes _ Linear Programming __ Lakshya MHTCET 2025

The document outlines the fundamentals of linear programming, including linear inequalities, objective functions, constraints, and feasible solutions. It details the process of forming a linear programming problem (LPP) and solving it using the graphical method, specifically the corner point method. Key concepts such as convex sets, optimal solutions, and slack/surplus variables are also defined.

Uploaded by

sahilkhomane75
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
7 views2 pages

Short Notes _ Linear Programming __ Lakshya MHTCET 2025

The document outlines the fundamentals of linear programming, including linear inequalities, objective functions, constraints, and feasible solutions. It details the process of forming a linear programming problem (LPP) and solving it using the graphical method, specifically the corner point method. Key concepts such as convex sets, optimal solutions, and slack/surplus variables are also defined.

Uploaded by

sahilkhomane75
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 2

Linear Programming Problem

1. Linear inequations in two variables :


Linear inequalities in two variables are inequalities of the type, ax + by  c, ax + by  c, ax + by  c, ax + by  c
where a, b, c are constants and a, b both are not zero.

2. Important terms:
i. Objective function:
The linear function z = c1 x1 + c2 x2 which is to be maximized or minimized is called the objective function,
where x1 and x2 are called decision variables and c1 and c2 are constants.
ii. Constraints:
The linear inequalities of the type ax1 + bx2  c or ax1 + bx2  c are called constraints or restriction of general
linear programming problems.
iii. Non-negativity constraints:
The linear inequalities x1  0, x2  0 are called non-negativity constraints in linear programming problems.
iv. Convex set:
A set of points in a plane is called a convex set if the line segment joining any two points in the set completely
lies in the set.

B A
B
B A B
B A
A
A A
B
(Convex sets) (Non-Convex sets)
a. Polygonal convex set:
The solution set of a system of linear inequalities in two variables x1 and x2 (or x and y ) is called a polygonal
convex set. It is denoted by X .
b. Convex polygon:
A bounded polygonal convex set is called convex polygon.
c. Extreme or corner point:
The point of intersection of any two boundaries of the half planes determined by a system of linear inequalities
is called an extreme point or corner point.
v. Feasible solution:
Any solution to a general linear programming problem which satisfies all the constraints and nonnegative
restrictions of the problem is called a feasible solution.
vi. Optimal solution:
Any feasible solution which optimizes, i.e., maximizes or minimizes the objective function of general linear
programming problem is called optimal solution.
vii. Optimum value:
The maximum or minimum value of the objective function z is called optimum value.
viii. Slack variable:
If an inequality constraint involves  , then it can be converted into an equality constraint (equation) by adding a
new non-negative variables to the left hand side of the inequality, such a new variables is called a slack variable.
ix. Surplus variable:
If an inequality constraint involves  , then it can be converted into equality constraint by subtracting a non-
negative variable from the left hand side of the inequality. This new variable is called a surplus variable.

3. Formation of LPP:
Step 1 : Identify the variables. Assign them variables x, y or x1 , x2 .
Step 2 : Identify the constraints and express them as linear inequalities.
Step 3 : Introduce the non-negative restrictions.
Step 4 : Identify the objective function ( z ) which is to be optimized.
Step 5 : Write the LPP mathematically.

4. Common region (solution set) of the lines:


i. Let L1 : a1 x + b1 y  c1
L2 : a2 x + b2 y  c2 , x  0, y  0

5. Solution of LPP by graphical method:


Corner point method:
Step 1 : Find the feasible region of the LPP.
Step 2 : Determine the corner points (vertices) of the feasible region either by inspection or by solving the two
equations of the lines intersecting at that point.
Step 3 : Find the value of objective function corresponding to all the corner points or vertices.
Step 4 : Determine the feasible solution which optimizes the value of the objective function.

PW Web/App - https://smart.link/7wwosivoicgd4
Library- https://smart.link/sdfez8ejd80if

You might also like