| 000 | 01727nam a2200193 4500 | ||
|---|---|---|---|
| 999 |
_c6195 _d6195 |
||
| 050 |
_aQA265 _bSw1 |
||
| 100 | _aKanti Swarup | ||
| 245 |
_aOperations research : _b (a textbook for students of mathematics, statistics, commerce, engineering and management of all Indian universities) _cKanti Swarup; Pramod K Gupta; Man Mohan |
||
| 260 |
_aDelhi : _bSultan Chand, _c1978. |
||
| 300 |
_a928 pgs _c22 cm |
||
| 500 | _aIncludes bibliographical references and index | ||
| 505 | _aChapter 0. Prerequisite Chapter 1. Introduction Chapter 2. The Linear programming problem Chapter 3. The simplex method Chapter 4. Duality in linear programming Chapter 5. Revised simplex method and bounded variable technique Chapter 6. The transportation problem Chapter 7. The assignment and routing problem Chapter 8. Post-Optimality analysis Chapter 9. Games and strategies Chapter 10. Sequencing problems Chapter 11. Dynamic programming Chapter 12. Non-Linear programming Chapter 13. Non-Linear programming techniques Chapter 14. Integer programming problem Chapter 15. Probability, Markov analysis and finite differences Chapter 16. Queueing theory Chapter 17. Inventory control Chapter 18. Replacement problem, system reliability Chapter 19. Network scheduling by PERT/CPM Chapter 20. Simulation Chapter 21. Information theory Chapter 22. Some advance topics in programming Chapter 23. Some cases in O. R. Appendix A: Selected bibliography Appendix B: Answers to programs Appendix C: Numerical tables Index | ||
| 650 | _aOperations research. | ||
| 650 | _aProgramming (Mathematics) | ||
| 700 | _aKanti Swarup; | ||
| 710 | _aPramod K Gupta; | ||
| 711 | _aMan Mohan | ||
| 942 | _cBK | ||