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 87
Page 33
5 The Wyndor Glass Co . problem would have multiple optimal solutions if the
objective function were changed to Z = 3x1 + 2x2 . 0 2 4 ô 8 10 x on the line
segment connecting ( 2 , 6 ) and ( 4 , 3 ) would be optimal . This case is illustrated
in Fig ...
5 The Wyndor Glass Co . problem would have multiple optimal solutions if the
objective function were changed to Z = 3x1 + 2x2 . 0 2 4 ô 8 10 x on the line
segment connecting ( 2 , 6 ) and ( 4 , 3 ) would be optimal . This case is illustrated
in Fig ...
Page 397
The unit costs are DI 8 . 2 - 15 . Reconsider Prob . 8 . 1 - 4 . Starting with the
northwest corner rule , interactively apply the transportation simplex method to
obtain an optimal solution for this problem . D , 1 8 . 2 - 16 . Reconsider Prob . 8 .
1 - 6 .
The unit costs are DI 8 . 2 - 15 . Reconsider Prob . 8 . 1 - 4 . Starting with the
northwest corner rule , interactively apply the transportation simplex method to
obtain an optimal solution for this problem . D , 1 8 . 2 - 16 . Reconsider Prob . 8 .
1 - 6 .
Page 400
C ( d ) Obtain an optimal solution for the problem as formulated in part ( c ) .
choice of these assignments of plants to distribution centers is to be made solely
on the basis of minimizing total shipping cost . ( a ) Formulate this problem as an
...
C ( d ) Obtain an optimal solution for the problem as formulated in part ( c ) .
choice of these assignments of plants to distribution centers is to be made solely
on the basis of minimizing total shipping cost . ( a ) Formulate this problem as an
...
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