Operation Research
Swarup, K.; Gupta, P. K. & Mohan, M.
Operation Research - 8th - New Delhi SULTAN CHAND AND SONS 2000 - 815 p;
8170142164
linear programming problem,the simplex method,duality in linear programing,revised simplex method and bounded variable technique,the transportation problem,the assignment routing problems,post optimal analysis,games and stratergies,sequencing problems,integer programming problems,dynamic programming,non linear programming problems,non linear programming techniqs,probability markov analysis and finite differences,decision analysis,quening theory,inventory control,replacement problems and system realiability,simulation,network scheduling by pert/cpm,resource analysis in network scheduling,information theory,some advanced theory in programming,some cases in o.r
519.0/SWA/Ope
Operation Research - 8th - New Delhi SULTAN CHAND AND SONS 2000 - 815 p;
8170142164
linear programming problem,the simplex method,duality in linear programing,revised simplex method and bounded variable technique,the transportation problem,the assignment routing problems,post optimal analysis,games and stratergies,sequencing problems,integer programming problems,dynamic programming,non linear programming problems,non linear programming techniqs,probability markov analysis and finite differences,decision analysis,quening theory,inventory control,replacement problems and system realiability,simulation,network scheduling by pert/cpm,resource analysis in network scheduling,information theory,some advanced theory in programming,some cases in o.r
519.0/SWA/Ope