Introduction to Operations Research, Volume 1CD-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 15
... involves finding an optimal solution for the model . Thus , in addition to pursuing the science of the ultimate , the team should also consider the cost of the study and the disadvantages of delaying its completion , and then attempt to ...
... involves finding an optimal solution for the model . Thus , in addition to pursuing the science of the ultimate , the team should also consider the cost of the study and the disadvantages of delaying its completion , and then attempt to ...
Page 24
... involves the general problem of allocating limited resources among competing activities in a best possible ( i.e. , optimal ) way . More precisely , this problem involves se- lecting the level of certain activities that compete for ...
... involves the general problem of allocating limited resources among competing activities in a best possible ( i.e. , optimal ) way . More precisely , this problem involves se- lecting the level of certain activities that compete for ...
Page 219
... involves the revised simplex method . As described in the pre- ceding section ( see Table 5.8 ) , this method used B1 and the initial tableau to calculate all the relevant numbers in the current tableau for every iteration . It goes ...
... involves the revised simplex method . As described in the pre- ceding section ( see Table 5.8 ) , this method used B1 and the initial tableau to calculate all the relevant numbers in the current tableau for every iteration . It goes ...
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 CPF solution CPLEX decision variables described dual problem dynamic programming entering basic variable example feasible region feasible solutions final simplex tableau final tableau following problem formulation functional constraints Gaussian elimination given goal goal programming graphical identify increase initial BF solution integer interior-point 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 right-hand sides sensitivity analysis shadow prices shown simplex method slack variables solve the model Solver spreadsheet step subproblem surplus variables Table tion values weeks Wyndor Glass x₁ zero