Programming for Optimal Decisions: Selected Readings in Mathematical Programming Techniques for Management ProblemsPeter Gerald Moore, Stewart Dimont Hodges |
Contents
Part One Introduction | 7 |
Part Two Applications of Linear Programming | 27 |
E P De Garmo 1966 | 44 |
Copyright | |
15 other sections not shown
Common terms and phrases
acres application approach approximation assumed basic bound algorithm branch and bound Charnes coal combinatorial problem conifer constraints convex programming Corner Portfolio crop cutting-plane method defined demand deterministic equivalent Ebbw Vale equations estimated example feasible solution feed grains Figure formulation foundry furnace gi(x given gradient method hardwood heuristic input integer linear programming integer programming intermediate node lignite linear programming problem machine Management Science mathematical programming maximizing maximum menu item menu planning minimize minimum mixed non-linear non-negative objective function obtained oilmeal Operations Research optimal solution optimum period possible priority probability procedure production plan profit quadratic quantity region restrictions scheduling problem sequencing simplex method sinter solving soybeans station stochastic subassemblies Table techniques tion transistor travelling salesman problem units values variables vector Vf(x warehouse warehousing cost waste material wheat X₁ Σ Σ