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 75
Page 179
Minimize Z = 5 , 000x ; + 7 , 000x2 , subject to - 2x1 + x2 > 1 x1 – 2x2 > 1 and i ( a
) Using the two - phase method , work through phase 1 step by step . C ( b ) Use
a software package based on the simplex method to formulate and solve the ...
Minimize Z = 5 , 000x ; + 7 , 000x2 , subject to - 2x1 + x2 > 1 x1 – 2x2 > 1 and i ( a
) Using the two - phase method , work through phase 1 step by step . C ( b ) Use
a software package based on the simplex method to formulate and solve the ...
Page 415
Other Applications Not all applications of the shortest - path problem involve
minimizing the distance traveled from the origin to the destination . In fact , they ...
Minimize the total distance traveled , as in the Seervada Park example . 2 .
Minimize ...
Other Applications Not all applications of the shortest - path problem involve
minimizing the distance traveled from the origin to the destination . In fact , they ...
Minimize the total distance traveled , as in the Seervada Park example . 2 .
Minimize ...
Page 550
Because the objective is to minimize the probability of failure , two more top
scientists have been assigned to the project . Table 11 . 2 gives the estimated
probability that the respective teams will fail when 0 , 1 , or 2 additional scientists
are ...
Because the objective is to minimize the probability of failure , two more top
scientists have been assigned to the project . Table 11 . 2 gives the estimated
probability that the respective teams will fail when 0 , 1 , or 2 additional scientists
are ...
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 |