endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

The feasible set of mathematical programs with complementar-ity constraints (MPCC) is considered. We discuss local stability of the feasible set with respect to perturbations (up to first order) of the defining functions. Here, stability refers to homeomorphy in-variance under small perturbations

of c on E form an equivalence which is contained in the type Π_i. The feasible set of H is the set of all k's for which there is a proper coloring using exactly k colors. We prove a simple sufficient and...

Abstract—In this paper, we discuss respectively the relationships between the feasible sets of the Weak product, the Cartesian product and the disjunctive product of uniform bi-hypergraphs and the feasible sets of the factors. Keywords- hypergraph coloring; mixed hypergraph; feasible set; one

A mixed hypergraph H is a triple (V,C, D)whereV is the vertex set and are families of subsets of V , called D-edges.

In this paper we consider a model of group formation where group of individuals may have different feasible sets. We focus on two polar cases, increasing returns, when the set of feasible alternatives increases if a new member joins the group, and decreasing returns, when a new member has

We consider the convex optimization problem minx{f(x) : gj(x) ≤ 0, j = 1,..., m} where f is convex, the feasible set K is convex and Slater’s condition holds, but the functions gj’s are not necessarily convex. We show that for any representation of K that satisfies a mild nondegeneracy assumption

Abstract—We develop a new approach for construction of convex analytically simple regions where the AC power flow equa-tions are guaranteed to have a feasible solutions. Construction of these regions is based on efficient semidefinite programming techniques accelerated via sparsity exploiting

. In this paper, we present a new robust and computationally efficient 2D mesh relaxation method. This feasible set method is a geometric method for finding the convex polygon that represents the region of coordinates that a vertex in a mesh can occupy while the mesh around it remains valid. After the feasible

We are given a large database of customer transactions. Each transaction consists of items purchased by a customer in a visit. We present an efficient algorithm that generates all significant association rules between items in the database. The algorithm incorporates buffer management and novel estimation and pruning techniques. We also present results of applying this algorithm to sales data obtained from a large retailing company, which shows the effectiveness of the algorithm.