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 82
Page 72
After a few seconds ( for a small problem ) , Solver will then indicate the results . ... The spreadsheet also indicates the value of the objective function , as well as the amount of each resource that is being used .
After a few seconds ( for a small problem ) , Solver will then indicate the results . ... The spreadsheet also indicates the value of the objective function , as well as the amount of each resource that is being used .
Page 199
Each constraint has an indicating variable that completely indicates ( by whether its value is zero ) whether that constraint's boundary equation is satisfied by the current solution . A summary appears in Table 5.3 .
Each constraint has an indicating variable that completely indicates ( by whether its value is zero ) whether that constraint's boundary equation is satisfied by the current solution . A summary appears in Table 5.3 .
Page 450
These numbers are summarized in the following table , where a dash indicates that there is no road directly connecting these two towns without going through any other towns . D : The demonstration example listed above may be helpful .
These numbers are summarized in the following table , where a dash indicates that there is no road directly connecting these two towns without going through any other towns . D : The demonstration example listed above may be helpful .
What people are saying - Write a review
We haven't found any reviews in the usual places.
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 allocation allowable range artificial variables assignment problem augmenting path basic solution Big M method changes coefficients column Consider the following constraint boundary corresponding CPLEX decision variables 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 graphically identify increase initial BF solution integer interior-point iteration leaving basic variable linear programming model linear programming problem LP relaxation lution Maximize Maximize Z maximum flow problem Minimize needed node nonbasic variables objective function obtained optimal solution optimality test path Plant presented in Sec primal problem Prob procedure range to stay resource right-hand sides sensitivity analysis shadow prices slack variables solve this model Solver spreadsheet step subproblem surplus variables tion transportation problem transportation simplex method weeks Wyndor Glass x₁ zero