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 82
Page 176
Maximize Z = 2xy + 3x2 , x 20 , X220 , X3 20 . subject to x ] + 2x2 < 30 X1 + X2 =
20 and DI ( a ) Work through the simplex method step by step in algebraic form to
solve this problem . DI ( b ) Work through the simplex method step by step in ...
Maximize Z = 2xy + 3x2 , x 20 , X220 , X3 20 . subject to x ] + 2x2 < 30 X1 + X2 =
20 and DI ( a ) Work through the simplex method step by step in algebraic form to
solve this problem . DI ( b ) Work through the simplex method step by step in ...
Page 573
Maximize Z = xzxzx } , Parallel Units Component 1 Component 2 Component 3
Component 4 subject to 1 2 3 0.5 0.6 0.8 0.6 0.7 0.8 0.7 0.8 0.9 0.5 0.7 0.9 x1 +
2x2 + 3x3 = 10 x , 21 , X2 21 , x3 = 1 , The probability that the system will function
is ...
Maximize Z = xzxzx } , Parallel Units Component 1 Component 2 Component 3
Component 4 subject to 1 2 3 0.5 0.6 0.8 0.6 0.7 0.8 0.7 0.8 0.9 0.5 0.7 0.9 x1 +
2x2 + 3x3 = 10 x , 21 , X2 21 , x3 = 1 , The probability that the system will function
is ...
Page 574
Consider the following nonlinear programming problem . x } + x 2 2 . ( There are
no nonnegativity constraints . ) Use dynamic programming to solve this problem .
Maximize Z = 5x1 + x2 , 11.3-19 . Consider the following nonlinear programming
...
Consider the following nonlinear programming problem . x } + x 2 2 . ( There are
no nonnegativity constraints . ) Use dynamic programming to solve this problem .
Maximize Z = 5x1 + x2 , 11.3-19 . Consider the following nonlinear programming
...
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 allowable amount apply assignment basic solution basic variable BF solution bound boundary called changes coefficients column complete Consider constraints Construct corresponding cost CPF solution decision variables demand described determine distribution dual problem entering equal equations estimates example feasible feasible region FIGURE final flow formulation functional constraints given gives goal identify illustrate increase indicates initial iteration linear programming Maximize million Minimize month needed node nonbasic variables objective function obtained operations optimal optimal solution original parameters path Plant possible presented primal problem Prob procedure profit programming problem provides range remaining resource respective resulting shown shows side simplex method simplex tableau slack solve step supply Table tableau tion unit weeks Wyndor Glass zero
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 |