This paper discusses heuristic “branch and bound” methods for solving mixed integer linear programming problems. The research presented on here is the follow on to that recorded in [3].After a resumé of the con...
详细信息
This paper discusses heuristic “branch and bound” methods for solving mixed integer linear programming problems. The research presented on here is the follow on to that recorded in [3].After a resumé of the concept of pseudo-costs and estimations, new heuristic rules for generating a tree which make use of pseudo-costs and estimations are presented. Experiments have shown that models having a low percentage of integer variables behave in a radically different way from models with a high percentage of integer variables. The new heuristic rules seem to apply generally to the first type of ***, other heuristic rules are presented that are used with models having a high percentage of integer variables and with models having a special structure (models including special ordered sets.)The rules introduced here have been implemented in the IBM Mathematical programming System Extended/370. They are used to solve large mixed integer linear programming *** results that permit comparisons to be made among the different rules are provided and discussed.
We analyze a mathematical programming model of a fractional flow process which consists ofn sectors and all possible time-dependent streams of flow between, into and out of the sectors. Assuming specific constraints o...
详细信息
We analyze a mathematical programming model of a fractional flow process which consists ofn sectors and all possible time-dependent streams of flow between, into and out of the sectors. Assuming specific constraints on flow, least cost policies are determined for control of the system transactions involved over a given finite time horizon and over an infinite horizon. Several applications of the model are presented and discussed.
暂无评论