In the truck-loading problem in Example 8.3, we assumed that any product could be loaded into any compartment. Suppose the following are not allowed: product 1 in compartment 2, product 2 in...

In the truck-loading problem in Example 8.3, we assumed that any product could be loaded into any compartment. Suppose the following are not allowed: product 1 in compartment 2, product 2 in compartment 1, and product 3 in compartment 4. Modify the model appropriately, and then use Evolutionary Solver to find the new optimal solution. (Hint: Add a penalty to the objective for violating these new constraints.)

Example 8.3