## 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 84

Page 391

... problem , including its various special cases . A supplementary chapter ( Chap . 23 ) on the book's website , www.mhhe.com/hillier , describes various additional special types of

... problem , including its various special cases . A supplementary chapter ( Chap . 23 ) on the book's website , www.mhhe.com/hillier , describes various additional special types of

**linear programming problems**. One of these , called the ...Page 391

... problem , including its various special cases . A supplementary chapter ( Chap . 23 ) on the book's website , www.mhhe.com/hillier , describes various additional special types of

... problem , including its various special cases . A supplementary chapter ( Chap . 23 ) on the book's website , www.mhhe.com/hillier , describes various additional special types of

**linear programming problems**. One of these , called the ...Page 717

... programming formulation of this

... programming formulation of this

**problem**( with x1 and x2 as decision variables ) has the same form as the main case ...**linear programming**model where it is feasible to use OT even when the RT capacity at that plant is not fully used ...### 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