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 116
The fact that corner - point solutions ( and so basic solutions ) can be either
feasible or infeasible implies the following definition : A basic feasible ( BF )
solution is an augmented CPF solution . Thus , the CPF solution ( 0 , 6 ) in the
example is ...
The fact that corner - point solutions ( and so basic solutions ) can be either
feasible or infeasible implies the following definition : A basic feasible ( BF )
solution is an augmented CPF solution . Thus , the CPF solution ( 0 , 6 ) in the
example is ...
Page 243
A key insight here is that the dual solution read from row 0 must also be a basic
solution ! The reason is that the m basic variables for the primal problem are
required to have a coefficient of zero in row 0 , which thereby requires the m ...
A key insight here is that the dual solution read from row 0 must also be a basic
solution ! The reason is that the m basic variables for the primal problem are
required to have a coefficient of zero in row 0 , which thereby requires the m ...
Page 246
10 Classification of basic solutions Satisfies Condition for Optimality ? No Yes
Yes Feasible ? Optimal Superoptimal Suboptimal Neither feasible nor
superoptimal No | To review the reasoning behind this property , note that the
dual solution ( y ...
10 Classification of basic solutions Satisfies Condition for Optimality ? No Yes
Yes Feasible ? Optimal Superoptimal Suboptimal Neither feasible nor
superoptimal No | To review the reasoning behind this property , note that the
dual solution ( y ...
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 |