Chapter To Research 1.1 And Of Research 1.2 Of Research* Various Of Research* Scope Operations * Principal Of Research 1.6 In Research 1.7 Of Research * Phases Operations * Advantages Operations * Limitations Operations * 2 Allocation—Linear * Allocation 2.2 Of In Programming * Solution Lp * Simplex * Artificial Technique 2.6 Variables 2.7 Solution 2.8 In Programming Chapter In Programming 3.1 Rules Converting Primal Dual 3.2 Duality * Problems Write Dual The Primal * Problems Solve Dual Find Optimal Of Primal Chapter Model 4.1 Of Problem 4.2 Formulation The Problem 4.3 Theorem 4.4 Procedure The Problem 4.5 Salesman * 5 Sequencing 5.1 * Johnson’S * 6 Transportation * Mathematical Of Problem 6.2 Find Basic Solution * Unbalanced Problem 6.4 In Problems 7 * Replacement Capital Items 7.2 Of Cost When Worth Time) Considered 7.3 Of Items Bulk (Group * 8 Inventory * Objective An Problem 8.2 Of * Inventory * Model Lot Model Uniform Of Infinite Rate Having Shortages* Model Lot Model Different Of In Production Infinite Rate Having Shortages 8.6 Iii: Economic Size With Rate Demand, Rate Replenishment Having Shortages 8.7 Iv: Deterministic With And (Fixed Model) Uniform Of ‘Q’ Be In Time Rate Production Having Which To Fulfilled 8.8 V: Els With Rate Demand, Rate Production Shortages Are Be (Varying Model)* Model Model Uniform Of Finite Of Having Which To Fulfilled 8.10 Vii: Single Model Discontinuous Instantaneous And Set-Up Model 8.11 Viii: Single Model Uniform Of (No Cost * Model Single Model Profit With Cost 8.13 X: Purchase Model One Break 8.14 Xi: Purchase–Inventory With Price * Purchase Model Multiple Breaks 8.16 Analysis Chapter Queuing * Objective Queuing * Service * Operating Of Queuing * Queing * Queing * Queing * Basic Of System 9.8 Of Models 9.9 I: {(M/M/1):(∞/Fcfs)} 9.10 Ii: {(M/M/1):(N/Fcfs)}-(Finite Model) 9.11 Iii: {(M/M/S):(∞/Fcfs)} 9.12 Iv: {(M/M/S):(N/Fcfs)} 9.13 V: {(M/M/S):(M/Gd)} 9.14 Vi: {(M/Ek/1):(∞/Fcfs)} Chapter Of Or Strategies * A Illustration Understand Theory Games 10.2 Of Games 10.3 Or Criterion Optimality 10.4 Point 10.5 Theory—Problems 10.6 Strategies 10.7 Property: Of * Solution Problems Saddle * Problems Saddle Using * Solution Problems Graphical *10.11 Methodology Problems Saddle Without And Cannot Reduced Either × Size (M 2) *10.12 Of Of Problems Saddle * Solution Rectangular Without Point Approximate (Iterative *10.14 Method 10.15 Of Theory By Into Problem Game Problems 11 Decision *11.1 Of Analysis Steps Decision-Making Different In Decisions Be *11.4 For Under *11.5 Under Of *11.6 Under *11.7 Under [Expected Value Criterion] Decision * 12 Simulation 12.1 Of * Significant Of * Monte Simulation * Normal * Simulation * Types Simulation 12.7 Of * 13 Network (Cpm Pert) 13.1 Path * Program And Technique 13.3 Concepts Network * Types Activities 13.5 A Diagram 13.6 For Of Events 13.7 For The Diagrams 13.8 Path * Program And Technique * Comparison Cpm Pert Chapter Dynamic *14.1 Important * Basic (Characteristics) Dynamic Problems 14.3 Shortest Problem 14.4 Optimal Problems 14.5 Principle Optimality 14.6 Solution L.P. By Programming 14.7 Cargo Problems 14.8 Optimization Study For Preparation 14.9 Budgeting * Reliability * Warehouse * Product Problem 14.13 Allocation * Advertising Problem Summary Review * Questions Descriptive * Problems Appendices Index.
Contributors
Author Info
Dr. A.C.S. Kumar is retired Vice Principal and Professor of Mechanical Engineering, J.N.T.U. College of Engineering, Hyderabad. He has a Mechanical Engineering degree from N.I.T., Warangal, an M.Tech. in Design of Production Machines from I.I.T., Delhi, and a Ph.D. in Mechanical Engineering from I.I.T., Delhi. He worked as Assistant Lecturer in Mechanical Engineering at B.I.T.S., Pilani, during 1975–77. He is presently Principal, Abhinav Hi-Tech College of Engineering, Hyderabad, affiliated to JNTU, Hyderabad. He has to his credit about 50 research publications in various national/international journals and conferences.
Dimensions
Width
6.8 inch
Height
9 inch
Depth
1.69 inch
Weight
1310 g
Be the first to ask about this product
Safe and Secure Payments.Easy returns.100% Authentic products.