Walden University Linear Programming Question

I’m working on a mathematics multi-part question and need guidance to help me learn.

Tous les Jours Bakery operates a 5 day working week and produces two products; sourdough and bagel. Each sourdough requires 6 ounces of flour, 1 ounce of yeast, and 2 TS (tablespoons) of chia seeds. A bagel requires 3 ounces of flour, 1 ounce of yeast, and 4 TS of chia seeds. The company has 6600 ounces of flour, 1400 ounces of yeast, and 4800 TS of chia seeds available for daily production runs. Sourdough profits are 20 cents each, and bagel profits are 30 cents each. The formulation of this problem should satisfy four requirements for standard Linear Programming 1. There are limited resources and there is an explicit objective function 2. The equations are linear 3. The resources are homogenous (everything is in one unit of measure) 4. The decision variables are divisible and nonnegative (we can make a fractional part of each case)

(i) Formulate the problem as a Linear Programming problem to maximise the total profit for Tous les Jours.

(ii) Represent the problem in graphical format and highlight the feasible region.

(iii) Use Simplex Method to determine the optimal number of each product that Tous les Jours Bakery can produce per week and also the total profit resulting, assuming it can sell all products. Note any slack time remaining. Comment on further issues to be considered.