Production Sets with Indivisibilities, Part II: The Case of Two Activities
From MaRDI portal
Publication:3908731
DOI10.2307/1913318zbMath0458.90008MaRDI QIDQ3908731
Publication date: 1981
Published in: Econometrica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1913318
computational complexity; production sets with indivisibilities; two activities; associated programming problems
68Q25: Analysis of algorithms and problem complexity
90C10: Integer programming
91B38: Production theory, theory of the firm
Related Items
Computing an integer point of a class of convex sets., Computing an integer point of a simplex with an arbitrary starting homotopy-like simplicial algorithm, On the exact separation of mixed integer knapsack cuts, Input, output and graph technical efficiency measures on non-convex FDH models with various scaling laws: An integrated approach based upon implicit enumeration algorithms, Integer programming with 2-variable equations and 1-variable inequalities, General equilibrium theory and increasing returns, The complex of maximal lattice free simplices, Test sets for integer programs, The topological structure of maximal lattice free convex bodies: The general case, Global and local scale characteristics in convex and nonconvex nonparametric technologies: a first empirical exploration, A linear algorithm for integer programming in the plane, Proportionate progress: A notion of fairness in resource allocation, Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane
