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 81
Page 164
... algorithm and its subsequent vari- ants that use the interior - point approach . The Key Solution Concept Although radically different from the simplex method , Karmarkar's algorithm does share a few of the same characteristics . It is ...
... algorithm and its subsequent vari- ants that use the interior - point approach . The Key Solution Concept Although radically different from the simplex method , Karmarkar's algorithm does share a few of the same characteristics . It is ...
Page 616
... ALGORITHM FOR MIXED INTEGER PROGRAMMING We shall now consider the general MIP problem , where some of the variables ... algorithm for solving this problem that , with a variety of refinements , has provided a standard approach to ...
... ALGORITHM FOR MIXED INTEGER PROGRAMMING We shall now consider the general MIP problem , where some of the variables ... algorithm for solving this problem that , with a variety of refinements , has provided a standard approach to ...
Page 640
... algorithm for sequencing prob- lems of this type by specifying how the branch , bound , and fathoming steps would be performed . ( b ) Use this algorithm to solve this problem . 12.6-9 . * Consider the following nonlinear BIP problem ...
... algorithm for sequencing prob- lems of this type by specifying how the branch , bound , and fathoming steps would be performed . ( b ) Use this algorithm to solve this problem . 12.6-9 . * Consider the following nonlinear BIP problem ...
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