03 l Graphical method in LPP l MINIMIZATION with three constraints l BeingGourav Com скачать в хорошем качестве

03 l Graphical method in LPP l MINIMIZATION with three constraints l BeingGourav Com

In this video we are going to solve LPP by Graphical method when Objective function is of MINIMIZATION type and all constraints is of less than or equal to type. check this link for Graphical method basic concepts    • 01 l Graphical Method in LPP in Hindi l Ba...   Check this link for Graphical method MAXIMIZATION case    • 02 l Graphical method in LPP l  Maximizati...   Graphical method in LPP After formulating the Linear programming Model the next step is to solve the model. There are various mathematical method to solve the LPP. But when we have only two decision variables then we used Graphical method to solve LP model. The steps are 1. Express each constraint in terms of equation i.e. replaces inequality sign in each constraint by an equality sign. Assign arbitrary value to the decision variables x1 and x2 to get plotting points. x1 k1 0 x2 0 k2 (x1, x2) = (k1, 0) and (0,k2) Plot these point on the graph and join them by straight line. 2. If the inequality constraint corresponding to that line is ‘≤’ then the region below the line lying in the first quadrant is shaded. Similarly for ‘≥’ the region above the line is shaded. The common region which satisfies all the constraints is called feasible region or solution space. 3. Determine coordinate of each corner point of the feasible region. 4. Compute and compare the value of the objective function at each corner point. 5. Identify corner point that gives optimal (max. or min.) value of the objective function. useful Video for BBA, MBA , MCA, B.Com, and other student of different universities. ~-~~-~~~-~~-~ Please watch: "UNBALANCED ASSIGNMENT PROBLEM IN OPERATION RESEARCH | USING HUNGARIAN METHOD | Lecture 03"    • Unbalanced Assignment Problem | Using Hung...   ~-~~-~~~-~~-~