
Download App
>> | LShop | >> | Book | >> | Computing & Informat... | >> | Computer Science | >> | Theory And Problems ... |
ISBN
:
9780070584006
Publisher
:
Tata Mcgraw Hill Education Private Limited
Subject
:
Computer Science, Information Technology: General Issues
Binding
:
Paperback
Pages
:
464
Year
:
2003
₹
695.0
₹
695.0
Buy Now
Shipping charges are applicable for books below Rs. 101.0
View DetailsEstimated Shipping Time : 5-7 Business Days
View DetailsDescription
Tackling the broad range of allocation problems that actually confront engineers, programmers and analysts in today's business and industrial worlds, this book takes readers step-by-step through all the mathematical programming techniques--including the trailblazing Karmarkar algorithm--needed to excel in any operations research course. It's easy to see why the first edition of this invaluable study guide sole more than 35,000 copies! It cuts down study time while it builds essential skills. Key Features: The perfect aid for better grades! Covers all courses fundamentals-supplements any class text. 310 fully solved problems. Hundreds of practice problems Ideal for self-study! Table of Content: Chapter 1. Mathematical ProgrammingChapter 2. Linear Programming: Basic ConceptsChapter 3. Linear Programming: The Simplex and the Dual Simple MethodsChapter 4. Linear Programming: Duality and Sensitivity AnalysisChapter 5. Linear Programming: ExtensionsChapter 6. Integer Programming: Branch-and-Bound AlgorithmChapter 7. Integer Programming: Cut AlgorithmsChapter 8. Integer Programming: the Transportation AlgorithmChapter 9. Integer Programming: Scheduling ModelsChapter 10. Non-linear Programming: Single-VariableChapter 11. Non-linear Programming: Multivariable Optimization Without ConstraintsChapter 12. Non-linear Programming: Multivariable Optimization Without ConstraintsChapter 13. Network AnalysisChapter 14. Project Planning Using Pert/cpmChapter 15. Inventory ModelsChapter 16. ForecastingChapter 17. Game TheoryChapter 18. Decision TheoryChapter 19. Dynamic ProgrammingChapter 20. Finite Markov ChainsChapter 21. Markovian Birth-Death ProcessesChapter 22. Queuing SystemsChapter 23. M/m/1 SystemsChapter 24. Other Systems with Poisson-type Input and Exponential-Type Service TimesAnswers to Supplementary ProblemsIndex
Are you sure you want to remove the item from your Bag?
Yes
No
Added to Your Wish List
OK
Your Shopping Bag
- 2 Items
Item
Delivery
Unit Price
Quantity
Sub Total
Order Summary