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 86
Page 130
... optimal solution ) that a problem can have more than one optimal solution . This fact was illustrated in Fig . 3.5 by changing the objective function in the Wyndor Glass Co. problem to Z = 3x1 + 2x2 , so that every point on the line ...
... optimal solution ) that a problem can have more than one optimal solution . This fact was illustrated in Fig . 3.5 by changing the objective function in the Wyndor Glass Co. problem to Z = 3x1 + 2x2 , so that every point on the line ...
Page 278
... optimal solution is ( 4,3 ) . When c2 is increased , this solution remains optimal only for c2 ≤ 4. For c2 = 4 , ( 0 , 2 ) becomes optimal ( with a tie at c2 = 4 ) , because of the constraint boundary 3x1 + 4x2 = 18. When c2 is ...
... optimal solution is ( 4,3 ) . When c2 is increased , this solution remains optimal only for c2 ≤ 4. For c2 = 4 , ( 0 , 2 ) becomes optimal ( with a tie at c2 = 4 ) , because of the constraint boundary 3x1 + 4x2 = 18. When c2 is ...
Page 1082
... optimal solution to identify an optimal policy . 21.3-4 . Reconsider Prob . 21.2-4 . ( a ) Formulate a linear programming model for finding an optimal policy . c ( b ) Use the simplex method to solve this model . Use the re- sulting optimal ...
... optimal solution to identify an optimal policy . 21.3-4 . Reconsider Prob . 21.2-4 . ( a ) Formulate a linear programming model for finding an optimal policy . c ( b ) Use the simplex method to solve this model . Use the re- sulting optimal ...
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
Bibliographic information
| Title | Introduction to Operations Research McGraw-Hill International Editions McGraw-Hill industrial & plant engineering series McGraw-Hill series in industrial engineering and management science |
| Authors | Frederick S. Hillier, Gerald J. Lieberman |
| Edition | 7, illustrated |
| Publisher | McGraw-Hill, 2001 |
| Original from | Pennsylvania State University |
| Digitized | 26 Aug 2009 |
| ISBN | 0071181636, 9780071181631 |
| Length | 1214 pages |
| Export Citation | BiBTeX EndNote RefMan |