Characterization of the containment of a polyhedral set in a closed halfspace, a key factor in generating knowledge-based support vector machine classifiers [7], is extended to the following: (i) Containment of one polyhedral set in another. (ii) Containment of a polyhedral set in a reverse-convex set defined by convex quadratic constraints. (iii) Containment of a general closed convex set, def...

A subset S of R is said to be polyhedral if it is the intersection of a finite number of closed halfspaces, i.e., if there exist J ∈ N and collections {y1, . . . , yJ} ⊂ R, {α1, . . . , αJ} ⊂ R such that S = ∩j=1{x ∈ R : y jx ≤ αj}. A function f : R → [−∞,+∞] is polyhedral if its epigraph epi f ⊂ R is a polyhedral set. Clearly, any polyhedral set is automatically convex and closed. Consequently...

a compact formulation of the set of tours neither in a graph nor its complement is presented and illustrates a general methodology proposed for constructing polyhedral models of decision problems based upon permutations, projection and lifting techniques. directed hamilton tours on n vertex graphs are interpreted as (n-1)- permutations. sets of extrema of birkhoff polyhedra are mapped to tours ...

In this paper, we discuss generating theorems of polyhedral quadrangulations closed surfaces. We prove that the set eight reductional operations {R1, …, R8} defined for is finitizable any surface F2, is, there exist finitely many minimal F2 using such R1, R7 and R8. Furthermore, show proper subset not torus.

We introduce and study a family of models for multi-expert multi-objective/criteria decision making. These models use a concept of weight robustness to generate a risk averse decision. In particular, the multi-expert multi-criteria robust weighted sum approach (McRow) introduced in this paper identifies a (robust) Pareto optimum decision that minimizes the worst case weighted sum of objectives ...

A K3-surface is a (smooth) surface which is simply connected and has trivial canonical bundle. In these notes we investigate three particular pencils of K3-surfaces with maximal Picard number. More precisely the general member in each pencil has Picard number 19 and each pencil contains four surfaces with Picard number 20. These surfaces are obtained as the minimal resolution of quotients X/G, ...