Results 221 to 230 of about 582,200 (259)
Some of the next articles are maybe not open access.
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
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.
openaire +2 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.
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
Extremal dispositions of points on the sphere
Analysis Mathematica, 1997In this paper the following problem is investigated: Dispose \(N\) points on the unit sphere \(S^{n-1}\) (in \(\mathbb R^n\)) in such a way that the sum of the distances between all pairs of points attain its maximum. Some questions are solved with properties of interpolation polynomials.
Kolushov, A. V., Yudin, V. A.
openaire +1 more source
Generalized Curves and Extremal Points
SIAM Journal on Control, 1975A nonparametric variational problem is considered in the setting of the theory of generalized curves. Instead of minimizing a functional dependent on a curve joining two given points, a functional defined on a set of Radon measures is considered ; the set of measures is determined by the boundary conditions. It is shown that this functional attains its
openaire +1 more source
Extremal Points, Critical Points, and Saddle Points of Analytic Functions
The American Mathematical Monthly, 20078. M. Queff?lec, Transcendance des fractions continues de Thue-Morse, /. Number Theory 73 (1998) 201? 211. 9. -, Irrational numbers with automaton-generated continued fraction expansion, in Dynamical sys tems (Luminy-Marseille, 1998), World Scientific, River Edge, NJ, 2000, pp. 190-198. 10. W. M. Schmidt, On simultaneous approximations of two algebraic
Joseph Bak, Pisheng Ding, Donald Newman
openaire +2 more sources
On extremal points of quasiconvex functions
Mathematical Programming, 1985zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Subordination, Extreme points and support points
Complex Variables, Theory and Application: An International Journal, 1989Let s(F) denote the set of functions subordinate to a function F analytic in the open unit disk Δ. Let be the set of functions f analytic in Δ such that where ∞s(f)denotes the closed convex hull of s(f). Let denote those functions analytic in Δ such that the set of support points of s( f) is .
D. J. Hallenbeck, S. perera
openaire +1 more source