A Multi-Commodity Concave Cost Minimization Problem for Communication Networks

Abstract

In this network synthesis problem a matrix giving flow requirements between each pair of points is specified, and the cost of flow in each arc is a concave function of the amount of flow. A flow pattern which fulfills the requirements at minimum cost is sought. The problem is formulated as a concave programming problem with linear constraints. All the practical difficulties of formulation and theoretical difficulties of identifying the globally minimal solution while avoiding locally minimal solutions are discussed.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1972
Accession Number
AD0740119

Entities

People

  • Sen Subhabrata

Organizations

  • University of California, Berkeley

Tags

Communities of Interest

  • C4I
  • Space

DTIC Thesaurus Topics

  • Algorithms
  • Communication Networks
  • Computer Programming
  • Computer Programs
  • Computers
  • Continuity
  • Convex Programming
  • Discontinuities
  • Evolutionary Algorithms
  • Flow Network
  • Heuristic Methods
  • Ions
  • Linear Programming
  • Mathematical Models
  • Operations Research
  • Optimization
  • Systems Engineering

Readers

  • Operations Research