Question: This is a linear programming problem. Please construct the LP problem, decision variables and constraints. Use the template shown below to answer the question. Show

This is a linear programming problem. Please construct the LP problem, decision variables and constraints.

Use the template shown below to answer the question. Show clear workings. Thanks!

This is a linear programming problem. Please construct the LP problem, decisionvariables and constraints.Use the template shown below to answer the question. Show

Question 1 SUSS Coffee Pte Lid supplies three signature coffee blends for the regional market: GoldBlend, SuperBlend and MaxBlend. The company has received a preliminary order request from a distributor in Malaysia who informed the company to prepare at least 100 kg of GoldBlend, at least 150 kg of SuperBlend and no more than 80 kg of MaxBlend. Every 1 kg of GoldBlend should contain at most 20% of cocoa and at most 30% of robusta beans by weight while every 1 kg of SuperBlend should contain at most 30% of cocoa and at most 40% of robusta beans by weight. Likewise, for the top of the line MaxBlend, every 1 kg of MaxBlend should contain at least 40% of cocoa, at most 10% of nuts and at least 50% of robusta beans by weight. The signature coffee blends are made by combining three mixtures sourced from Indonesia: Mixture Satu, Mixture Dua and Mixture Tiga. Mixture Satu, which costs $3/kg, contains 20% cocoa and 30% robusta beans. Mixture Dua, which costs $5/kg, contains 30% cocoa, 10% nuts and 40% robusta beans. Mixture Tiga, which costs $6/kg, contains 20% cocoa, 20% nuts and 50% robusta beans. SUSS Coffee CEO would like to know the most cost-effective way of combining the mixtures into their three signature coffee blends to fulfill the preliminary order request. Develop the CEO's request as a Linear Programming problem by clearly defining the variables, and stating the objective function and constraints. (25 marks)LINEAR PROGRAMMING MODEL Step 1: Define the Decision Variables Let x, = the amount invested in STK Let x, = the amount invested in BD *, and x, are the decision variables. Step 2: Define the Type of Optimisation Problem Since the annual yields of the investments were given, this is a maximisation problem in which TradeCo aims to invest in a way that will generate the highest annual yield by using the best possible combination of STK and BD investments. Step 3: Define the Objective Function As the annual yield for STK and BD is 20% and 10%, respectively, the objective function is: Highest annual yield, Max Z = 0.2x, + 0.1x2 Step 4: Determine the Constraints Constraint 1: The maximum amount TradeCo is willing to invest is $10 000. Hence, the equation is x1 + %, $ $10 000. Constraint 2: The amount invested in STK is $60% of the total investment. Hence, the equation is x]

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Mathematics Questions!