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 92
Page 31
... programming is too versatile to be completely characterized by a single example . In this section we discuss the general characteristics of linear programming problems , including ... LINEAR PROGRAMMING MODEL 31 The Linear Programming Model.
... programming is too versatile to be completely characterized by a single example . In this section we discuss the general characteristics of linear programming problems , including ... LINEAR PROGRAMMING MODEL 31 The Linear Programming Model.
Page 163
... model for the user of the model while still using MPL to formulate the model very efficiently . ( The student version of OptiMax 2000 is ... LINEAR PROGRAMMING PROBLEMS 163 The Interior-Point Approach to Solving Linear Programming Problems.
... model for the user of the model while still using MPL to formulate the model very efficiently . ( The student version of OptiMax 2000 is ... LINEAR PROGRAMMING PROBLEMS 163 The Interior-Point Approach to Solving Linear Programming Problems.
Page 717
... programming model described in Sec . 13.8 , except that the separable functions appear in a constraint function ... linear programming model . ( b ) Explain why the logic of separable programming also applies here to guarantee that an ...
... programming model described in Sec . 13.8 , except that the separable functions appear in a constraint function ... linear programming model . ( b ) Explain why the logic of separable programming also applies here to guarantee that an ...
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