IDEAS home Printed from https://ideas.repec.org/a/kap/netspa/v24y2024i4d10.1007_s11067-024-09654-y.html
   My bibliography  Save this article

Differential Multiplant Monopoly on a Freight Network

Author

Listed:
  • Terry L. Friesz

    (Pennsylvania State University)

Abstract

In this paper we give a mathematical statement of a differential spatial monopoly wherein transactions are facilitated by a freight transportation network that is based on an underlying graph. The monopolist has a presence at every node, and freight services are available for paths connecting stipulated origin-destination (OD) pairs. The monopolist produces a single homogeneous product that may be manufactured and inventoried, as well as sold, at every node. The dynamics take the form of ordinary differential equations that describe flow conservation. We present the necessary conditions of the monopolist’s optimal control problem and observe their interpretation is that marginal revenue equals marginal cost at each node for each instant of continuous time. Existence of an optimal solution to the monopolist’s problem is proven and a numerical example solved using two algorithms: one implemented in discrete time and the other in continuous time.

Suggested Citation

  • Terry L. Friesz, 2024. "Differential Multiplant Monopoly on a Freight Network," Networks and Spatial Economics, Springer, vol. 24(4), pages 763-788, December.
    • Handle: RePEc:kap:netspa:v:24:y:2024:i:4:d:10.1007_s11067-024-09654-y
    DOI: 10.1007/s11067-024-09654-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11067-024-09654-y
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11067-024-09654-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:kap:netspa:v:24:y:2024:i:4:d:10.1007_s11067-024-09654-y. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.