What people are saying - Write a review
We haven't found any reviews in the usual places.
J E Mulligan 1965
Part Two Applications of Linear Programming
E P De Garmo 1966
15 other sections not shown
acres application approach approximation assumed basic bound algorithm branch and bound cent 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 given gradient method gt(x hardwood heuristic input integer linear programming integer programming intermediate node lignite linear programming problem lower bound machine Management Science mathematical programming maximizing maximum menu item menu planning minimize minimum mixed non-linear non-negative objective function obtained Operations Research optimal solution optimum period possible priority procedure production plan profit quadratic quantity region restrictions returns scheduling problem sequencing simplex method sinter solving soybeans station stochastic subassemblies Table techniques tion transistor travelling salesman problem units values variables vector warehouse warehousing cost waste material wheat