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 73
Page 397
Both other energy needs can be met by any source or combination of sources .
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 ...
Both other energy needs can be met by any source or combination of sources .
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 ...
Page 711
005 ) . c ( d ) Apply the automatic routine for the gradient search procedure ( with
€ = 0 . 01 ) in your OR Courseware to this problem . D . I . C 13 . 5 - 8 . * Starting
from the initial trial solution ( x1 , x2 ) = ( 0 , 0 ) , interactively apply the gradient ...
005 ) . c ( d ) Apply the automatic routine for the gradient search procedure ( with
€ = 0 . 01 ) in your OR Courseware to this problem . D . I . C 13 . 5 - 8 . * Starting
from the initial trial solution ( x1 , x2 ) = ( 0 , 0 ) , interactively apply the gradient ...
Page 718
Starting from the initial trial solution ( X1 , X2 , X3 ) = ( 0 , 0 , 0 ) , apply two
iterations of the FrankWolfe algorithm . X120 , X2 2 0 . ( a ) Starting from the initial
trial solution ( x1 , x2 ) = ( d , h ) , apply three iterations of the Frank - Wolfe
algorithm .
Starting from the initial trial solution ( X1 , X2 , X3 ) = ( 0 , 0 , 0 ) , apply two
iterations of the FrankWolfe algorithm . X120 , X2 2 0 . ( a ) Starting from the initial
trial solution ( x1 , x2 ) = ( d , h ) , apply three iterations of the Frank - Wolfe
algorithm .
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 |