نتایج جستجو برای: polyhedral ambiguity set

تعداد نتایج: 681730  

2011
EMIL ERNST

Given x0, a point of a convex subset C of an Euclidean space, the two following statements are proven to be equivalent: (i) any convex function f : C → R is upper semi-continuous at x0, and (ii) C is polyhedral at x0. In the particular setting of closed convex mappings and Fσ domains, we prove that any closed convex function f : C → R is continuous at x0 if and only if C is polyhedral at x0. Th...

2007
Margaret M. Wiecek M. M. Wiecek

Decision making with multiple criteria requires preferences elicited from the decision maker to determine a solution set. Models of preferences, that follow upon the concept of nondominated solutions introduced by Yu (1974), are presented and compared within a unified framework of cones. Polyhedral and nonpolyhedral, convex and nonconvex, translated, and variable cones are used to model differe...

Journal: :Networks 2008
Illya V. Hicks

This paper describes certain facet classes for the planar subgraph polytope. These facets are extensions of Kuratowski facets and are of the form 2x(U)+x(E(G)\U) ≤ 2|U |+|E(G)\U | −2 where the edge set U varies and can be empty. Two of the new types of facets complete the class of extended subdivision facets, explored by Jünger and Mutzel. In addition, the other types of facets consist of a new...

2007
Peter E. Ney Stephen M. Robinson

We extend the well known large deviation upper bound for sums of independent, identically distributed random variables in IR d by weakening the requirement that the rate function have compact level sets (the classical Cram er condition). To do so we establish an apparently new theorem on approximation of closed convex sets by polytopes.

Journal: :Management Science 2012
Ayala Arad Gabrielle Gayer

I many circumstances, evaluations are based on empirical data. However, some observations may be imprecise, meaning that it is not entirely clear what occurred in them. We address the question of how beliefs are formed in these situations. The individual in our model is essentially a “frequentist.” He first makes a subjective judgment about the occurrence of the event for each imprecise observa...

2000
Davide P. Cervone Nicolaas Kuiper DAVIDE P. CERVONE François Haab

In 1960, Nicolaas Kuiper showed that every surface can be tightly immersed in three-space except for the real projective plane and the Klein bottle, for which no such immersion exists, and the real projective plane with one handle, for which he could find neither a tight example nor a proof that one does not exist. It was not until more than 30 years later, in 1992, that François Haab proved th...

2009
Dmitri Panov

In this article we introduce the notion of Polyhedral Kähler manifolds, even dimensional polyhedral manifolds with unitary holonomy. We concentrate on the 4-dimensional case, prove that such manifolds are smooth complex surfaces, and classify the singularities of the metric. The singularities form a divisor and the residues of the flat connection on the complement of the divisor give us a syste...

2002
Klaus Wich

It is shown that the set of inherent ambiguity functions for context-free languages and the set of ambiguity functions for cycle-free context-free grammars coincide. Moreover for each census function γ of an unambiguous context-free language the least monotone function larger than or equal to γ is an inherent ambiguity function. Both results are based on a more general theorem. Informally it st...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید