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 81
Page 382
The objective is to determine how all n assignments should be made to minimize
the total cost . Any problem satisfying all these assumptions can be solved
extremely efficiently by algorithms designed specifically for assignment problems
.
The objective is to determine how all n assignments should be made to minimize
the total cost . Any problem satisfying all these assumptions can be solved
extremely efficiently by algorithms designed specifically for assignment problems
.
Page 399
The objective is to make these assignments so as to minimize the total cost of
producing these amounts of the three products . ( a ) Formulate this problem as
an assignment problem by constructing the appropriate cost table . c ( b ) Obtain
an ...
The objective is to make these assignments so as to minimize the total cost of
producing these amounts of the three products . ( a ) Formulate this problem as
an assignment problem by constructing the appropriate cost table . c ( b ) Obtain
an ...
Page 400
( c ) Reformulate this assignment problem as an equivalent trans - portation
problem with two sources and three destinations ... C ( d ) Obtain an optimal
solution for the problem as formulated in part ( c ) . choice of these assignments
of plants to ...
( c ) Reformulate this assignment problem as an equivalent trans - portation
problem with two sources and three destinations ... C ( d ) Obtain an optimal
solution for the problem as formulated in part ( c ) . choice of these assignments
of plants to ...
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 | |
57 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 calculations called capacity changes coefficients column complete Consider constraints construct corresponding cost CPF solution demand described determine direction distribution dual problem entering equal equations estimates example feasible FIGURE final flow problem Formulate 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 resource respective resulting revised Select shown shows side simplex method simplex tableau slack solve step supply Table tableau tion unit values weeks Wyndor Glass zero
Bibliographic information
| Title | Introduction to Operations Research McGraw-Hill International Editions McGraw-Hill industrial & plant engineering series McGraw-Hill series in industrial engineering and management science |
| Authors | Frederick S. Hillier, Gerald J. Lieberman |
| Edition | 7, illustrated |
| Publisher | McGraw-Hill, 2001 |
| Original from | Pennsylvania State University |
| Digitized | 26 Aug 2009 |
| ISBN | 0071181636, 9780071181631 |
| Length | 1214 pages |
| Export Citation | BiBTeX EndNote RefMan |