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 76
Page 19
Then , even as personnel changes , the system can be called on at regular intervals to provide a specific numerical solution . ' This system usually is computer - based . In fact , a considerable number of computer programs often need ...
Then , even as personnel changes , the system can be called on at regular intervals to provide a specific numerical solution . ' This system usually is computer - based . In fact , a considerable number of computer programs often need ...
Page 33
+ Cn Xn , is called the objective func+ CnXn tion . The restrictions normally are referred to as constraints . The first m constraints ( those with a function of all the variables a ; 1x1 + 2 ; 2X2 + + Ainxn on the left - hand side ) ...
+ Cn Xn , is called the objective func+ CnXn tion . The restrictions normally are referred to as constraints . The first m constraints ( those with a function of all the variables a ; 1x1 + 2 ; 2X2 + + Ainxn on the left - hand side ) ...
Page 421
This kind of problem is called a maximum flow problem . In general terms , the maximum flow problem can be described as follows . 1. All flow through a directed and connected network originates at one node , called the source ...
This kind of problem is called a maximum flow problem . In general terms , the maximum flow problem can be described as follows . 1. All flow through a directed and connected network originates at one node , called the source ...
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