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 90
Page 382
... assignments should be made to minimize the total cost . Any problem satisfying all these assumptions can be solved extremely efficiently by al- gorithms designed specifically for assignment problems . The first three assumptions are ...
... assignments should be made to minimize the total cost . Any problem satisfying all these assumptions can be solved extremely efficiently by al- gorithms designed specifically for assignment problems . The first three assumptions are ...
Page 388
... assignment of an extra product possible within an assignment problem formulation , Plants 1 and 2 each are split into two assignees , as shown in Table 8.29 . The number of assignees ( now five ) must equal the number of tasks ( now ...
... assignment of an extra product possible within an assignment problem formulation , Plants 1 and 2 each are split into two assignees , as shown in Table 8.29 . The number of assignees ( now five ) must equal the number of tasks ( now ...
Page 400
... assignment problem as an equivalent trans- portation problem with two sources and three destinations by constructing the appropriate parameter table . c ( d ) Obtain an optimal solution for the problem as formulated in part ( c ) . 8.3 ...
... assignment problem as an equivalent trans- portation problem with two sources and three destinations by constructing the appropriate parameter table . c ( d ) Obtain an optimal solution for the problem as formulated in part ( c ) . 8.3 ...
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 corresponding cost Courseware CPF solution CPLEX decision variables dual problem dynamic programming entering basic variable estimates example feasible region feasible solutions final simplex tableau final tableau flow following problem formulation functional constraints Gaussian elimination given graphical identify increase initial BF solution integer interior-point iteration leaving basic variable linear programming model linear programming problem LINGO LP relaxation lution Maximize subject 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 simplex method slack variables solve the model Solver spreadsheet step subproblem surplus variables Table tion values weeks Wyndor Glass x₁ zero