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 . 9 → D 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 . 9 → D 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 additional algorithm allowable amount apply assignment basic solution basic variable BF solution bound boundary called changes coefficients column complete Consider constraints Construct corresponding cost CPF solution decision variables demand described determine direction distribution dual problem entering equal equations estimates example feasible feasible region FIGURE final flow formulation functional constraints given gives goal identify illustrate increase indicates initial iteration linear programming Maximize million Minimize month needed node nonbasic variables objective function obtained operations optimal optimal solution original parameters path Plant possible presented primal problem Prob procedure profit programming problem provides range remaining resource respective resulting shown shows side simplex method simplex tableau slack solve step supply Table tableau tion unit weeks Wyndor Glass zero