<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>05362nam a2200097Ia 4500</leader>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">1696</subfield>
    <subfield code="d">1696</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">PANNEER, SELVAM R</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2="0">
    <subfield code="a">OPERATIONS RESEARCH</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="b">PHI</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2=" ">
    <subfield code="a"> OVERVIEW OF OPERATIONS RESEARCH 	Concept of a Model	 .Steps of Modelling	. .Important Topics of Operations Research	. .Scope of Operations Research	. .Operations Research&#x2014;A Tool for Decision Support System	. .Operations Research&#x2014;A Productivity Improvement Tool	. .  Increased Output for the Same Input. . Decreased Input for the Same Output. .  Increase in the Output is more than the Increase in	the	Input	. .  Decrease in the Input is more than the Decrease in	the	Output	. .  Increase in the Output with Decrease in the	Input.  LINEAR	PROGRAMMING .Concept of Linear Programming Model. .  Product Mix Problem	. .   Assumptions in Linear Programming	. .  Properties of Linear Programming Solution	. .Development of LP Models. .Graphical Method. .Linear Programming Methods. .  Simplex Method. .  Big M Method. .  Dual Simplex Method. .  Two-phase Method. .Special Cases of Linear Programming. .  Identification of Special Cases from Simplex Table. .Duality. .  Formulation of Dual Problem. .  Application of Duality. .Sensitivity Analysis. .  Changes in the Right-hand Side Constants of Constraints. Changes in the Objective Function Coefficients. .  Adding a New Constraint. .   Adding a New Variable. .  .TRANSPORTATION PROBLEM . .  Mathematical Model for Transportation Problem. .  Types of Transportation Problem. .  Balanced Transportation Problem. .  Unbalanced Transportation Problem. .Methods to Solve Transportation Problem. .  Finding the Initial Basic Solution. .   Optimizing the Basic Feasible Solution Applying U&#x2014;V Method. .Transshipment Model. .  Transshipment Problem with Sources and Destinations Acting as Transient Nodes. . Transportation Problem with some Transient Nodes between Sources and Destinations. .Modelling the Transportation Problem with Quantity Discounts. .  Model for AQDS. .  Model for IQDS. .  .ASSIGNMENT PROBLEM .Zero-One Programming Model for Assignment Problem. .Types of Assignment Problem. .Hungerian Method. .Branch-and-Bound Technique for Assignment Problem. .  NETWORK TECHNIQUES .  Shortest-path Model. .  Systematic Method. .  Dijkstra's Algorithm. . Floyd's Algorithm. .  Minimum Spanning Tree Problem. .  PRIM Algorithm. .  Kruskal's Algorithm. .Maximal Flow Problem. .  Linear Programming Modelling of Maximal Flow Problem. .  Maximal Flow Problem (MFP) Algorithm. 	INTEGER PROGRAMMING Integer Programming Formulations	 .The Cutting-plane Algorithm	. .	Branch-and-Bound Technique	. .Zero-One Implicit Enumeration Algorithm. .  Generalized 0-1 Programming Problem. .  Zero-One Implicit Enumeration Technique	. .  .INVENTORY CONTROL . .Models of Inventory. .  Purchase Model with Instantaneous Replenishment and without Shortages. .  Manufacturing Model without Shortages	. .Purchase Model with Instantaneous Replenishment and with Shortages	. .Manufacturing Model with Shortages	. .Operation of Inventory System. .Quantity Discount	. .Implementation of Purchase Inventory Model. .  Fixed Order Quantity System (Q System). . Periodic Review System (P System). .	Multiple-item Model with Shortage Limitation. .	Purchase Model of Inventory for Multi-item with Inventory Carrying Cost Constraint	. .EOQ Model for Multi-item Joint Replenishment. .  Purchase Model of Inventory for Multi-item Joint Replenishment without Shortages. .  Manufacturing Model of Inventory with Multi-item Joint Replenishment without Shortages. .EOQ for the Purchase Model of Inventory for Multi-item Joint Replenishment with Space Constraint. . Determination of Stock Level of Perishable Items under Probabilistic Condition. .  .DYNAMIC PROGRAMMING . .Application of Dynamic Programming	. .Capital Budgeting Problem	. .Reliability Improvement Problem	. .Stage-coach Problem (Shortest-path Problem)	. .Cargo Leading Problem	. .Minimizing Total Tardiness in Single Machine Scheduling Problem. .Optimal Subdividing Problem	.                   .  PROJECT MANAGEMENT	. . . Phases of Project Management	. . Guidelines for Network Construction	. . Critical Path Method (CPM). . Gantt Chart (Time Chart). . Project Evaluation and Review Technique (PERT)	. . Crashing of Project Network. . General Guidelines for Network Crashing. . Crashing of Project Network with Cost Trade-off. . Project Scheduling with Constrained Resources. . Resource Levelling Technique	. . Resource Allocation Technique	. . Decision Tree DECISION THEORY . . Decision under Certainty (Deterministic Decision)	. . Decision under Risk	. . Expected Value Criterion	. . Expected Value Combined with Variance Criterion. . Decision under Uncertainty. . Laplace Criterion. .Maxirnin Criterion	.   GAME THEORY 	 . . Terminologies of Game Theory 	. .Game with Pure Strategies 	. . Game with Mixed Strategies 	. . Dominance Property 	. .Graphical Method for 2 x 71 or in x 2 Games 	. . Linear Programming Approach for Game Theory 	. .  REPLACEMENT AND MAINTENANCE ANALYSIS 	. . Types of Maintenance 	. . Types of Replacement Problem 	. . Determination of Economic Life of an Asset 	. .Basics of Interest Formulae 	. . Examples of Determination of Economic Life of an Asset 	. . Simple Probabilistic Model for Items which Completely Fail 	. .  PRODUCTION SCHEDULING 	. . . Single-machine Scheduling</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="c">BK</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">0</subfield>
    <subfield code="a">MIIMLIB</subfield>
    <subfield code="b">MIIMLIB</subfield>
    <subfield code="c">REFERENCE BOOK</subfield>
    <subfield code="d">2019-02-11</subfield>
    <subfield code="g">295.00</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">658.4034</subfield>
    <subfield code="p">1696</subfield>
    <subfield code="r">2019-02-11</subfield>
    <subfield code="w">2019-02-11</subfield>
    <subfield code="y">RFBK</subfield>
  </datafield>
</record>
