Column aggregation of 0/1 programming problems is considered. By relaxing the integer requirements in the aggregated problem, an easy problem results, the solution of which can be used to compute bounds on the loss of accuracy in the objective function value. It is shown how these bounds can be improved by identification of valid inequalities and by exploiting primal degeneracy. A small example is given to illustrate the procedure.

The Pivot and Complement heuristic is a procedure that frequently finds feasible solutions for general 0–1 integer programs. We present a refinement of the heuristic based on Tabu Search techniques. Local search strategies for the search phase, as well as the improvement phase of the heuristic are presented.

The Pivot and Complement heuristic is a procedure that frequently finds feasible solutions for general 0-1 integer programs. We present a refinement of the heuristic based on Tabu Search techniques. Local search strategies for the search phase, as well as the improvement phase of the heuristic are presented. Value 60 55 50 45 40 0 10

No abstract

Catch and processing capacity in Norwegian industrial fisheries may be extensively reduced without affecting gross revenue. A linear programming model for maximizing annual revenue in the Norwegian industrial fisheries was formulated. The main purpose of the modeling effort was to determine the minimal size of the fleet and the industry. The constraints of the model are on catch and on capacity in fishing, transporting, and processing.Key words: linear programming, capacity reduction.