Linear Programming
Equation : Equation is a statement of equality of equality between two expressions consisting of variables.
𝑦 = 𝑚𝑥 + 𝑐
2𝑥 − 4𝑦 − 3 = 0
Q - 1 : What is linear programing problem with Example ?
Linear programing problem is a mathematical technique for determining optimal allocation of resources and
obtaining a particular objective.
Another definition, Linear programing problem is a method or technique of determining an optimum program of
interdependent activities in view of available resources.
Give some examples of LPP.
a. Maximizes : Z = 20x + 30y ( Objective function )
Subject to linear constraints –
3x + 3y ≤ 36
5x + 2y ≤ 50
2x + 6y ≤ 60
And non-negativity constraint x ≥ 0 , y ≥ 0
b. Minimize : Z = 80x + 60y ( Objective function )
Subject to linear constraints
2x + 4y ≥ 50
3x + 7y ≥ 70
And non-negativity constraint x ≥ 0 , y ≥ 0
Q - 2 : What are the characteristics or components of linear programming problems ? *
1. Objective function : In linear programming, in which we can get extreme values is called objective function.
2. Linear Inequality : For finding the extreme value, the imposed constraints/conditions are called linear
inequality.
3. Slack Variables : The variables which are used to bring equality in the necessity of our interest is called
slack variables.
4. Probable region : In linear programming, the part obtained possess probable solution is called probable region .
5. Feasible Solution : The problem of linear programming, the given values of the variables satisfied both
problems and non-negative conditions (x , y ≥ 0) that solution would be feasible solution.
6. Basic Feasible Solution : Any solution to a general linear programming problems (LPP) which satisfy is the
non-negative conditions of the problem is called basic feasible solution.
7. Optimal Solution : Any feasible solution which optimizes ( Maximizes and Minimizes ) the objective
functions of a general linear programming problems is called an optimal solution.
1
Q - 3 : Why we study linear programming problems ?
Linear programming is useful for solving inequalities. Linear programming is considered as an important technique
that is used to find the optimum resources utilization. There are alternative uses of the resources such as money,
manpower, material, machine and other facilities . Main advantages of linear programing problem are –
a) Linear programming techniques improve the quality of decisions. User’s of this technique become more
objective and less subjective.
b) Linear programming provides possible and practical solution programming provide possible and practical
solution. Since they are might be other constraints operating outside of the problem which must be taken
into account.
c) Linear programming helps in attaining the optimum use of productive factors. It also indicates how a decision
maker can employ his productive factors effectively by selecting and distributing these elements.
Because of this advantage, we use linear programming.
Q - 4 : What are the limitations of linear programming problem.
Linear programming suffers from certain limitations which are given bellow :
a) In reality, objective function and constraints cannot be expressed in linear form.
b) In linear programming problem, functional values are permitted for the decision variables. However, many
decision problems require that the decision variables should be obtained in non-functional values
c) The co-efficient of basic variables cannot be determined with certainty. However, they can be stated only
with probability.
d) Where a problem consist of inflicting multiple objectives, this technique can not provide a solution.
e) The linear programming does not take into consideration the effect of time and uncertainty.
f) Parameters appearing in the linear programming model are assumed.
Q – 5 : Methods for solving linear programming problems :
1. Graphical Method : This method is suitable for problem with two decision variables. It involves plotting the
constraints on a graph and finding the feasible region.
2. Algebraic Method : This method for solving LPP involve the use of algebraic equations to find the optimal solution.
3. Simplex Method : It is an interactive algorithm that starts with a basic feasible solution and moves from
one basic feasible solution to another until the optimal solution is reached.
4. Transportation Problem : The transportation problem deals with the transportation of a product
manufactured at different factories (supply)/origin to a number of different warehouses (demand/destination).
Q – 6 : The importance of linear programming in business :
1) Resource allocation
2) Supply chain management
3) Production planning
4) Marketing & Advertising
5) Financial Planning
6) Decision making