Tabular form of simplex (maximization) 

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.

Yes, they are intitially. But this is an iterative algorithm, where the values change after each iteration.