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 71
Page 539
In general , the states are the various possible conditions in which the system might be at that stage of the problem . The number of states may be either finite ( as in the stagecoach problem ) or infinite ( as in some subsequent ...
In general , the states are the various possible conditions in which the system might be at that stage of the problem . The number of states may be either finite ( as in the stagecoach problem ) or infinite ( as in some subsequent ...
Page 556
We now have an infinite number of possible states ( 240 = 5z = 255 ) , so it is no longer feasible to solve separately for x * for each possible value of S3 . Therefore , we instead have solved for x3 as a function of the unknown S3 .
We now have an infinite number of possible states ( 240 = 5z = 255 ) , so it is no longer feasible to solve separately for x * for each possible value of S3 . Therefore , we instead have solved for x3 as a function of the unknown S3 .
Page 587
K out of N Constraints Must Hold Consider the case where the overall model includes a set of N possible constraints such that only some K of these constraints must hold . ( Assume that K < N . ) Part of the optimization process is to ...
K out of N Constraints Must Hold Consider the case where the overall model includes a set of N possible constraints such that only some K of these constraints must hold . ( Assume that K < N . ) Part of the optimization process is to ...
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