Introduction to Operations Research, Volume 1CD-ROM contains: Student version of MPL Modeling System and its solver CPLEX -- MPL tutorial -- Examples from the text modeled in MPL -- Examples from the text modeled in LINGO/LINDO -- Tutorial software -- Excel add-ins: TreePlan, SensIt, RiskSim, and Premium Solver -- Excel spreadsheet formulations and templates. |
From inside the book
Results 1-3 of 83
Page 409
A directed path from node i to node j is a sequence of connecting arcs whose direction ( if any ) is toward nodej , so that flow from node i to node ; along this path is feasible . An undirected path from node i to node j is a sequence ...
A directed path from node i to node j is a sequence of connecting arcs whose direction ( if any ) is toward nodej , so that flow from node i to node ; along this path is feasible . An undirected path from node i to node j is a sequence ...
Page 412
Candidates for nth nearest node : Each solved node that is directly connected by a link to one or more unsolved nodes provides one candidate — the unsolved node with the shortest connecting link . ( Ties provide additional candidates . ) ...
Candidates for nth nearest node : Each solved node that is directly connected by a link to one or more unsolved nodes provides one candidate — the unsolved node with the shortest connecting link . ( Ties provide additional candidates . ) ...
Page 431
the network includes a dummy demand node that receives ( at zero cost ) all the unused supply capacity at the vendors . ... This application involves a company with several plants ( the supply nodes ) that can produce the same products ...
the network includes a dummy demand node that receives ( at zero cost ) all the unused supply capacity at the vendors . ... This application involves a company with several plants ( the supply nodes ) that can produce the same products ...
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
Introduction to Operations Research Frederick S. Hillier,Gerald J. Lieberman No preview available - 2001 |
Common terms and phrases
activity additional algorithm allowable amount apply assignment basic solution basic variable BF solution bound boundary called changes coefficients column complete Consider constraints Construct corresponding cost CPF solution decision variables demand described determine direction distribution dual problem entering equal equations estimates example feasible feasible region FIGURE final flow formulation functional constraints given gives goal identify illustrate increase indicates initial iteration linear programming Maximize million Minimize month needed node nonbasic variables objective function obtained operations optimal optimal solution original parameters path Plant possible presented primal problem Prob procedure profit programming problem provides range remaining resource respective resulting shown shows side simplex method simplex tableau slack solve step supply Table tableau tion unit weeks Wyndor Glass zero
Bibliographic information
| Title | Introduction to Operations Research, Volume 1 Introduction to Operations Research, Frederick S. Hillier McGraw-Hill industrial & plant engineering series McGraw-Hill series in industrial engineering and management science |
| Authors | Frederick S. Hillier, Gerald J. Lieberman |
| Edition | 7, illustrated |
| Publisher | McGraw-Hill, 2001 |
| Original from | the University of Michigan |
| Digitized | 8 Aug 2011 |
| ISBN | 0072321695, 9780072321692 |
| Length | 1214 pages |
| Export Citation | BiBTeX EndNote RefMan |