Consider the Northern Airplane Co. production scheduling problem presented in Sec. 9.1 (see Table 9.7). Formulate this problem as a general linear programming problem by letting the decision variables be xj = number of jet engines to be produced in month j (j = 1, 2, 3, 4). Construct the initial simplex tableau for this formulation, and then contrast the size (number of rows and columns) of this tableau and the corresponding tableaux used to solve the transportation problem formulation of the problem (see Table 9.9).