Displaying 1761 – 1780 of 2522

Showing per page

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...

Self-Assembly of Icosahedral Viral Capsids: the Combinatorial Analysis Approach

R. Kerner (2011)

Mathematical Modelling of Natural Phenomena

An analysis of all possible icosahedral viral capsids is proposed. It takes into account the diversity of coat proteins and their positioning in elementary pentagonal and hexagonal configurations, leading to definite capsid size. We show that the self-organization of observed capsids during their production implies a definite composition and configuration of elementary building blocks. The exact number of different protein dimers is related to the...

Semiconvex compacta

Oleh R. Nykyforchyn (1997)

Commentationes Mathematicae Universitatis Carolinae

We define and investigate a generalization of the notion of convex compacta. Namely, for semiconvex combination in a semiconvex compactum we allow the existence of non-trivial loops connecting a point with itself. It is proved that any semiconvex compactum contains two non-empty convex compacta, the center and the weak center. The center is the largest compactum such that semiconvex combination induces a convex structure on it. The convex structure on the weak center does not necessarily coincide...

Semi-monotone sets

Saugata Basu, Andrei Gabrielov, Nicolai Vorobjov (2013)

Journal of the European Mathematical Society

A coordinate cone in n is an intersection of some coordinate hyperplanes and open coordinate half-spaces. A semi-monotone set is an open bounded subset of n , definable in an o-minimal structure over the reals, such that its intersection with any translation of any coordinate cone is connected. This notion can be viewed as a generalization of convexity. Semi-monotone sets have a number of interesting geometric and combinatorial properties. The main result of the paper is that every semi-monotone...

Currently displaying 1761 – 1780 of 2522