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 58
Page 385
... assignment problem , practitioners normally do not bother writing out the full mathematical model . It is simpler to formulate the problem by filling out a cost table ( e.g. , Table 8.25 ) , including identifying the assignees and tasks ...
... assignment problem , practitioners normally do not bother writing out the full mathematical model . It is simpler to formulate the problem by filling out a cost table ( e.g. , Table 8.25 ) , including identifying the assignees and tasks ...
Page 399
... assignment problem having the following cost table . Assignee 1 2 Task 3 5345 6587 8696 ABCD 7 7 4 6 6 ( a ) Draw the network representation of this assignment problem . ( b ) Formulate this problem as a transportation problem by con ...
... assignment problem having the following cost table . Assignee 1 2 Task 3 5345 6587 8696 ABCD 7 7 4 6 6 ( a ) Draw the network representation of this assignment problem . ( b ) Formulate this problem as a transportation problem by con ...
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 ... problem ? 400 8 THE TRANSPORTATION AND ASSIGNMENT PROBLEMS.
... 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 ... problem ? 400 8 THE TRANSPORTATION AND ASSIGNMENT PROBLEMS.
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 cost CPF solution CPLEX decision variables described 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 graphical identify increase initial BF solution integer interior-point iteration leaving basic variable linear programming model linear programming problem LINGO LP relaxation lution 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 shown simplex method slack variables solve the model Solver spreadsheet step subproblem surplus variables Table tion values weeks Wyndor Glass x₁ zero