Problem # 1_Integer Problem

The Kelowna Premium Winery produces three kinds of table wine  - a blush,  a white and a red, all made from grapes.  The winery has 30,000 pounds of grapes available to produce wine for this year 2020.  A cask of blush requires 360 pounds of grapes, a cask of white requires 375 pounds and a cask of red requires 410 pounds. The winery has enough storage space for 100 casks of wine.  The winery has 1500 hours of production capacity, and it requires 14 hours to produce a cask of blush, 10 hours to produce a cask of white and 18 hours to produce  a cask of red. 

The profit for a cask of blush is $12,400, the profit for a cask of white is $9,300, and the profit for a cask of red $ 11,000. The GM of the  winery wants to find out the optimum number of each table wine to produce.  

A. Formulate and solve an integer programming model for  this problem. Named the sheet as #1A.

B. Copy Sheet 1A and add the constraint below to your solver. Named the sheet as #1B.

For profit purposes and from historical records, the winery target that the sales of Red will be at least 30% of the total sales, blush will be at least 50% and white will be 20%. Named the sheet as #1B.

C. Copy Sheet 1B and add the constraint below to your solver. Named the sheet as #1C.

The winery has a contract that guarantees its buyers 32 cask of blush, 12 cask of white and 18 cask of red.