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

A directed path from

A directed path from

**node**i to**node**j is a sequence of connecting arcs whose direction ( if any ) is toward**node**j , so that ... Frequently , an undirected path will have some arcs directed toward**node**; but others directed away ( i.e. ...Page 412

Candidates for nth nearest

Candidates for nth nearest

**node**: Each solved**node**that is directly connected by a link to one or more unsolved**nodes**provides one candidate — the unsolved**node**with the shortest connecting link . ( Ties provide additional candidates . ) ...Page 431

the network includes a dummy demand

the network includes a dummy demand

**node**that receives ( at zero cost ) all the unused supply capacity at the vendors . ... This application involves a company with several plants ( the supply**nodes**) that can produce the same products ...### 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