Resource Management Techniques

Linear Programming: Introduction Linear Programming: Introduction Notes
  Linear programming is the process of taking various linear inequalities relating to some situation, and finding the "best" value obtainable under those conditions. A typical example would be taking the limitations of materials and labor, and then determining the "best" production levels for maximal profits under those conditions.
Rate this Book:
No votes yet
The Critical Path Method The Critical Path Method Notes
  Background,Some questions about the project,What is the Critical Path Method(CPM)?,Why the CPM? How to use the CPM ?,Questions and Answers
Rate this Book:
No votes yet
Transportation, Assignment and Transshipment Problems Transportation, Assignment and Transshipment Problems Notes
  A transportation problem basically deals with the problem, which aims to find the best way to fulfill the demand of n demand points using the capacities of m supply points.
Rate this Book:
No votes yet
Senstive Analysis Senstive Analysis Notes
  We have already been introduced to sensitivity analysis in Chapter 1 via the geometry of a simple example. We saw that the values of the decision variables and those of the slack and surplus variables remain unchanged even though some coefficients in the objective function are varied.
Rate this Book:
No votes yet
The Dual Linear Program The Dual Linear Program Notes
  In discussing duality, it is common to depart from the standard equality form of the LP given in Section 4.1 in order to highlight the symmetry of the primal-dual relationships.
Rate this Book:
No votes yet
Resource leveling Resource leveling Notes
  Over allocation means the scheduled work is not likely to occur (or the resource may be annoyed, overworked or burned out). Under allocation means suboptimal utilizing and billing of resource, lowering of profitability. Lastly, your schedule won’t be accurate, unless resources are correctly loaded.
Rate this Book:
No votes yet
Project Network Diagram Project Network Diagram  Notes
  Project Network Diagram are explained in this book
Rate this Book:
No votes yet
PERT for Project Planning and Scheduling PERT for Project Planning and Scheduling  Notes
  PERT, the project Evaluation and Review Technique, is a network-based aid for planning and scheduling the many interrelated tasks in a large and complex project
Rate this Book:
No votes yet
Classical Optimization Theory Classical Optimization Theory Notes
  Preliminaries,Necessary Conditions for Constrained Local Maximum and Minimum,Sufficient Conditions for Constrained Local Maximum and Minimum,etc..,
Rate this Book:
No votes yet
Nonlinear Programming and the Kuhn-Tucker Conditions Nonlinear Programming and the Kuhn-Tucker Conditions Notes
  Our constrained optimization analysis has dealt only with situations in which there is a single constraint, and in which all the variables are generally positive at the optimum.
Rate this Book:
No votes yet
Linear Programming Linear Programming  Notes
  Duality,Pivot Operation,Simple Method,Generalized Duality,Cycling,etc..,
Rate this Book:
No votes yet
Linear Programming Models Linear Programming Models Notes
  Steps in Developing a Linear Programming (LP) Model,Properties of LP Models,Example LP Model Formulation: The Product Mix Problem, Example: Flair Furniture Co,etc..,
Rate this Book:
No votes yet
Lagrangian Methods Lagrangian Methods Notes
  Lagrangian Methods and example are been expalined in this book
Rate this Book:
No votes yet
Kuhn-Tucker conditions Kuhn-Tucker conditions Notes
  In this document, we set out the constrained optimisation with inequality constraints and state the Kuhn-Tucker necessary conditions for a solution; after an example, we state the Kuhn-Tucker sufficient conditions for a maximum.
Rate this Book:
No votes yet
Integer Programming - Basics Integer Programming - Basics  Notes
  The linear-programming models that have been discussed thus far all have been continuous, in the sense that decision variables are allowed to be fractional.
Rate this Book:
No votes yet
Integer Programming Integer Programming Notes
  Mixed and Pure Integer Programming Problems,Examples,Further Uses of Integer Variables,Solving IP Problems: Cutting Plane Algorithm etc..,
Rate this Book:
No votes yet
Dual Simplex Algorithm Dual Simplex Algorithm Notes
  Dual Simplex Algorithm and the definition are explained in this chapter
Rate this Book:
No votes yet
The Dual Simplex Method The Dual Simplex Method Notes
  Algorithm as explained so far known as primal simplex,starting with feasible basis, look for optimal basis while keeping feasibility.Alternative algorithm known as dual simplex,starting with optimal basis, look for feasible basis while keeping optimality
Rate this Book:
No votes yet
Duality and Sensitivity Analysis Duality and Sensitivity Analysis  Notes
  The optimal solution of a linear-programming problem represents a snapshot of the conditions that prevail at the time of the model is formulated
Rate this Book:
No votes yet
Decision Making and Problem Solving Decision Making and Problem Solving Notes
  Decision making and problem solving are critically important skill areas for emergency managers, planners, first responders, voluntary agency coordinators, and other professionals in emergency management.
Rate this Book:
No votes yet