Introduction to Operations ResearchCD-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 82
Page 102
... solve the model . c ( d ) Use LINGO to formulate this model in a compact form . Then use the LINGO solver to solve the model . c 3.7-2 . Reconsider Prob . 3.1-11 . ( a ) Use MPL / CPLEX to formulate and solve the model for this problem ...
... solve the model . c ( d ) Use LINGO to formulate this model in a compact form . Then use the LINGO solver to solve the model . c 3.7-2 . Reconsider Prob . 3.1-11 . ( a ) Use MPL / CPLEX to formulate and solve the model for this problem ...
Page 178
... solve the problem . 4.6-2 . Consider the following problem . Maximize subject to Z = 4x1 + 2x2 + 3x3 + 5X4 , initial ( artificial ) BF solution . Also identify the initial entering basic variable and the leaving basic variable . I ( c ) ...
... solve the problem . 4.6-2 . Consider the following problem . Maximize subject to Z = 4x1 + 2x2 + 3x3 + 5X4 , initial ( artificial ) BF solution . Also identify the initial entering basic variable and the leaving basic variable . I ( c ) ...
Page 640
... solve this problem . 12.6-9 . * Consider the following nonlinear BIP problem . Maximize subject to x , is binary , Z = 80x1 + 60x2 + 40x3 + 20x4 - − ( 7x1 + 5x2 + 3x3 + 2x4 ) 2 , DI ( d ) Use the BIP branch - and - bound algorithm ...
... solve this problem . 12.6-9 . * Consider the following nonlinear BIP problem . Maximize subject to x , is binary , Z = 80x1 + 60x2 + 40x3 + 20x4 - − ( 7x1 + 5x2 + 3x3 + 2x4 ) 2 , DI ( d ) Use the BIP branch - and - bound algorithm ...
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 Courseware CPLEX decision variables described 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 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 resource right-hand sides sensitivity analysis shadow prices shown simplex method slack variables solve the model Solver spreadsheet step subproblem surplus variables Table tion unit profit values weeks Wyndor Glass x₁ zero