Yes. You need to modify the pivot selecting procedure accordingly. Otherwise you can convert minimization function to maximization function by changing it's sign and solve. Then after solving, change the sign of your final value of objective function.
![[Live] : ONE 168 วันนี้!! "โจนาธาน vs ซุปเปอร์เล็ก"](http://i.ytimg.com/vi/0jIN65KgJsI/mqdefault.jpg)
Thankyou very much sir
How to solve a LPP simplex problem, give a direct equal and give a negative in right hand side
Sir....can we apply simplex method when the objective function is minimum?
Yes. You need to modify the pivot selecting procedure accordingly. Otherwise you can convert minimization function to maximization function by changing it's sign and solve. Then after solving, change the sign of your final value of objective function.
@@skittles6486 thank you sir.
How are x1 and x2 non-basic? Aren't non-basic supposed to be fixed to zero?
Yes, they are intitially. But this is an iterative algorithm, where the values change after each iteration.