Welcome to UE Central Library

Keep Smiling

Operations research : (Record no. 485)

MARC details
000 -LEADER
fixed length control field 07276cam a22002294a 4500
001 - CONTROL NUMBER
control field 1698
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20200701120700.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 060929s2007 njua b 001 0 eng
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9788131711040
040 ## - CATALOGING SOURCE
Transcribing agency PK
082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 658.4/034
Edition number 22
Item number T1286
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Taha, Hamdy A.
245 10 - TITLE STATEMENT
Title Operations research :
Remainder of title an introduction /
Statement of responsibility, etc Hamdy A. Taha.
250 ## - EDITION STATEMENT
Edition statement 8th ed.
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication, distribution, etc New Delhi :
Name of publisher, distributor, etc Pearson/Prentice Hall,
Date of publication, distribution, etc 2009
300 ## - PHYSICAL DESCRIPTION
Extent xxii, 775 p.
Other physical details ill. ;
Dimensions 25 cm. +
Accompanying material 1 CD-ROM (4 3/4 in.)
500 ## - GENERAL NOTE
General note Includes bibliographical references and index.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Operations research.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Programming (Mathematics)
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type Books
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Chapter 1: what is operations research?<br/>1.1 operations research models<br/>1.2 solving the or model<br/>1.3 queueing and simulation models<br/>1.4 art of modeling<br/>1.5 more than just mathematics<br/>1.6 phases of an or study<br/>1.7 about this book problems references chapter 2: modeling with linear programming<br/>2.1 two-variable lp mode<br/>L2.2 graphical lp solution<br/>2.3 selected lp applications<br/>2.4 computer solution with solver and ampl problems references chapter 3: the simplex method and sensitivity analysis<br/>3.1 lp model in equation form<br/>3.2 transition from graphical to algebraic solution<br/>3.3 the simplex method<br/>3.4 artificial starting solution<br/>3.5 special cases in the simplex method <br/>3.6 sensitivity analysis problems references <br/>Chapter 4: duality and post-optimal analysis<br/>4.1 definition of the dual problem<br/>4.2 primal-dual relationships<br/>4.3 economic interpretation of duality<br/>4.4 additional simplex algorithms <br/>4.5 post-optimal analysis problems references <br/>Chapter 5: transportation model and its variants<br/>5.1 definition of the transportation model<br/>5.2 nontraditional transportation models<br/>5.3 the transportation algorithm<br/>5.4 the assignment model<br/>5.5 the transshipment model problems references <br/>Chapter 6: network models<br/>6.1 scope and definition of network models<br/>6.2 minimal spanning tree algorithm<br/>6.3 shortest-route problem<br/>6.4 maximal flow model<br/>6.5 cpm and pert problems references <br/>Chapter 7: advanced linear programming<br/>7.1 simplex method fundamentals <br/>7.2 revised simplex method<br/>7.3 bounded variables algorithm<br/>7.4 duality<br/>7.5 parametric linear programming problems references <br/>Chapter 8: goal programming<br/>8.1 a goal programming formulation<br/>8.2 goal programming algorithms problems references<br/>Chapter 9: integer linear programming<br/>9.1 illustrative applications<br/>9.2 integer programming algorithms<br/>9.3 traveling salesperson (tsp) problem problems references <br/>Chapter 10: deterministic dynamic programming<br/>10.1 recursive nature of computations in dp<br/>10.2 forward and backward recursion<br/>10.3 selected dp applications<br/>10.4 problem of dimensionality problems references <br/>Chapter 11: deterministic inventory models<br/>11.1 general inventory model<br/>11.2 role of demand in the development of inventory models<br/>11.3 static economic-order-quantity (eoq) models<br/>11.4 dynamic eoq models problems references <br/>Chapter 12: review of basic probability<br/>12.1 laws of probability<br/>12.2 random variables and probability distributions<br/>12.3 expectation of a random variable <br/>12.4 four common probability distributions<br/>12.5 empirical distributions problems references <br/>Chapter 13: decision analysis and games<br/>13.1 decision making under certainty-analytic hierarchy process (ahp)<br/>13.2 decision making under risk<br/>13.3 decision under uncertainty<br/>13.4 game theory problems references <br/>Chapter 14: probabilistic inventory models<br/>14.1 continuous review models<br/>4.2 single-period models<br/>14.3 multiperiod model problems references <br/>Chapter 15:queueing systems<br/>15.1 why study queues?<br/>15.2 elements of a queuing model<br/>15.3 role of exponential distribution<br/>15.4 pure birth and death models (relationship between the exponential and poisson distributions)<br/>15.5 generalized poisson queuing model<br/>15.6 specialized poisson queues<br/>15.7 (m/g/1):(gd/inf/inf)-pollaczek-khintchine (p-k) formula<br/>15.8 other queuing models<br/>15.9 queueing decision models problems references <br/>Chapter 16: simulation modeling<br/>16.1 monte carlo simulation<br/>16.2 types of simulation<br/>16.3 elements of discrete-event simulation<br/>16.4 generation of random numbers<br/>16.5 mechanics of discrete simulation<br/>16.6 methods for gathering statistical observations<br/>16.7 simulation languages problems references <br/>Chapter 17: markov chains<br/>17.1 definition of a markov chain<br/>17.2 absolute and n-step transition probabilities<br/>17.3 classification of the states in a markov chain<br/>17.4steady-state probabilities and mean return times of ergodic chains<br/>17.5 first passage time<br/>17.6 analysis of absorbing states problems references <br/>Chapter 18: classical optimization theory<br/>18.1 unconstrained problems<br/>18.2 constrained problems problems references <br/>Chapter 19: nonlinear programming algorithms<br/>19.1 unconstrained algorithms<br/>19.2 constrained algorithms problems references appendix a: ampl modeling languagea.<br/>1 rudimentary ampl modela.<br/>2 components of ampl modela.<br/>3 mathematical expressions and computed parametersa.<br/>4 subsets and indexed setsa.<br/>5 accessing external filesa.<br/>6 interactive commandsa.<br/>7 iterative and conditional execution of ampl commadsa.<br/>8 sensitivity analysis using ampl reference appendix b: statistical tables <br/>Appendix c: partial answers to selected problems index on the cd <br/>Chapter 20: additional network and lp algorithms<br/>20.1 minimim-cost capacitated flow problem<br/>20.2 decomposition algorithm<br/>20.3 karmarkar interior-point method problems references <br/>Chapter 21: forecasting models<br/>21.1 moving average technique<br/>21.2 exponential smoothing<br/>21.3 maximization of the event of achieving a goal problems references <br/>Chapter 22: probabilistic dynamic programming<br/>22.1 a game of chance<br/>22.2 investment problem<br/>22.3 maximization of the event of achieving a goal problems references <br/>Chapter 23: markovian decision process<br/>23.1 scope of the markovian decision problem<br/>23.2 finite-stage dynamic programming model<br/>23.3 infinite-stage model<br/>23.4 linear programming solution problems references <br/>Chapter 24: case analysiscase 1: airline fuel allocation using optimum tinkering<br/>Case 2: optimization of heart valves production<br/>Case 3: scheduling appointments at australian tourist commission trade events<br/>Case 4: saving federal travel dollars<br/>Case 5: optimal ship routing and personnel assignments for naval recruitment in Thailand<br/>Case 6: allocation of operating room time in mount sinai hospital<br/>Case 7: optimizing trailer payloads at pfg building glass<br/>Case 8: optimization of crosscutting and log allocation at Weyerhaeuser<br/>Case 9: layout planning of a computer integrated manufacturing (cim) facility<br/>Case 10: booking limits in hotel reservations<br/>Case 11: casey's problem: interpreting and evaluating a new test<br/>Case 12: ordering golfers on the final day of ryder cup matches<br/>Case 13: inventory decisions in dell's supply chain<br/>Case 14: analysis of an internal transport system in a manufacturing plant<br/>Case 15: telephone sales manpower planning at qantas airways <br/>Appendix d: review of vectors and matricesd.<br/>1 vectorsd.<br/>2 matricesd.<br/>3 quadratic formsd.<br/>4 convex and concave functions problems references <br/>Appendix e: case studies<br/><br/>
Holdings
Withdrawn status Damaged status Not for loan Home library Current library Date acquired Source of acquisition Full call number Barcode Date last seen Price effective from Koha item type
      UE-Central Library UE-Central Library 06.06.2018 U.E. 658.4034 T1286 T1698 06.06.2018 06.06.2018 Books
Copyright © 2023, University of Education, Lahore. All Rights Reserved.
Email:centrallibrary@ue.edu.pk