A Conic Algorithm for the Group Minimization Problem / Bruno Simeone.

By:

Simeone, Bruno

Contributor(s):

National Bureau of Economic Research

Material type: Text

TextSeries: Working Paper Series (National Bureau of Economic Research) ; no. w0159.Publication details: Cambridge, Mass. National Bureau of Economic Research 1976.Description: 1 online resource: illustrations (black and white)Online resources:

Available additional physical forms:

Hardcopy version available to institutional subscribers

Abstract: A new algorithm for the group minimization problem (GP) is proposed. The algorithm can be broadly described as follows. A suitable relaxation of(GP) is defined, in which any feasible point satisfies the group equation but may have negative components. The feasible points of the relaxation are then generated in order of ascending costs by a variant of a well-known algorithm of Glover, and checked for non-negativity. The first non-negative point is an optimal solution of (GP). Advantages and disadvantages of the algorithm are discussed; in particular, the implementation of the algorithm (which can be easily extended so as to solve integer linear programming problems) does not require group arithmetics.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Home library	Collection	Call number	Status	Date due	Barcode	Item holds
Working Paper	Biblioteca Digital	Colección NBER	nber w0159 (Browse shelf(Opens below))	Not For Loan

Total holds: 0

December 1976.

A new algorithm for the group minimization problem (GP) is proposed. The algorithm can be broadly described as follows. A suitable relaxation of(GP) is defined, in which any feasible point satisfies the group equation but may have negative components. The feasible points of the relaxation are then generated in order of ascending costs by a variant of a well-known algorithm of Glover, and checked for non-negativity. The first non-negative point is an optimal solution of (GP). Advantages and disadvantages of the algorithm are discussed; in particular, the implementation of the algorithm (which can be easily extended so as to solve integer linear programming problems) does not require group arithmetics.