Convex duality and the Skorokhod problem. II (Q1963836): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s004400050270 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s004400050270 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2009349041 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S004400050270 / rank | |||
Normal rank | |||
Latest revision as of 15:49, 16 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Convex duality and the Skorokhod problem. II |
scientific article |
Statements
Convex duality and the Skorokhod problem. II (English)
0 references
13 September 2000
0 references
A number of applications is presented to show how it is working the method developed in the first part of this paper (reviewed above). The method is based on using convex duality in the case of the domain being a convex polyhedron. Among the models described there is a class of Skorokhod problems which arise from a model of processor sharing in communication networks.
0 references
Skorokhod problem
0 references
constrained deterministic and stochastic processes
0 references
convex polyhedron
0 references
convex duality
0 references
Lipschitz continuity
0 references
