Introduction to Operations Research, Volume 1-- This classic, field-defining text is the market leader in Operations Research -- and it's now updated and expanded to keep professionals a step ahead -- Features 25 new detailed, hands-on case studies added to the end of problem sections -- plus an expanded look at project planning and control with PERT/CPM -- A new, software-packed CD-ROM contains Excel files for examples in related chapters, numerous Excel templates, plus LINDO and LINGO files, along with MPL/CPLEX Software and MPL/CPLEX files, each showing worked-out examples |
From inside the book
Results 1-3 of 96
Page 216
Even when the simplex method has gone through hundreds or thousands of
iterations , the coefficients of the slack variables in the final tableau will reveal
how this tableau has been obtained from the initial tableau . Furthermore , the
same ...
Even when the simplex method has gone through hundreds or thousands of
iterations , the coefficients of the slack variables in the final tableau will reveal
how this tableau has been obtained from the initial tableau . Furthermore , the
same ...
Page 252
With the Big M method , since M has been added initially to the coefficient of each
artificial variable in row 0 , the current value of each corresponding dual ... After M
is subtracted from the coefficients of the artificial variables ła and , the optimal ...
With the Big M method , since M has been added initially to the coefficient of each
artificial variable in row 0 , the current value of each corresponding dual ... After M
is subtracted from the coefficients of the artificial variables ła and , the optimal ...
Page 273
Analyzing Simultaneous Changes in Objective Function Coefficients .
Regardless of whether x ; is a basic or nonbasic variable , the allowable range to
stay optimal for Cj is valid only if this objective function coefficient is the only one
being ...
Analyzing Simultaneous Changes in Objective Function Coefficients .
Regardless of whether x ; is a basic or nonbasic variable , the allowable range to
stay optimal for Cj is valid only if this objective function coefficient is the only one
being ...
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
Common terms and phrases
activity additional algorithm alternative amount analysis apply assignment assumed basic variable begin BF solution calculate called changes coefficients column complete Consider constraints Construct corresponding cost CPF solution customers decision demand described determine developed distribution entering equations estimated example expected feasible FIGURE final flow formulation given gives hour identify illustrate increase indicates initial inventory iteration linear programming machine Maximize mean million Minimize month needed node objective function obtained operations optimal optimal solution original parameter path payoff plant player possible presented Prob probability problem procedure profit programming problem queueing respectively resulting shown shows side simplex method solution solve step strategy Table tableau tion transportation unit waiting weeks
Bibliographic information
| Title | Introduction to Operations Research, Volume 1 Introduction to Operations Research, Frederick S. Hillier 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 | the University of Michigan |
| Digitized | 8 Aug 2011 |
| ISBN | 0072416181, 9780072416183 |
| Length | 1214 pages |
| Export Citation | BiBTeX EndNote RefMan |