๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A note on minimum cost convex flows

โœ Scribed by D. L. Adolphson

Publisher
John Wiley and Sons
Year
1976
Tongue
English
Weight
92 KB
Volume
23
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On minimum reload cost paths, tours, and
On minimum reload cost paths, tours, and flows
โœ Edoardo Amaldi; Giulia Galbiati; Francesco Maffioli ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 267 KB
A note on meromorphic convexity
A note on meromorphic convexity
โœ Viorel Vajaitu ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 89 KB

We give examples of Stein domains D in C 2 such that C 2 \ D is either completely pluripolar or union of germs of (principal) hypersurfaces not intersecting D such that D fails to be meromorphically convex in C 2 .

A Note on Convex Approximation in Lp
A Note on Convex Approximation in Lp
โœ M. Nikoltjevahedberg; V. Operstein ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 116 KB

A convex function \(f\) given on \([-1,1]\) can be approximated in \(L_{r}, 1<p<x\). by convex polynomials \(P_{n}\) of degree at most \(n\) with the accuracy \(o\left(n^{-2 i p}\right)\). This follows from the estimate \(\left\|f-P_{n}\right\|_{p} \leqslant c \cdot n^{-2 / p} \cdot \omega_{2}^{\var

Optimal control of network flows with co
Optimal control of network flows with convex cost and state constraints
โœ A. T. Ernst; C. J. Goh ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 275 KB ๐Ÿ‘ 1 views

Consider a network in which a commodity #ows at a variable rate across the arcs in order to meet supply/demand at the nodes. The aim is to optimally control the rate of #ow such that a convex objective functional is minimized. This is an optimal control problem with a large number of states, and wit