Scholion.ai

Technical Note—A Vertex Ranking Procedure for Solving the Linear Fixed-Charge Problem

Patrick McKeown

Operations Research · 1975 · Volume 23 · Issue 6

DOI: 10.1287/opre.23.6.1183

Abstract

Murty has suggested that the linear fixed-charge problem can be solved by ranking the vertices of the polyhedral constraint set according to their continuous objective values and then adding the fixed charges to determine an optimal solution. Several problems involving degeneracy and inequality constraints arise when one attempts to implement Murty's method directly. This note describes a method that uses the vertex ranking approach in conjunction with procedures that resolve these difficulties. We also give computational results.

Enable JavaScript for citation tools and additional paper interactions.