Optimal Grain Mixing is NP-Complete
Abstract
Protein content in wheat plays a significant role when determining the price of wheat production. The Grain mixing problem aims to find the optimal bin pair combination with an appropriate mixing ratio to load each truck that will yield a maximum profit when sold to a set of local grain elevators. In this paper, we presented two complexity proofs for the grain mixing problem and showed that finding the optimal solutions for the grain mixing problem remains hard. These proofs follow a reduction from the -dimensional matching (-DM) problem and a more restricted version of the -DM known as planar -DM problem respectively. The complexity proofs do suggest that the exact algorithm to find the optimal solution for the grain mixing problem may be infeasible.
Cite
@article{arxiv.2112.08501,
title = {Optimal Grain Mixing is NP-Complete},
author = {Md Asaduzzaman Noor and Sean Yaw and Binhai Zhu and John W. Sheppard},
journal= {arXiv preprint arXiv:2112.08501},
year = {2021}
}