Production Sets with Indivisibilities, Part II: The Case of Two Activities

DOI10.2307/1913318zbMath0458.90008OpenAlexW4239503803MaRDI QIDQ3908731

Herbert E. Scarf

Publication date: 1981

Published in: Econometrica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/1913318

zbMATH Keywords

computational complexityproduction sets with indivisibilitiestwo activitiesassociated programming problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Production theory, theory of the firm (91B38)

Related Items

The complex of maximal lattice free simplices, Test sets for integer programs, General equilibrium theory and increasing returns, Input, output and graph technical efficiency measures on non-convex FDH models with various scaling laws: An integrated approach based upon implicit enumeration algorithms, Proportionate progress: A notion of fairness in resource allocation, 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, Computing an integer point of a class of convex sets., On the exact separation of mixed integer knapsack cuts, Computing an integer point of a simplex with an arbitrary starting homotopy-like simplicial algorithm, A linear algorithm for integer programming in the plane, Integer programming with 2-variable equations and 1-variable inequalities, Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane