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 77
Page 408
... flow of some type through them , e.g. , the flow of trams on the roads of Seervada Park in Sec . 9.1 . Table 9.1 gives several examples of flow in typical networks . If flow through an arc is allowed in only one direction ( e.g. , a ...
... flow of some type through them , e.g. , the flow of trams on the roads of Seervada Park in Sec . 9.1 . Table 9.1 gives several examples of flow in typical networks . If flow through an arc is allowed in only one direction ( e.g. , a ...
Page 422
... flow of water through a system of aqueducts . 5. Maximize the flow of vehicles through a transportation network . For some of these applications , the flow through the network may originate at more than one node and may also terminate ...
... flow of water through a system of aqueducts . 5. Maximize the flow of vehicles through a transportation network . For some of these applications , the flow through the network may originate at more than one node and may also terminate ...
Page 429
... flows then are used to calculate the net flow generated at each of the nodes ( see columns H and I ) . These net flows are required to be 0 for the transshipment nodes ( A , B , C , D , and E ) , as indicated by the second set of ...
... flows then are used to calculate the net flow generated at each of the nodes ( see columns H and I ) . These net flows are required to be 0 for the transshipment nodes ( A , B , C , D , and E ) , as indicated by the second set of ...
Other editions - View all
Introduction to Operations Research Frederick S. Hillier,Gerald J. Lieberman No preview available - 2001 |
Common terms and phrases
activity algebraic algorithm allowable range artificial variables b₂ basic solution c₁ c₂ changes coefficients column Consider the following cost Courseware CPLEX decision variables dual problem dual simplex method dynamic programming entering basic variable estimates example feasible region feasible solutions final simplex tableau final tableau following problem formulation functional constraints Gaussian elimination given goal programming graphical identify increase initial BF solution integer iteration leaving basic variable linear programming model linear programming problem LINGO LP relaxation lution Maximize Z maximum flow problem Minimize needed node nonbasic variables nonnegativity constraints objective function obtained optimal solution optimality test parameters path plant presented in Sec primal problem Prob procedure range to stay resource right-hand sides sensitivity analysis shadow prices shown slack variables solve the model Solver spreadsheet step subproblem surplus variables Table tion unit profit values weeks Wyndor Glass x₁ zero