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 72
Page 576
... integer values . For example , it is often necessary to as- sign people , machines , and vehicles to activities in integer quantities . If requiring integer values is the only way in ... integer programming 576 Integer Programming.
... integer values . For example , it is often necessary to as- sign people , machines , and vehicles to activities in integer quantities . If requiring integer values is the only way in ... integer programming 576 Integer Programming.
Page 579
... integer programming where the basic decisions to be made are of the yes - or - no type . Like the second pair of decisions for this example , groups of yes - or - no decisions often constitute groups of mutually exclusive alternatives ...
... integer programming where the basic decisions to be made are of the yes - or - no type . Like the second pair of decisions for this example , groups of yes - or - no decisions often constitute groups of mutually exclusive alternatives ...
Page 1200
... integer programming , 577 applications airline industry , 584-585 capital budgeting , 580-581 dispatching shipments , 582-583 production and distribution , 581-582 scheduling asset divestiture , 584 scheduling interrelated activities ...
... integer programming , 577 applications airline industry , 584-585 capital budgeting , 580-581 dispatching shipments , 582-583 production and distribution , 581-582 scheduling asset divestiture , 584 scheduling interrelated activities ...
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 corresponding cost Courseware CPF solution CPLEX decision variables dual problem dynamic programming entering basic variable estimates example feasible region feasible solutions final simplex tableau final tableau flow following problem formulation functional constraints Gaussian elimination given graphical identify increase initial BF solution integer interior-point iteration leaving basic variable linear programming model linear programming problem LINGO LP relaxation lution Maximize subject 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 simplex method slack variables solve the model Solver spreadsheet step subproblem surplus variables Table tion values weeks Wyndor Glass x₁ zero