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 74
Page 160
The procedure is described in Sec . 7 . 2 . COMPUTER IMPLEMENTATION If the
electronic computer had never been invented , undoubtedly you would have
never heard of linear programming and the simplex method . Even though it is ...
The procedure is described in Sec . 7 . 2 . COMPUTER IMPLEMENTATION If the
electronic computer had never been invented , undoubtedly you would have
never heard of linear programming and the simplex method . Even though it is ...
Page 254
As described in Secs . 4 . ... When the solution has been found in this way ,
sensitivity analysis for the primal problem then is conducted by applying the
procedure described in the next two sections directly to the dual problem and
then inferring ...
As described in Secs . 4 . ... When the solution has been found in this way ,
sensitivity analysis for the primal problem then is conducted by applying the
procedure described in the next two sections directly to the dual problem and
then inferring ...
Page 452
( b ) Use the algorithm described in Sec . 9 . 3 to solve this shortestpath problem .
C ( c ) Formulate ... ( a ) Describe how this problem fits the network description of
the minimum spanning tree problem . ( b ) Use the algorithm described in Sec . 9
.
( b ) Use the algorithm described in Sec . 9 . 3 to solve this shortestpath problem .
C ( c ) Formulate ... ( a ) Describe how this problem fits the network description of
the minimum spanning tree problem . ( b ) Use the algorithm described in Sec . 9
.
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 |