## 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 86

Page 25

cedure , called the simplex method , is available for solving

problems of even enormous size . These are some of the reasons for the

tremendous impact of

great ...

cedure , called the simplex method , is available for solving

**linear programming**problems of even enormous size . These are some of the reasons for the

tremendous impact of

**linear programming**in recent decades . Because of itsgreat ...

Page 31

All three packages include the simplex method for solving

models . Section 3.6 describes how to use Excel to formulate and solve

packages ...

All three packages include the simplex method for solving

**linear programming**models . Section 3.6 describes how to use Excel to formulate and solve

**linear****programming**models in a spreadsheet format . Descriptions of the otherpackages ...

Page 340

Various other special - purpose algorithms also have been developed to exploit

the special structure of particular types of

those to be discussed in Chaps . 8 and 9 ) . Much research is currently being ...

Various other special - purpose algorithms also have been developed to exploit

the special structure of particular types of

**linear programming**problems ( such asthose to be discussed in Chaps . 8 and 9 ) . Much research is currently 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