Article ID: | iaor2000191 |
Country: | United States |
Volume: | 8 |
Issue: | 2 |
Start Page Number: | 133 |
End Page Number: | 141 |
Publication Date: | Jan 1996 |
Journal: | Discovery and Innovation |
Authors: | Jolayemi J.K. |
Keywords: | programming: linear |
A new solution procedure is developed for a mathematical linear programming (LP) model that can be optimized to obtain an optimum crop combination for a mixed-cropping scheme. Instead of formulating and solving LP problems with respect to all crop sub-groups obtainable from all crops under consideration, as in the old procedure, the new procedure produces a ‘superior’ subset containing few crop sub-groups and formulates and solves the few LP problems associated with it (the superior subset). Many hypothetical crop selection problems are simulated and solved with the two procedures. The results show that the new procedure is more efficient and more cost-effective than the old procedure. The new procedure holds a lot of promise for the adoption of the model by farmers and their advisers.