Previous Page 4

Displaying 61 – 79 of 79

Showing per page

Riemann sums over polytopes

Victor Guillemin, Shlomo Sternberg (2007)

Annales de l’institut Fourier

It is well-known that the N -th Riemann sum of a compactly supported function on the real line converges to the Riemann integral at a much faster rate than the standard O ( 1 / N ) rate of convergence if the sum is over the lattice, Z / N . In this paper we prove an n-dimensional version of this result for Riemann sums over polytopes.

Rigidity and flexibility of virtual polytopes

G. Panina (2003)

Open Mathematics

All 3-dimensional convex polytopes are known to be rigid. Still their Minkowski differences (virtual polytopes) can be flexible with any finite freedom degree. We derive some sufficient rigidity conditions for virtual polytopes and present some examples of flexible ones. For example, Bricard's first and second flexible octahedra can be supplied by the structure of a virtual polytope.

Robust optimality analysis for linear programming problems with uncertain objective function coefficients: an outer approximation approach

Zhenzhong Gao, Masahiro Inuiguchi (2023)

Kybernetika

Linear programming (LP) problems with uncertain objective function coefficients (OFCs) are treated in this paper. In such problems, the decision-maker would be interested in an optimal solution that has robustness against uncertainty. A solution optimal for all conceivable OFCs can be considered a robust optimal solution. Then we investigate an efficient method for checking whether a given non-degenerate basic feasible (NBF) solution is optimal for all OFC vectors in a specified range. When the...

Rotation indices related to Poncelet’s closure theorem

Waldemar Cieślak, Horst Martini, Witold Mozgawa (2015)

Annales UMCS, Mathematica

Let CRCr denote an annulus formed by two non-concentric circles CR, Cr in the Euclidean plane. We prove that if Poncelet’s closure theorem holds for k-gons circuminscribed to CRCr, then there exist circles inside this annulus which satisfy Poncelet’s closure theorem together with Cr, with ngons for any n > k.

Rotundity and smoothness of convex bodies in reflexive and nonreflexive spaces

Victor Klee, Libor Veselý, Clemente Zanco (1996)

Studia Mathematica

For combining two convex bodies C and D to produce a third body, two of the most important ways are the operation ∓ of forming the closure of the vector sum C+D and the operation γ̅ of forming the closure of the convex hull of C ⋃ D. When the containing normed linear space X is reflexive, it follows from weak compactness that the vector sum and the convex hull are already closed, and from this it follows that the class of all rotund bodies in X is stable with respect to the operation ∓ and the class...

Currently displaying 61 – 79 of 79

Previous Page 4