In Operation Research we will study about
Linear programming, Variables, Objective function, Constraints, and Mathematical form of an LPP.
Graphical method of solution of two-variable linear programming problems. Line and line segment in
the Euclidean space Rn, Convex set, Hyperplane convex combination, Convex polyhedron, Extreme
point of a convex set. A basic solution of a system of linear equations. Slack and surplus variables.
The standard form of an LPP. The feasible solution, BFS, and optimal BFS of an LPP. Replacement of basis
vector. Improved BFS. Unbounded solutions, Conditions of optimality. Simplex algorithm, Artificial
variable, Charnel's Big M-method.
Dual and primal. Problem Standard form of a primal problem. Formation of dual of a standard primal
problem. Fundamental theorem of duality. Solution of an LPP by solving its dual by the simplex method.
Assignment problems.
Download mobile applications for complete video
https://bit.ly/3bT59Wl
Join What's App Group for math students
https://chat.whatsapp.com/IhVrtNoFzXt...
Join Telegram Channel for notes & pdf
https://t.me/mathsbylalitsir
#Lalitsir #BSCmaths #Onlineeducation
#kotauniversity
#mdsuniversity
#mathsbylalitsir
#bscmaths
#engineeringmaths
#uniquemaths
Download
0 formats
No download links available.
Assignment Problem | Hungarian Method | Operation Research B.Sc. 3rd year | Lecture - 27 | NatokHD