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 89
Page 249
constructing the dual problem except that the nonnegativity constraint for the
corresponding dual variable should be deleted ( i.e. , this variable is ... Another
shortcut involves functional constraints in > form for a maximization problem .
constructing the dual problem except that the nonnegativity constraint for the
corresponding dual variable should be deleted ( i.e. , this variable is ... Another
shortcut involves functional constraints in > form for a maximization problem .
Page 586
Either - Or Constraints Consider the important case where a choice can be made
between two constraints , so that only one ( either one ) must hold ( whereas the
other one can hold but is not required to do so ) . For example , there may be a ...
Either - Or Constraints Consider the important case where a choice can be made
between two constraints , so that only one ( either one ) must hold ( whereas the
other one can hold but is not required to do so ) . For example , there may be a ...
Page 587
Since y + 1 - y = 1 ( one yes ) automatically , there is no need to add another
constraint to force these two decisions to be ... K out of N Constraints Must Hold
Consider the case where the overall model includes a set of N possible
constraints ...
Since y + 1 - y = 1 ( one yes ) automatically , there is no need to add another
constraint to force these two decisions to be ... K out of N Constraints Must Hold
Consider the case where the overall model includes a set of N possible
constraints ...
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