Fenchel duality and smoothness of solution of the optimal routing problem

DOI10.1016/0005-1098(86)90108-1zbMath0598.90037OpenAlexW2093042386MaRDI QIDQ1080359

G. I. Stassinopoulos

Publication date: 1986

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0005-1098(86)90108-1

zbMATH Keywords

dualitycommunication networksFenchel dualityoptimal routingtraffic controlon-line solution algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Convex programming (90C25) Applications of mathematical programming (90C90) Deterministic network models in operations research (90B10) Existence theories for optimal control problems involving ordinary differential equations (49J15) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Duality and stability in extremum problems involving convex functions
• Functional analysis and time optimal control
• Application of duality theory to a class of composite cost control problems
• Optimal dynamic routing in communication networks with continuous traffic
• Maximal flow through a domain
• Optimal Congestion Control in Single Destination Networks
• An optimal control approach to dynamic routing in networks
• On decentralized dynamic routing for congested traffic networks
• On Optimal Control Problems with Bounded State Variables and Control Appearing Linearly
• The Modeling of Adaptive Routing in Data-Communication Networks

This page was built for publication: Fenchel duality and smoothness of solution of the optimal routing problem