|
|
|
|
Home >>
Formal sciences
>>
Mathematics
Home >>
Formal Sciences
>>
Statistics
|
Operations Research |
 |
|
Introduction:OR APPROACH TO PROBLEM SOLVING, Observation
|
|
Introduction:Model Solution, Implementation of Results
|
|
Introduction:USES OF OPERATIONS RESEARCH, Marketing, Personnel
|
|
PERT / CPM:CONCEPT OF NETWORK, RULES FOR CONSTRUCTION OF NETWORK
|
|
PERT / CPM:DUMMY ACTIVITIES, TO FIND THE CRITICAL PATH
|
|
PERT / CPM:ALGORITHM FOR CRITICAL PATH, Free Slack
|
|
PERT / CPM:Expected length of a critical path, Expected time and Critical path
|
|
PERT / CPM:Expected time and Critical path
|
|
PERT / CPM:RESOURCE SCHEDULING IN NETWORK
|
|
PERT / CPM:Exercises
|
|
Inventory Control:INVENTORY COSTS, INVENTORY MODELS (E.O.Q. MODELS)
|
|
Inventory Control:Purchasing model with shortages
|
|
Inventory Control:Manufacturing model with no shortages
|
|
Inventory Control:Manufacturing model with shortages
|
|
Inventory Control:ORDER QUANTITY WITH PRICE-BREAK
|
|
Inventory Control:SOME DEFINITIONS, Computation of Safety Stock
|
|
Linear Programming:Formulation of the Linear Programming Problem
|
|
Linear Programming:Formulation of the Linear Programming Problem, Decision Variables
|
|
Linear Programming:Model Constraints, Ingredients Mixing
|
|
Linear Programming:VITAMIN CONTRIBUTION, Decision Variables
|
|
Linear Programming:LINEAR PROGRAMMING PROBLEM
|
|
Linear Programming:LIMITATIONS OF LINEAR PROGRAMMING
|
|
Linear Programming:SOLUTION TO LINEAR PROGRAMMING PROBLEMS
|
|
Linear Programming:SIMPLEX METHOD, Simplex Procedure
|
|
Linear Programming:PRESENTATION IN TABULAR FORM - (SIMPLEX TABLE)
|
|
Linear Programming:ARTIFICIAL VARIABLE TECHNIQUE
|
|
Linear Programming:The Two Phase Method, First Iteration
|
|
Linear Programming:VARIANTS OF THE SIMPLEX METHOD
|
|
Linear Programming:Tie for the Leaving Basic Variable (Degeneracy)
|
|
Linear Programming:Multiple or Alternative optimal Solutions
|
|
Transportation Problems:TRANSPORTATION MODEL, Distribution centers
|
|
Transportation Problems:FINDING AN INITIAL BASIC FEASIBLE SOLUTION
|
|
Transportation Problems:MOVING TOWARDS OPTIMALITY
|
|
Transportation Problems:DEGENERACY, Destination
|
|
Transportation Problems:REVIEW QUESTIONS
|
|
Assignment Problems:MATHEMATICAL FORMULATION OF THE PROBLEM
|
|
Assignment Problems:SOLUTION OF AN ASSIGNMENT PROBLEM
|
|
Queuing Theory:DEFINITION OF TERMS IN QUEUEING MODEL
|
|
Queuing Theory:SINGLE-CHANNEL INFINITE-POPULATION MODEL
|
|
Replacement Models:REPLACEMENT OF ITEMS WITH GRADUAL DETERIORATION
|
|
Replacement Models:ITEMS DETERIORATING WITH TIME VALUE OF MONEY
|
|
Dynamic Programming:FEATURES CHARECTERIZING DYNAMIC PROGRAMMING PROBLEMS
|
|
Dynamic Programming:Analysis of the Result, One Stage Problem
|
|
Miscellaneous:SEQUENCING, PROCESSING n JOBS THROUGH TWO MACHINES
|
|
Miscellaneous:METHODS OF INTEGER PROGRAMMING SOLUTION
|
| |
|
Related Documents:
|
|
|
| |
