Mathematical Programming Study, Volumes 25-28North-Holland Publishing Company, 1985 - Mathematical optimization |
Contents
this volume | 1 |
19 E M L Beale and O S Brooker The use of hypothetical points in numerical | 19 |
Mathematical Programming Study | 24 |
Copyright | |
12 other sections not shown
Other editions - View all
Common terms and phrases
a₁ algorithm applied approach approximation assume B₁ Benders calculation cells column completely reducible components computational concave concave function constraints convergence convex convex function cost d₁ Dantzig decomposition deep-cut defined Dembo denote direction distribution function dual edge efficient equivalent feasible finite follows given gradient graph implementation inequality integer ISTEP iteration Lemma line search line-sum-symmetric linear complementarity problem linear programming lower bound Mathematical Programming method minimize minimum Monotone Likelihood network flow network flow problems nodes nonlinear programming nonnegative matrix objective function obtained Operations Research optimal solution P₁ parameters pivots Principle of Monotone procedure programming problems Proof quadratic programming random variables satisfies Section sequence shortest path shortest path problem simple recourse simplex solving Step stochastic programming subgradient subproblem superbasic test problems Theorem transportation problem tree upper bound variants vector vertex x₁ y₁ zero