Ex Libris                        Wanted                           
blank

       
blank

blank
blank
blank
blank
Fogiel M. The Operations Research Problem Solver
Fogiel M.  The Operations Research Problem Solver









?
Ctrl+Enter


: The Operations Research Problem Solver

: Fogiel M.

: en

: /

:

ed2k: ed2k stats

: 1996

: 1076

: 08.05.2008

: | | ID
blank
Absorbing state      1345 1346
Activity duration, most likely      831
Activity duration, optimistic      831
Activity duration, pessimistic      831
Activity, critical      832
Activity, dummy      81 833
Algorithm, cuts      637
Algorithm, Dijkstras      88 812 813
Algorithm, dual simplex      44 to 413 429 430 616 617 626
Algorithm, Ford Fulkerson      821 822
Algorithm, forward recursive      1235
Algorithm, fractional      625
Algorithm, greedy      815 816 835
Algorithm, Hildreths      1118
Algorithm, Ignall Schrages      838
Algorithm, Johnsons      836 837
Algorithm, northwest corner      53 to 59
Algorithm, simplex      31 to 355
Algorithm, Wolfes      1114 1115
Alternate optima      328
Analysis, broad-switching      1338
Analysis, input-output      215
Analysis, network      77 81
Applications, Atlantic city game      722
Applications, blending problem      212 43
Applications, boat manufacturing problem      434
Applications, cabinet makers product mix problem      433
Applications, capital budgeting      63 636 714
Applications, electric utility expansion problem      713
Applications, four sided plate      249
Applications, industrial production      231
Applications, minimal spanning tree problem      815 to 818
Applications, mining problem      410
Applications, space project problem      721
Applications, traveling salesman problem      640 641
Applications, warehouse problem      711
Approximation, normal      1225
Approximation, quadratic      924
Approximation, Vogels      510 to 514
Arborescence      810 826
ARC      82 85 88 818 825 828 829
Arrival rate, mean      1321 1314 1316
arrow diagrams      81 to 84 830
Artificial column exclusion rule      351
Artificial variables      311 329 333 337 340 346 413 412 421 425 431 447
Assignment problem      531 to 543
Atlantic city game      722
Augmented matrix      316
Auxiliary problem      344
Back order cost      1230 1231
Backward pass computation      831 833
Backward recursion      716
Barrier function method      1044 1045
BASIC      38 to 312 315
Basic feasible point      see Basic feasible solution
Basic feasible solution      38 39 311 315
Basic variable, primal      351
Basic variables      38 to 312 315 324 625
Basic vector      39
Basis      38 to 312 313
Beales method      1116 1117
Big-M technique      337 339 353 412 425 431
Bisecting search method      922 923
Blending problem      212 413
Boat manufacturing problem      434
Branch-and-bound, diagram      619
Branch-and-bound, method      610 to 624
Branch-and-bound, tree      640
Breakthrough      821 822
Broad-switching analysis      1338
Cabinet makers product mix problem      433
Canonical form, non-negativity constraints      220 to 224 341
Capacity cost      713
Capital budgeting problem      63 636 714
Central limit theorem      831
Chapman Kolmogorov difference equations      1343
Chart, Gantt      836
Chart, time      833
Column penalty      510 to 514
Column vector      39 331
Compound Poisson, distribution      1225
Compound Poisson, process      1225
Computation, backward pass      831 833
Computation, forward pass      831 833
Concave function      436
Concavity      218 219 436 911
Confidence interval      831
Conjugate directions      941 to 943
Convex, function      216 441 719
Convex, set      447 915
Convex, set of feasible solutions      445
Convexity      218 219 911
Convexity, boundary      98
Convexity, definition      94
Cost, back order      1230 1231
Cost, capacity      713
Cost, minimum      717
Cost, opportunity      522
Cost, ordering      1217 1218
Cost, purchasing      1218
Cost, shadow      529 534 1115
Cost, shortages      1227
Cost, storage      1217
Cost, total      1219
Cost, total fixed procurement      1232
Cost, total variable procurement      1232
Cost, unit variable      1220
Cost-profit ratio      1225
Cost-time slope      832
Crash point      832
Critical activity      832
Critical arc      828
Critical path      826 to 833
Cross elasticity      1015
Cumulative distribution function      1224 1228
Cut-tree      825
Cuts algorithm      637
Cutset      82 825
Cutting plane method      625 to 637 1039
Cycle, length      1213 1218 1211
Cycle, time      1221
Cyclic coordinate method, graph      925
Cyclic network      828
Dantzigs method      1110
Davidon Fletcher Powell method      941
Decision variables      78 712
Decomposition method      445 to 447
Degeneracy, test for      332 340 59 514 519 521 526
Degenerate initial feasible, solution      see Degeneracy
Degenerate tableau      see Degeneracy
Demand, continuous      1227
Demand, distribution function      1222
Demand, estimation      1223
Demand, exponentially distributed      1223 1226
Demand, identically distributed      1227
Demand, mean      1223 1226
Demand, random      1226 1227
Density function      1224
derivatives      96 to 911 1019
Deviational variables      455 456 458
Dichotomous search      916
Dijkstras algorithm      88 812 813
Distribution, compound Poisson      1225
Distribution, exponential      1316 to 1319
Distribution, Poisson      1225 1231 13-15 1343
Distribution, probability      831 1221 1328 1329 1335
Dominated strategy      1319
Dual      41
Dual, constraints      412 413 427
Dual, function      1113 1114
Dual, prices      445
Duality theorem      434
Duffin and Zeners technique      11
Dul simplex, algorithm      44 to 413 429 430 616 617 626
Dul simplex, criterion      441
Dul simplex, pivot      441
Dummy activity      811 833
Duplicate strategy      1319
Dynamic optimization      720
Dynamic programming, recursions      71 to 722
Earliest finish      830 833
Earliest occurrence time      827 828 830 831
Earliest start      830 832 833
Echelon form      32
Economic lot size      1218 1219 1215
Economic order quantity      1216 1212 1218
Economy-of-scale advantage      713
Eigenvalues      97 911
Elasticity, cross      1015
Elasticity, price      1015
Electric utility expansion problem      713
Employment goal      452
Equations, Chapman Kolmogorov      1243
Equations, difference      1343
Equations, flow conservation      812
Equations, linear      35 to 37 39
Equations, orthogonal system of      525
Euclidean norm      10
Expected net profit      1222
Exploratory search, type I      927
Exploratory search, type II      927
Exponential distribution      136 to 139
Extreme points      217
Feasible, integer solution      618
Feasible, region      68
Feasible, solutions      232 to 234 68
Fibonacci search      919 920 1047
Fletcher Powell deflected gradient method      939
Fletcher Reeves method      943
Flow conservation equation      82
Flow, maximum      819 to 825
Ford Fulkerson algorithm      821 822
Forest      825
Form, canonical      220 to 224
Form, echelon      32
Form, standard      225 to 230 310 317 318
Form, tableau      310 411
Form, Tucker Beale      615
Forward pass computation      831 833
Forward recursive algorithm      1235
Four-sided plate applications      249
Fractional algorithm      625
Fractional coefficients      625
Fractional cut      625
fractional parts      632
Fractional programming      1115 to 1119
Free float time      830 to 833
Fritz John optimality condition      1014 1015
Function, cumulative distribution      1224 1228
Function, density      1224
Function, exponential distribution      1316 to 1319
Function, Lagrangian      1215 1216
Function, normal probability density      915
Function, penalty      1040 to 1043 1045
Function, pseudo convex      923
Function, quadratic      1111 to 1110
Function, quasi-concave      915
Function, quasi-convex      915 918 920
Function, return      78
Function, separable      1120
Function, transition      78
Game, Atlantic city      722
Game, theory      1311 to 1334
Game, two-player zero-sum      1311 to 1327 1330
Gantt Chart      836
Gauss Jordan matrix      636
Genotype      1337
Geometric programming      1111 to 1114
Getter cells      520
Giver cells      520
Global optimum      105 109 1012 1018 1026 1032 1033 1049
Goal, constraints      448 456
Goal, employment      452
Goal, investment      452
Goal, multiple      452 454 458
Goal, multiple-conflicting      455
Goal, profit      448 452
Goal, programming      448 to 458
Goal, single      453
Golden section search      915 918
Gomory Baumol method      636
Gomory Hu procedure      825
Gomorys cutting plane method      632 to 634 636
Gradient method, Fletcher Powell deflected      939
Gradient method, Fletcher Reeves      943
Gradient method, optimal      937 938
Gradient search method      935 936
Gradient, matrix      940
Gradient, method      934
Gradient, vector      97 937
Gram Schmidt orthogonalization process      928 929
Graphical applications, arbitrage transactions      17
Graphical applications, linear programs, optimization      18 to 120
Graphical applications, maximization      122 123
Graphical applications, product mix, profit maximization      11 to 16
Graphical applications, transportation problem      121
Graphical solutions for non-linear problems      1016 to 1018
Greedy algorithm      815 816 835
Hardgrave and Nemhausers graphical approach      839
Hessian matrix      91 93 97 99 938 940 1017 1018 1047
Hessian matrix, bordered      1019
Heuristic assembly line balancing      840
Hildreths algorithm      118
Hooke Jeeves direct search      926 927
Ignall and Schrages algorithm      838
Incremental discount schedule      1220
Industrial application      231
Infeasible maximization problem      323 345
Infeasible minimization problem      354
Inflection point      938
Input-output analysis      215
Integer program      214 613 611
Integer solution      610
Interval of uncertainty      921 to 923
Inventory control problems      78 101 121 124 1210 1211 1213 1219
Inventory, carrying cost      123 1218 1230
Inventory, carrying cost rate      1216 1233
Inventory, cycle      127
Inventory, holding cost      1224 1227
Inverse Hessian matrix      941
Investment goal      452
Investment programs      72
Jacobian matrix      1023 1025 1043
Johnsons algorithm      836 837
Kilbridge and Wester procedure      840
Knapsack problem      638 639
Kuhn Tucker optimality condition      1032 to 1038 1042
Label, permanent      85 87 89 812 813 821 822
Label, temporary      85 89 812 813 821 822
Lagrangian, dual method      1028 to 1031 1039
Lagrangian, function      1215 1216
Lagrangian, multipliers      1014 1015 1043 1216
Largest-ratio rule      639
Latest finish      830 833
Latest occurrence time      827 828 830 831
Latest start      830 832 833
Lead times      1226 1231
Least cost method      51 to 53
Least squares, curve fitting      213
Least squares, straight line fitting      213
1 2 3
blank
blank
blank
HR
@Mail.ru
       © , 2004-2017
   | Valid HTML 4.01! | Valid CSS!