As emphasized by Hausmann, Rodrik and Velasco, the policy challenge of boosting growth requires prioritization and identifying what are the most binding constraints. This paper draws on firm-level data from the World Bank Enterprise Survey, which suggests that the obstacles for the functioning of firms is related to firm size. Recognizing the potential endogeneity and simultaneity between firms...

Static symmetry breaking is a well-established technique to speed up the solving process of symmetric Constraint Satisfaction Programs (csps). Static symmetry breaking suffers from two inherent problems: symmetry breaking constraints come in great numbers and are of high arity. Here, we consider the problem of high arity. We prove that not even for binary csps can we always reduce the arity of ...

Mathematical programs with equilibrium or vanishing constraints (MPECs or MPVCs) are both known to be difficult optimization problems which typically violate all standard constraint qualifications. A number of methods try to exploit the particular structure of MPECs and MPVCs in order to overcome these difficulties. In a recent paper by Ulbrich and Veelken [37], this was done for MPECs by a loc...

We explore the idea that eye-movement strategies in reading are precisely adapted to the joint constraints of task structure, task payoff, and processing architecture. We present a model of saccadic control that separates a parametric control policy space from a parametric machine architecture, the latter based on a small set of assumptions derived from research on eye movements in reading (Eng...

A common type of symmetry is when both variables and values partition into interchangeable sets. Polynomial methods have been introduced to eliminate all symmetric solutions introduced by such interchangeability. Unfortunately, whilst eliminating all symmetric solutions is tractable in this case, pruning all symmetric values is NP-hard. We introduce a new global constraint called SIGLEX and its...

In this paper, we deal with strong stationarity conditions for mathematical programs with equilibrium constraints (MPEC). The main task in deriving these conditions consists in calculating the Fréchet normal cone to the graph of the solution mapping associated with the underlying generalized equation of the MPEC. We derive an inner approximation to this cone, which is exact under an additional ...

Single-field inflationary models predict nearly Gaussian initial conditions, and hence a detection of non-Gaussianity would be a signature of the more complex inflationary scenarios. In this paper we study the effect on the cosmic microwave background and on large-scale structure from primordial nonGaussianity in a two-field inflationary model in which both the inflaton and curvaton contribute ...

Using a standard first-order optimality condition for nonsmooth optimization problems, a general framework for a descent method is developed. This setting is applied to a class of mathematical programs with equilibrium constraints in function space from which a new algorithm is derived. Global convergence of the algorithm is demonstrated in function space and the results are then illustrated by...

This article deals with a study of the MPEC problem based on a reformulation to a DC problem (Difference of Convex functions). This reformulation is obtained by a partial penalization of the constraints. In this article we prove that a classical optimality condition for a DC program, if a constraint qualification is satisfied for MPEC, it is a necessary and sufficient condition for a feasible p...

This paper proposes the methodology to evaluate the road network anti-hazardous ability by the concept of network capacity reliability. The methodology proposed here considers the area-traffic regulation, which may be implemented when a large disaster occurs in Japan. The model to calculate entry permission rates is formulated as MPEC (Mathematical Programming with Equilibrium Constraints) in w...