6,706 research outputs found

    On Minimal Valid Inequalities for Mixed Integer Conic Programs

    Full text link
    We study disjunctive conic sets involving a general regular (closed, convex, full dimensional, and pointed) cone K such as the nonnegative orthant, the Lorentz cone or the positive semidefinite cone. In a unified framework, we introduce K-minimal inequalities and show that under mild assumptions, these inequalities together with the trivial cone-implied inequalities are sufficient to describe the convex hull. We study the properties of K-minimal inequalities by establishing algebraic necessary conditions for an inequality to be K-minimal. This characterization leads to a broader algebraically defined class of K- sublinear inequalities. We establish a close connection between K-sublinear inequalities and the support functions of sets with a particular structure. This connection results in practical ways of showing that a given inequality is K-sublinear and K-minimal. Our framework generalizes some of the results from the mixed integer linear case. It is well known that the minimal inequalities for mixed integer linear programs are generated by sublinear (positively homogeneous, subadditive and convex) functions that are also piecewise linear. This result is easily recovered by our analysis. Whenever possible we highlight the connections to the existing literature. However, our study unveils that such a cut generating function view treating the data associated with each individual variable independently is not possible in the case of general cones other than nonnegative orthant, even when the cone involved is the Lorentz cone

    Testable implications of general equilibrium models: an integer programming approach.

    Get PDF
    Focusing on the testable implications on the equilibrium manifold, we show that the rationalizability problem is NP-complete. Subsequently, we present an integer programming (IP) approach to characterizing general equilibrium models. This approach avoids the use of the Tarski-Seidenberg algorithm for quantifier elimination that is commonly used in the literature. The IP approach naturally applies to settings with any number of observations, which is attractive for empirical applications. In addition, it can easily be adjusted to analyze the testable implications of alternative general equilibrium models (that include, e.g., public goods, externalities and/or production). Further, we show that the IP framework can easily address recoverability questions (pertaining to the structural model that underlies the observed equilibrium behavior), and account for empirical issues when bringing the IP methodology to the data (such as goodness-of-fit and power). Finally, we show how to develop easy-to-implement heuristics that give a quick (but possibly inconclusive) answer to whether or not the data satisfy the general equilibrium models.General equilibrium; Equilibrium manifold; Exchange economies; Production economies; NP-completeness; Nonparametric restrictions; GARP; integer programming;

    Testable implications of general equilibrium models: an integer programming approach

    Get PDF
    Focusing on the testable implications on the equilibrium manifold, we show that the rationalizability problem is NP-complete. Subsequently, we present an integer programming (IP) approach to characterizing general equilibrium models. This approach avoids the use of the Tarski-Seidenberg algorithm for quantifier elimination that is commonly used in the literature. The IP approach naturally applies to settings with any number of observations, which is attractive for empirical applications. In addition, it can easily be adjusted to analyze the testable implications of alternative general equilibrium models (that include, e.g., public goods, externalities and/or production). Further, we show that the IP framework can easily address recoverability questions (pertaining to the structural model that underlies the observed equilibrium behavior), and account for empirical issues when bringing the IP methodology to the data (such as goodness-of-fit and power). Finally, we show how to develop easy-to-implement heuristics that give a quick (but possibly inconclusive) answer to whether or not the data satisfy the general equilibrium models.General equilibrium, equilibrium manifold, exchange economies, production economies, NP-completeness, nonparametric restrictions, GARP, integer programming.

    Partial Identification in Matching Models for the Marriage Market

    Full text link
    We study partial identification of the preference parameters in models of one-to-one matching with perfectly transferable utilities, without imposing parametric distributional restrictions on the unobserved heterogeneity and with data on one large market. We provide a tractable characterisation of the identified set, under various classes of nonparametric distributional assumptions on the unobserved heterogeneity. Using our methodology, we re-examine some of the relevant questions in the empirical literature on the marriage market which have been previously studied under the Multinomial Logit assumption
    corecore