Results 221 to 230 of about 427,825 (265)
Toward transferable models for efficient spatiotemporal flood prediction across coastal-estuarine systems. [PDF]
Camb Prism Coast FuturDaramola S, Muñoz DF, Shen C.
europepmc +1 more source
Enhanced active learning Gaussian process metamodel for estimating the one-sided tail probability of nonlinear structural response. [PDF]
Sci RepWang Y, Huang Y, Huang Y, Yin W.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Extreme Points and Strongly Extreme Points of Musielak–Orlicz Sequences Spaces
Acta Mathematica Sinica, English Series, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liu, Xinbo, Wang, Tingfu, Yu, Feifei
exaly +2 more sources
Mathematics of Operations Research, 1988
The extreme points of sets of probability measures—determined by a finite number of generalized moment conditions—are characterized. Together with an integral representation theorem the characterization is used to optimize affine functionals.
exaly +3 more sources
The extreme points of sets of probability measures—determined by a finite number of generalized moment conditions—are characterized. Together with an integral representation theorem the characterization is used to optimize affine functionals.
exaly +3 more sources
Topology and its Applications, 2019
Compacta in this paper are compact Hausdorff spaces; continua are connected compacta. If $X$ is a space and $\{a,b\}\subset X$, then $[a,b]_X$ equals the intersection of the subcontinua of $X$ that contain the set $\{a,b\}$. One may think of $[a,b]_X$ as the ``subcontinuum interval'', or just the ``interval'', determined by $a$ and $b$.
Anderson, Daron, Bankston, Paul
openaire +1 more source
Compacta in this paper are compact Hausdorff spaces; continua are connected compacta. If $X$ is a space and $\{a,b\}\subset X$, then $[a,b]_X$ equals the intersection of the subcontinua of $X$ that contain the set $\{a,b\}$. One may think of $[a,b]_X$ as the ``subcontinuum interval'', or just the ``interval'', determined by $a$ and $b$.
Anderson, Daron, Bankston, Paul
openaire +1 more source
SIAM Review, 1968
Abstract : It is shown that if A is an integral matrix having linearly independent rows, then the extreme points of the set of nonnegative solutions to Ax = b are integral for all integral b if and only if the determinant of every basis matrix is plus or minus 1.
Veinott, Arthur F. jun., Dantzig, G. B.
openaire +1 more source
Abstract : It is shown that if A is an integral matrix having linearly independent rows, then the extreme points of the set of nonnegative solutions to Ax = b are integral for all integral b if and only if the determinant of every basis matrix is plus or minus 1.
Veinott, Arthur F. jun., Dantzig, G. B.
openaire +1 more source
An extreme-point-ranking algorithm for the extreme-point mathematical programming problem
Computers & Operations Research, 1986Consider the extreme-point mathematical programming problem (EPMP): maximize cx subject to \(x\in X\cap V\), where \(X=\{x\in R^ n:\) Ax\(\leq b\}\) and V is the set of vertices of the polytope \(Y=\{x\in R^ n:\) Dx\(\leq f\), \(x\geq 0\}\). The algorithms for solving EPMP are of three basic types, namely, extreme-point ranking, branch and bound and ...
Hanif D. Sherali, S. Elizabeth Dickey
openaire +2 more sources
Extremal Splittings of Point Processes
Mathematics of Operations Research, 1985The sequence with nth term defined by [(n + 1)p] − [np] is an extremal zero-one valued sequence of asymptotic mean p in the following sense (for example): if a fraction p of customers from a point process with iid interarrival times is sent to an exponential server queue according to a prespecified splitting sequence, then the long-term average queue ...
openaire +2 more sources
Israel Journal of Mathematics, 1966
It is proved that every bounded closed and convex subset ofl 1 is the closed convex hull of its extreme points.
openaire +1 more source
It is proved that every bounded closed and convex subset ofl 1 is the closed convex hull of its extreme points.
openaire +1 more source
Extreme Point Mathematical Programming
Management Science, 1972The paper considers a class of optimization problems. The problems are linear programming problems: maximize cx subject to Ax = b with the additional constraint that x must also be an extreme point of a second convex polyhedron Dx = d, x ≧ 0. A cutting-plane algorithm for solving such problems is presented. Two numerical examples are also included.
M. J. L. Kirby, H. R. Love, Kanti Swarup
openaire +1 more source