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 177
Suppose that the following constraints have been provided for a linear
programming model with decision variables x, and x2. —x| + 3x2 S 30 —3x, + x3
S 30 and X12 0, X2 2 (a) Demonstrate graphically that the feasible region is
unbounded.
Suppose that the following constraints have been provided for a linear
programming model with decision variables x, and x2. —x| + 3x2 S 30 —3x, + x3
S 30 and X12 0, X2 2 (a) Demonstrate graphically that the feasible region is
unbounded.
Page 236
Summary of Primal-Dual Relationships Weak duality property: If x is a feasible
solution for the primal problem and y is a feasible solution for the dual problem,
then cx s yb. For example, for the Wyndor Glass Co. problem, one feasible
solution ...
Summary of Primal-Dual Relationships Weak duality property: If x is a feasible
solution for the primal problem and y is a feasible solution for the dual problem,
then cx s yb. For example, for the Wyndor Glass Co. problem, one feasible
solution ...
Page 246
No Superoptimal Neither feasible nor superoptimal To review the reasoning
behind this property, note that the dual solution (y*, z* — c) must be feasible for
the dual problem because the condition for optimality for the primal problem
requires ...
No Superoptimal Neither feasible nor superoptimal To review the reasoning
behind this property, note that the dual solution (y*, z* — c) must be feasible for
the dual problem because the condition for optimality for the primal problem
requires ...
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 amount analysis apply approach assignment assumed basic variable begin BF solution calculate called changes column complete Consider constraints Construct corresponding cost CPF solution customers decision demand described determine developed distribution entering equations estimated example expected feasible FIGURE first flow formulation given gives hour identify illustrate increase indicates initial inventory involves iteration linear programming machine Maximize mean million Minimize month needed node objective function obtained operations optimal optimal solution original parameter path 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 |