Solving the Fixed Charge Problem by Ranking the Extreme Points

Abstract

An algorithm for ranking the basic feasible solutions corresponding to a linear objective function is described. An application of this algorithm for obtaining the minimal cost solution to a fixed charge problem is given. This algorithm can be applied in general to solve any fixed charge problem. However, the algorithm works efficiently when the problem is nondegenerate and the range in the values of the variable costs is large compared to the fixed charges. This algorithm can also be applied when the fixed charge part of the cost function is replaced by a concave functions.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1966
Accession Number
AD0744527

Entities

People

  • Katta G. Murty

Organizations

  • University of California, Berkeley

Tags

DTIC Thesaurus Topics

  • Algorithms
  • California
  • Classification
  • Computations
  • Computer Programming
  • Contracts
  • Equations
  • Governments
  • Linear Programming
  • Military Research
  • Operations Research
  • Security
  • Sequences
  • Simplex Method
  • Standards
  • Transportation
  • United States

Fields of Study

  • Computer science

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Battery Technology and Engineering
  • Mathematical Modeling and Probability Theory.