Neighborhood Systems for Production Sets with Indivisibilities
研究生产集存在不可分性时，如何通过活动分析矩阵和整数活动水平定义邻域系统，并证明每个技术矩阵存在唯一的最小邻域系统使局部最优成为全局最优，适合对生产理论或整数规划感兴趣的学者。
A production set with indivisibilities is described by an activity analysis matrix with activity levels which can assume arbitrary integral values. A neighborhood system is an association with each integral vector of activity levels of a finite set of neighboring vectors. The neighborhood relation is assumed to be symmetric and translation invariant. Each such neighborhood system can be used to define a local maximum for the associated integer programs obtained by selecting a single commodity whose level is to be maximized subject to specified factor endowments of the remaining commodities. It is shown that each technology matrix (subject to mild regularity assumptions) has a unique, minimal neighborhood system for which a local maximum is global. The complexity of such minimal neighborhood systems is examined for several examples.