Patent Medicine Bottle

Simple linear programming question?

A manufacturer of a range of patented drugs is to prepare a plan for the production of drugs A and B, are sufficient ingredients to make 20,000 bottles A and B of 40,000 bottles, but there are only 45 000 bottles in which a drugs can be made. More and more, takes three hours to prepare enough material to fill bottles of 1000 A. It takes an hour to prepare material enough to fill 1,000 bottles B and there are 66 hours available for this operation. The number of restrictions on the manufacturer's instructions

Let X and Y the number of bottles A and B to be produced, respectively. The problem here is that there is not enough information given above to form the objective function for this question. Since 1000 bottles of a hard three hours to traverse, and a bottle = (3 / 1000) = 0003 hours 1000 hours Given bottles B is one hour to complete, then a bottle = (1 / 1000) = 0001 hours Check constriants the objective function subject to the following: a full bottle, the ingredients are available for up to 20 000 bottles of A, then we constriant x <= 20,000 bottles in total B, ingredients available for a maximum of 40 000 bottles B, then we constriant and <= 40000 There are only 45 000 bottles in which one of the medications that can be, so we constriant x + and <= 45,000 hours total to prepare enough material, the maximum time of 66 hours are available for operation to prepare enough material for two bottles A and B, and finally we constriant 0.003x 0001 and <= 66 Hope this helps.