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

Page 174

Describe graphically what the simplex method does step by step to solve the

following problem . Minimize Z = 5x1 + 7x2 , subject to 4.2-2 . Reconsider the

model in

and ( c ) ...

Describe graphically what the simplex method does step by step to solve the

following problem . Minimize Z = 5x1 + 7x2 , subject to 4.2-2 . Reconsider the

model in

**Prob**. 4.1-5 . Follow the instructions of**Prob**. 4.2-1 for parts ( a ) , ( b ) ,and ( c ) ...

Page 289

Consider the model of

whether the current basic solution remains optimal after each of the following

independent changes . ( a ) The change in part ( e ) of

change in ...

Consider the model of

**Prob**. 6.7-1 . Use duality theory directly to determinewhether the current basic solution remains optimal after each of the following

independent changes . ( a ) The change in part ( e ) of

**Prob**. 6.7-1 ( b ) Thechange in ...

Page 397

Reconsider

apply the transportation simplex method to obtain an optimal solution for this

problem . DI 8.2-16 . Reconsider

approximation ...

Reconsider

**Prob**. 8.1-4 . Starting with the northwest corner rule , interactivelyapply the transportation simplex method to obtain an optimal solution for this

problem . DI 8.2-16 . Reconsider

**Prob**. 8.1-6 . Starting with Russell'sapproximation ...

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