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 98
Page 200
Now consider the basic feasible solutions . Note that the only requirements for a
solution to be feasible in the augmented form of the problem are that it satisfy the
system of equations and that all the variables be nonnegative . A BF solution is a
...
Now consider the basic feasible solutions . Note that the only requirements for a
solution to be feasible in the augmented form of the problem are that it satisfy the
system of equations and that all the variables be nonnegative . A BF solution is a
...
Page 397
2 to obtain an initial BF solution , and time how long you spend for each one .
Compare ... For each of the three initial BF solutions obtained in part ( a ) ,
calculate the percentage by which its objective function value exceeds the
optimal one .
2 to obtain an initial BF solution , and time how long you spend for each one .
Compare ... For each of the three initial BF solutions obtained in part ( a ) ,
calculate the percentage by which its objective function value exceeds the
optimal one .
Page 457
( b ) Use the optimality test to verify that this initial BF solution is optimal and that
there are multiple optimal solutions . Apply one iteration of the network simplex
method to find the other optimal BF solution , and then use these results to
identify ...
( b ) Use the optimality test to verify that this initial BF solution is optimal and that
there are multiple optimal solutions . Apply one iteration of the network simplex
method to find the other optimal BF solution , and then use these results to
identify ...
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
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 |