filmov
tv
Linear Programming Basic Concepts and Problem Formulation | LPP MATHEMATICAL FROMULATION
![preview_player](https://i.ytimg.com/vi/Q2zGcmSd41s/maxresdefault.jpg)
Показать описание
In this video we will learn about linear programming basic concepts and problem formulation in operation research in hindi.
MATHEMATICAL FORMULATION IN LPP.
Linear programming deals with the optimization of a function of variables known as objective function, subject to a set of linear equation and/or inequalities known as constraints.
The objective function may be profit, cost, production capacity or any other measure of effectiveness, which is to be obtained in the best possible or optimal manner.
The constraints may be different resources such as availability of raw material, storage capacity, man power, machine capacity, time etc.
By linear, we mean a mathematical expression of the type a1x1 + a2x2 + …. + anxn, where a1, a2, …, an are constants and x1, x2 … xn are variables.
By programming, we mean modelling and solving a problem mathematically that involve economic allocation of limited resources to achieve desired objective.
PROBLEM 1:-
A firm produces three products A, B, C, each of which passes through three departments: Fabrication, Finishing and Packaging. Each unit of product A requires 3, 5 and 2; a unit of product B requires 4, 4 and 4, while each unit of product C requires 2, 4 and 5 hours respectively in three departments everyday 180 hours are available in: Fabrication department, 216 hours in the Finishing department and 300 hours in the Packaging department. If unit contribution of product A is Rs. 15, of product B is Rs. 30 and of product C is Rs.24. Formulate the problem as L.P.P. to maximize contribution.
PROBLEM 2:
The standard weight of special purpose brick is 5 kg and it contain two basic ingredients B1 and B2. B1 costs Rs. 5 per kg and B2 costs Rs. 8 per kg. Strength consideration dictate that the brick should contain not more than 4 kg of B1 and a minimum 2 kg of B2. Since the demand for the product is likely to be related to the price of the brick. Formulate LPP so as to minimize cost of brick.
click for Graphical method by LPP
Click this link for simplex method
Click this link for dual simplex method
Click this link for Big M Method
Click this link for two phase simplex method
Click this link for Degeneracy in simplex method ( tie for minimum ratio)
Click this link for Unbounded solution in simplex method
Click this link for Infeasible solution in simplex method
Click this link for Revised Simplex Method
Thanks and Regards
-~-~~-~~~-~~-~-
Please watch: "UNBALANCED ASSIGNMENT PROBLEM IN OPERATION RESEARCH | USING HUNGARIAN METHOD | Lecture 03"
-~-~~-~~~-~~-~-
MATHEMATICAL FORMULATION IN LPP.
Linear programming deals with the optimization of a function of variables known as objective function, subject to a set of linear equation and/or inequalities known as constraints.
The objective function may be profit, cost, production capacity or any other measure of effectiveness, which is to be obtained in the best possible or optimal manner.
The constraints may be different resources such as availability of raw material, storage capacity, man power, machine capacity, time etc.
By linear, we mean a mathematical expression of the type a1x1 + a2x2 + …. + anxn, where a1, a2, …, an are constants and x1, x2 … xn are variables.
By programming, we mean modelling and solving a problem mathematically that involve economic allocation of limited resources to achieve desired objective.
PROBLEM 1:-
A firm produces three products A, B, C, each of which passes through three departments: Fabrication, Finishing and Packaging. Each unit of product A requires 3, 5 and 2; a unit of product B requires 4, 4 and 4, while each unit of product C requires 2, 4 and 5 hours respectively in three departments everyday 180 hours are available in: Fabrication department, 216 hours in the Finishing department and 300 hours in the Packaging department. If unit contribution of product A is Rs. 15, of product B is Rs. 30 and of product C is Rs.24. Formulate the problem as L.P.P. to maximize contribution.
PROBLEM 2:
The standard weight of special purpose brick is 5 kg and it contain two basic ingredients B1 and B2. B1 costs Rs. 5 per kg and B2 costs Rs. 8 per kg. Strength consideration dictate that the brick should contain not more than 4 kg of B1 and a minimum 2 kg of B2. Since the demand for the product is likely to be related to the price of the brick. Formulate LPP so as to minimize cost of brick.
click for Graphical method by LPP
Click this link for simplex method
Click this link for dual simplex method
Click this link for Big M Method
Click this link for two phase simplex method
Click this link for Degeneracy in simplex method ( tie for minimum ratio)
Click this link for Unbounded solution in simplex method
Click this link for Infeasible solution in simplex method
Click this link for Revised Simplex Method
Thanks and Regards
-~-~~-~~~-~~-~-
Please watch: "UNBALANCED ASSIGNMENT PROBLEM IN OPERATION RESEARCH | USING HUNGARIAN METHOD | Lecture 03"
-~-~~-~~~-~~-~-
Комментарии