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 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 phase 1 problem .
Minimize Z = 5,000xı + 7,000x2 , subject to 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 phase 1 problem .
Page 415
Other Applications Not all applications of the shortest - path problem involve minimizing the distance traveled from the origin to the destination . ... Minimize the total distance traveled , as in the Seervada Park example . 2.
Other Applications Not all applications of the shortest - path problem involve minimizing the distance traveled from the origin to the destination . ... Minimize the total distance traveled , as in the Seervada Park example . 2.
Page 927
Determine how many cash registers Jim should have open during lunch time to minimize his expected total cost per hour . 18.2-1 . For each kind of queueing system listed in Prob . 17.3-1 , briefly describe the nature of the cost of ...
Determine how many cash registers Jim should have open during lunch time to minimize his expected total cost per hour . 18.2-1 . For each kind of queueing system listed in Prob . 17.3-1 , briefly describe the nature of the cost of ...
What people are saying - Write a review
User Review - Flag as inappropriate
i
User Review - Flag as inappropriate
I want review this book
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 constraint Construct corresponding cost CPF solution decision variables demand described determine distribution dual problem entering equal equations estimates example feasible feasible region 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 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 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 |