It's interesting to know the opposite directions that simplex and dual simplex methods move to find the optimal solutions. Prof. Harish, I just wonder if there is a method using the two moving directions at the same time to find the optimal solution? Many thanks Prof. Harish.
@DrHarishGarg4 жыл бұрын
If such situation exists where feasibility and optimality both not satisfied. Then in that case firstly apply DUAL SIMPLEX METHOD and once all the RHS of the table (i.e., Solution column) becomes position then apply the SIMPLEX method to maintain the optimality. I hope it will clear you... If not, kindly let me know.
@SolvingOptimizationProblems4 жыл бұрын
@@DrHarishGarg Thank you very much!
@MathsBySahiram7 ай бұрын
Thank you Sir
@arpitachatterjee59552 жыл бұрын
I am watching your online classes and I want to know To know your book name to Follow these dual simplex Method problem. Thank you.
@DrHarishGarg2 жыл бұрын
As such no one particular book.... You can follow any book... Else ... Just follow all lecture serial wise... You will get complete knowledge.
@RoniBadgujjarАй бұрын
sir if in starting of algorithm if all basic variables are positive then how to start our algorithm
@DrHarishGargАй бұрын
Dual simplex method is applicable only when atleast one of basic variable is negative..... Remember, if all basic variable are positive then you need to apply Simplex method..
@taniya96934 жыл бұрын
Thanku soo much sir
@learner1585 Жыл бұрын
Sir if we will write constraints in < form then, it will violate condition of standard form. To be in standard form RHS should be positive
@DrHarishGarg Жыл бұрын
Dual simplex method works for canonical form not for standard form.. Same is also explained in the video..... Also, dual simplex method is used oy when RHS is negative.
@learner1585 Жыл бұрын
@@DrHarishGarg Thanks sir, I got it
@mahem73894 жыл бұрын
Nice
@swapnilmore5442 жыл бұрын
Sir in these last question x3=0 na sir instead of 1/3
@swapnilmore5442 жыл бұрын
And sir in Q2 also Z will be 10/3 instead of 13/3 I am getting
@user-nhjxoui92 жыл бұрын
hai sir, From practice problems at the end of the video, 2nd problem is already maximization type and when we find Zj - Cj in the first table we get all Values of Zj-Cj are becomes negative ... how to solve ???
@DrHarishGarg2 жыл бұрын
Check whether the initial table is feasible or not(see last column , sol) are all value positive... If not, then apply dual simplex
@user-nhjxoui92 жыл бұрын
@@DrHarishGarg That means first we have to check whether we have to use Dual simplex or not Right?
@user-nhjxoui92 жыл бұрын
@@DrHarishGarg In initial table , if last column is positive then we have to simplex Otherwise dual simplex I'm I correct?
@DrHarishGarg2 жыл бұрын
Yes, absolutely correct.. . the same thing is explained in this video too....