Introduction to Operations ResearchCD-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 80
Page 409
A directed path from node i to node j is a sequence of connecting arcs whose
direction ( if any ) is toward node j , so that flow from node i to node j along this
path is feasible . An undirected path from node i to node ; is a sequence of
connecting ...
A directed path from node i to node j is a sequence of connecting arcs whose
direction ( if any ) is toward node j , so that flow from node i to node j along this
path is feasible . An undirected path from node i to node ; is a sequence of
connecting ...
Page 419
The unconnected node closest to either node O or node A is node B ( closest to A
) . Connect node B to node A . The unconnected node closest to node 0 , A , or B
is node C ( closest to B ) . Connect node C to node B . The unconnected node ...
The unconnected node closest to either node O or node A is node B ( closest to A
) . Connect node B to node A . The unconnected node closest to node 0 , A , or B
is node C ( closest to B ) . Connect node C to node B . The unconnected node ...
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 but
at ...
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 but
at ...
What people are saying - Write a review
User Review - Flag as inappropriate
i
User Review - Flag as inappropriate
I want review this book
Contents
SUPPLEMENT TO APPENDIX 3 | 3 |
Problems | 6 |
An Algorithm for the Assignment Problem | 18 |
Copyright | |
57 other sections not shown
Other editions - View all
Common terms and phrases
activity additional algorithm allocation allowable amount apply assignment basic solution basic variable BF solution bound boundary calculations called capacity changes coefficients column complete Consider constraints construct corresponding cost CPF solution demand described determine direction distribution dual problem entering equal equations estimates example feasible FIGURE final flow problem Formulate 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 resource respective resulting revised Select shown shows side simplex method simplex tableau slack solve step supply Table tableau tion unit values weeks Wyndor Glass zero
Bibliographic information
| Title | Introduction to Operations Research McGraw-Hill International Editions 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 | Pennsylvania State University |
| Digitized | 26 Aug 2009 |
| ISBN | 0071181636, 9780071181631 |
| Length | 1214 pages |
| Export Citation | BiBTeX EndNote RefMan |