## Introduction to Operations ResearchCD-ROM contains: Student version of MPL Modeling System and its solver CPLEX -- MPL tutorial -- Examples from the text modeled in MPL -- Examples from the text modeled in LINGO/LINDO -- Tutorial software -- Excel add-ins: TreePlan, SensIt, RiskSim, and Premium Solver -- Excel spreadsheet formulations and templates. |

### From inside the book

Results 1-3 of 85

Page 388

There are more products ( four ) than plants ( three ) , so one of the plants will

need to be

product possible within an

are split ...

There are more products ( four ) than plants ( three ) , so one of the plants will

need to be

**assigned**two products . ... To make this**assignment**of an extraproduct possible within an

**assignment**problem formulation , Plants 1 and 2 eachare split ...

Page 399

Consider the

Assignee noon 8 . 3 - 3 . Reconsider Prob . 8 . 1 - 3 . Suppose that the sales

forecasts have been revised downward to 240 , 400 , and 320 units per day of ...

Consider the

**assignment**problem having the following cost table . Task 1 2 3 4Assignee noon 8 . 3 - 3 . Reconsider Prob . 8 . 1 - 3 . Suppose that the sales

forecasts have been revised downward to 240 , 400 , and 320 units per day of ...

Page 408

For example , if a flow of 10 has been

of 4 is

the original

For example , if a flow of 10 has been

**assigned**in one direction and then a flowof 4 is

**assigned**in the opposite direction , the actual effect is to cancel 4 units ofthe original

**assignment**by reducing the flow in the original direction from 10 to 6 .### What people are saying - Write a review

User Review - Flag as inappropriate

i

User Review - Flag as inappropriate

I want review this book

### Contents

SUPPLEMENT TO APPENDIX 3 | 3 |

Problems | 6 |

An Algorithm for the Assignment Problem | 18 |

Copyright | |

59 other sections not shown

### Other editions - View all

### Common terms and phrases

activity additional algorithm allocation 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 solutions 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 nonnegative 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 revised shown shows side simplex method simplex tableau slack solve step supply Table tableau tion transportation unit values weeks Wyndor Glass zero