Final answer:
The optimization problem for Genko requires maximizing the objective function P = 2x + 1.8y, representing daily profit, subject to production and proportionality constraints. Here, x and y are the quantities of bread flour and self-raising flour produced, respectively.
Step-by-step explanation:
The optimization problem for Genko Olive Oil Company involves determining the optimal daily production quantities of bread flour and self-raising flour to maximize profits, given certain constraints. The profit from bread flour is $2 per kg, while self-raising flour yields $1.80 per kg.
The company can produce a total of up to 200 kg of flour per day but is limited to 150 kg per day for self-raising flour due to a baking powder shortage. Furthermore, there's a requirement that at least twice as much self-raising flour is produced compared to bread flour.
To formulate this as a linear programming problem, we let x represent the quantity of bread flour and y represent the quantity of self-raising flour produced per day. The objective function to be maximized is the daily profit, P = 2x + 1.8y. The constraints are x + y ≤ 200 (total production limit), y ≤ 150 (self-raising flour limit), and y ≥ 2x (at least twice as much self-rising flour as bread flour).