近乎最优的线性规划解:一些概念问题与农场管理应用

Nearly Optimal Linear Programming Solutions: Some Conceptual Issues and a Farm Management Application

American Journal of Agricultural Economics · 1987
被引 17
人大 AABS 3

中文导读

讨论线性规划中近乎最优解的概念,通过顶点枚举法生成一组备选方案,帮助决策者考虑模型未量化的标准,并以肉牛营销策略选择为例展示应用。

Abstract

Nearly optimal solutions in linear programming provide useful information to decision makers. Modeling to generate alternatives may be used to generate a set of nearly optimal solutions from which a decision maker may select the desired solution by considering criteria not quantified in the model. The mathematical problem is to find vertices of a convex polytope. A pivoting method of vertex enumeration is used to generate all extreme‐point nearly optimal solutions of an example problem involving selection of a marketing strategy for beef calves. Compared to the optimal solution, nearly optimal solutions have more diversity or use less cash or hired labor.

线性规划近优解顶点枚举农场管理