In: Advanced Math
Use the dual simplex method to solve the following linear programming problems. Clearly indicate all the steps, the entering and departing rows and columns and rows, the pivot and the row operations used. Use the simplex method to solve the following linear programming problems. Clearly indicate all the steps, the entering and departing rows and columns and rows, the pivot and the row operations used. 2.2.1 An electronics manufacturing company has three production plants, each of which produces three different models of a particular MP3 player. The daily capacities (in thousands of units) of the three plants are shown in the table. Basic model Gold model Platinum model Plant 1 8 4 8 Plant 2 6 6 3 Plant 3 12 4 8 The total demands are 300,000 units of the Basic model, 172,000 units of the Gold model, and 249,500 units of the Platinum model. The daily operating costs are $55,000 for plant 1, $60,000 for plant 2, and $60,000 for plant 3. How many days should each plant be operated in order to fill the total demand while keeping the operating cost at a minimum? What is the minimum cost? Use the method of the Dual.