Solve for the following Linear Programming problems . ( USING SIMPLEX METHOD) Your solutions should include : 1. Objective Function 2. Constraints 3. Graph complete with labels of points and lines , and shaded feasible region 4. Corner point approach 5. Optimal solution 6. MINIMUM COST The Cereal Killer Company makes a cereal from several ingredients. Two of the ingredients, oats and provide vitamins A and B. The company wants to know how many ounces of and rice it should include in each box of cereal to meet the minimum requirements of 48 milligrams of vitamin A and 12 milligrams of vitamin B while minimizing cost. An ounce of oats contributes 8 milligrams of vitamin A and 1 milligram of vitamin Bwhereas an ounce of rice contributes 6 milligrams of A and 2 milligrams of B. An ounce of oats costs Php 5.00 , and an ounce of rice costs Php 3.00

1. A specific assignment of values to decision variables is called what? a. Constraint           b. Feasible           c. Solution           d. None of the above           2. Which of the following must be true of a feasible solution   a. All of what Solver calls changing variables must be greater than 0 b. It is optimal           c. It violates no constraints         d. None of the above

Use simplex method for linear programming. Show solution for each iteration table. Problem: A small firm that assembles computers is about to start production of two new types of personal computers. Each type will require assembly time, inspection time, and storage space. The amount of each of these resources that can be devoted to the production of the computers is limited. The manager of the firm would like to determine the quantity of each computer to produce in order to maximize the profit generated by sales of these computers. In order to develop a suitable model of the problem, the manager has met with design and manufacturing personnel. As a result of those meetings, the manager has obtained the following information:                                                            Type 1               Type 2 Profit per unit                                      $60                     $50 Assembly time per unit                      4 hours              10 hours  Inspection time per…

9.  Which of the following is NOT a requirement of a linear programming problem?   Select one: a. constraints, expressed as linear equations or inequalities b. an objective function to be maximized or minimized c. an objective function, expressed in linear terms d. alternative courses of action e. one constraint for each decision variable

Innis Investments manages funds for a number of companies and wealthy clients. The investment strategy is tailored to each client's needs. For a new client, Innis has been authorized to invest up to $1.2 million in two investment funds: a stock fund and a money market fund. Each unit of the stock fund costs $50 and provides an annual rate of return of 10%; each unit of the money market fund costs $100 and provides an annual rate of return of 4%. The client wants to minimize risk subject to the requirement that the annual income from the investment be at least $60,000. According to Innis' risk measurement system, each unit invested in the stock fund has a risk index of 8, and each unit invested in the money market fund has a risk index of 3. The higher risk index associated with the stock fund simply indicates that it is the riskier investment. Innis's client also specified that at least $300,000 be invested in the money market fund. Refer to the computer solution shown below. Optimal…

Next question Use the simplex method to solve the linear programming prob z= 8x1 - 7x2 + 4x3 2x1 Maximize X2 + 8x3 s 40 4x1 - 5x2 + 6x3576 2x1 - 2x2 + 6x3< 32 X120, X2 20, хз 20. subject to Select the correct choice below and, if necessary, fill in the answer boxes to complete your choice. A. The maximum is , X2 =, X3 = S2 = and s3 when X1 S1 = B. There is no maximum.

Solve the following Linear Programming model using the graphical method (USING EXCEL){Write the steps of construction} Q1)MaximizeH = x + 3y   Objective    functionsubject tox + y ≤ 502x + y ≤ 60 x ≥ 0, y ≥ 0

b) The Scott Tractor Company ships tractor parts from Omaha to St. Louis by railroad. However, a contract limits the number of railroad cars the company can secure on each branch/arc during a week. Given these limiting conditions, the company wants to know the maximum number of railroad cars containing tractor parts that can be shipped from Omaha to St. Louis during a week. Phoenix Des Moines 3 5 6. 6. 1. Dallas 2 Omaha St. Louis 7. 3 Denver 6. ActivateW O 31°C

Assuming that the company is interested in maximizing the total profit contribution, answer the following:   A, What is the linear programming model for this problem? Decision Variables: LP Model:   B.Find the optimal solution using the graphical solution procedure. 1.Feasible Region:2. Identify the binding constraint/s:3. Identify the rebundant constraint/s:4.How many gloves of each model should Kelson manufacture?5.What is the total profit contribution Kelson can earn with the given production quantities? C.How many hours of production time will be scheduled in each department? D.What is the slack time in each department? E.Compute the range of optimality for the objective function coefficients

Please answer it immediately sir Linear Programming The Booboo sawmill in Batangas produces pine and oak boards for manufacturing firms. Each month the sawmill must deliver atleast 5 tons of wood to the manufacturer . It takes the sawmill 3 days to produce a ton of pine and a 2 days to produce a ton of oak and the sawmill can allocate 18 days out of a month for this contract. The sawmill can get enough pine to make atleast 4 tons of wood and enough oak to make atmost 7 tons of wood. Determine the number of tons of pine and oak in order to minimize cost, given that pine has a cost of $3 and oak $6 to produce