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 67
Page 318
The upper bound technique avoids this increased effort by removing the upper
bound constraints from the functional constraints and treating them separately ,
essentially like nonnegativity constraints . Removing the upper bound constraints
in ...
The upper bound technique avoids this increased effort by removing the upper
bound constraints from the functional constraints and treating them separately ,
essentially like nonnegativity constraints . Removing the upper bound constraints
in ...
Page 613
This section has illustrated the branch - and - bound technique by describing a
basic branchand - bound algorithm for solving BIP problems . However , the
general framework of the branch - and - bound technique provides a great deal of
...
This section has illustrated the branch - and - bound technique by describing a
basic branchand - bound algorithm for solving BIP problems . However , the
general framework of the branch - and - bound technique provides a great deal of
...
Page 614
In general terms , two features are sought in choosing a relaxation : it can be
solved relatively quickly , and provides a relatively tight bound . Neither alone is
adequate . The LP relaxation is popular because it provides an excellent trade -
off ...
In general terms , two features are sought in choosing a relaxation : it can be
solved relatively quickly , and provides a relatively tight bound . Neither alone is
adequate . The LP relaxation is popular because it provides an excellent trade -
off ...
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 | |
59 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 called changes coefficients column complete Consider constraints Construct corresponding cost CPF solution decision variables demand described determine distribution dual problem entering equal equations estimates example feasible feasible solutions 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 nonnegative 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 revised shown shows side simplex method simplex tableau slack solve step supply Table tableau tion transportation 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 |