Linear programming
1)Convex polygon
2)Objective function, constraints eqn, non negativity condition
3)solution, feasible solultion,optimal solution
4)slack and surplus variable
5) Canonical form of LPP
- Objective function maximum type
- Constraint equation <= type
- Variable are non negative
6)Standard form of LPP
- objective function maximum type
- variable are non negative
- Elements in R.H.S are non negative
- Constraints equation are as equation
7)Simplex method: It is method of reducing infinite number of solutions to a finite number of solution by promishing the following facts:
- If m constraints and (m+n)variables then n zero variables are known as non-basic variables and remaining m variables are known as basic variables and they form a basic solution.
- Basic feasible solution
- If we change one basic and one non basic variable, eliminated variable is outgoing and new variable is incoming variable.
- Optimal feasible solution or optimal solution
8) Working procedure of the simplex method :
- Express in standard form
- Find Basic optimal solution
9) Artificial variable
2)Objective function, constraints eqn, non negativity condition
3)solution, feasible solultion,optimal solution
4)slack and surplus variable
5) Canonical form of LPP
- Objective function maximum type
- Constraint equation <= type
- Variable are non negative
6)Standard form of LPP
- objective function maximum type
- variable are non negative
- Elements in R.H.S are non negative
- Constraints equation are as equation
7)Simplex method: It is method of reducing infinite number of solutions to a finite number of solution by promishing the following facts:
- If m constraints and (m+n)variables then n zero variables are known as non-basic variables and remaining m variables are known as basic variables and they form a basic solution.
- Basic feasible solution
- If we change one basic and one non basic variable, eliminated variable is outgoing and new variable is incoming variable.
- Optimal feasible solution or optimal solution
8) Working procedure of the simplex method :
- Express in standard form
- Find Basic optimal solution
9) Artificial variable