The One-Terminal TELPAK Problem

B. Rothfarb and M. Goldstein
Additional contact information
B. Rothfarb: Network Analysis Corporation, Glen Cove, New York
M. Goldstein: Office of Emergency Preparedness, Washington, D.C.

Operations Research, 1971, vol. 19, issue 1, 156-169

Abstract: To lease long-distance telecommunications facilities, the lessee submits, for billing purposes, a configuration of individual channels and bulk units of channels, called TELPAKS, that implements his requirements. The bulk rate charged for a TELPAK results in the cost being a piecewise linear function of the number of channels. This leads to a network-synthesis problem with a nonlinear cost function that is neither concave nor convex. We give a characterization of an optimal solution and present a method for obtaining a low-cost configuration when all requirements are to a single point.

Date: 1971
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.1.156 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:19:y:1971:i:1:p:156-169

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().