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
active algorithm applied approach approximation assume base bound calculation called cells column completely components computational consider constraints continuous convergence convex corresponding cost defined definition demand denote derived described direction distribution dual edge efficient elements equal equivalent estimate example exists fact feasible finite fixed flow follows forest function given gives gradient graph Hence implementation implies inequality integer iteration linear programming lower matrix mean method minimize nodes nonlinear nonnegative Note objective function obtained Operations optimal optimal solution particular positive possible probability problem procedure Proof quadratic random recourse reduced Research respectively satisfies sequence shortest path side simple solution solving Step stochastic programming Suppose Table Theorem transportation tree University upper variables vector zero