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
Follow the instructions of Prob . 4.6-6 for the following 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 ...
Follow the instructions of Prob . 4.6-6 for the following 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 ...
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 927
The time needed to serve a customer is estimated to have an exponential
distribution with a mean of 2 minutes . Determine how many cash registers Jim
should have open during lunch time to minimize his expected total cost per hour .
18.2-1 .
The time needed to serve a customer is estimated to have an exponential
distribution with a mean of 2 minutes . Determine how many cash registers Jim
should have open during lunch time to minimize his expected total cost per hour .
18.2-1 .
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