[1.35] Consider the following problem:Maximize 2x1+ 3x2+subject toX1< 2x24x1+ 6x2 < 9X1,x2> 0.a.Sketch the feasible region.b.Find two alternative optimal extreme (corner) points.Find an infinite class of optimal solutions.C.

Follow the procedure given below.

Answered: a. Sketch the feasible region. b. Find…

a. Sketch the feasible region. b. Find two alternative optimal extreme (corner) points. Find an infinite class of optimal solutions. C.

Algebra and Trigonometry (6th Edition)

6th Edition

ISBN:9780134463216

Author:Robert F. Blitzer

Publisher:Robert F. Blitzer

ChapterP: Prerequisites: Fundamental Concepts Of Algebra

Section: Chapter Questions

Problem 1MCCP: In Exercises 1-25, simplify the given expression or perform the indicated operation (and simplify,...

See similar textbooks

Similar questions

The table below shows the following information: Costs of shipping between warehouses and stores Supply in each warehouse Demand at each store 1) Determine the optimal solution and write out your complete answers. Write out your complete optimal solution. 2) Explain the type of transportation problem this is. 3) After solving for the optimum solution, what strategies would you recommend to the company?
!!! MULTIPLE CHOICE QUESTION g(x) = 5√x State the transformation from the parent function f(x)=√x 0000 Shift down 5 Vertical compression of Shift up 5 Vertical stretch of 5 Rewatch Submit
Graph the system of inequalities from the given problem, and list the corner points of the feasible region. Verify that the corner points of the feasible region correspond to the basic feasible solutions of the associated e-system. 3x1 + 7x2 ≤ 42 3x1 + 2x2 ≤ 27 x1, x2 ≥ 0
Find a formula for the optimal cost. Hint: consider the cases when n is even and then the cases when it is odd.
„ Show complete neat and organized solution. (define the variables, LP model, feasible region, optimal solution, final answer in statement form) Mike must work at least 18 hours a week to supplement his income while attending school. He has the opportunity to work in two retail stores. In store 1, he can work between 5 and 13 hours a week, and in store 2, he is allowed between 6 and 11 hours. Both stores pay the same hourly wage. In deciding how many hours to work in each store, Mike wants to base his decision on work stress. Based on interviews with present employees, Mike estimates that, on an ascending scale of 1 to 10, the stress factors are 8 and 6 at stores 1 and 2, respectively. Because stress mounts by the hour, he assumes that the total stress for each store at the end of the week is proportional to the number of hours he works in the store. How many hours should Mike work in each store?
i. Sketch the edges of the feasible region. (You may draw the graph manually or with the aid of technology.) ii. Shade the feasible region. iii. Sketch the objective function contour curves. (To draw a family of contour curves, assign several values to z.) iv. With the aid of the objective function curves, mark the point where the optimal solution will most likely occur.
Show complete neat and organized solution. (define the decision variables, LP model, feasible region, optimal solution, final answer in statement form) 1.) Mike must work at least 18 hours a week to supplement his income while attending school. He has the opportunity to work in two retail stores. In store 1, he can work between 5 and 13 hours a week, and in store 2, he is allowed between 6 and 11 hours. Both stores pay the same hourly wage. In deciding how many hours to work in each store, Mike wants to base his decision on work stress. Based on interviews with present employees, Mike estimates that, on an ascending scale of 1 to 10, the stress factors are 8 and 6 at stores 1 and 2, respectively. Because stress mounts by the hour, he assumes that the total stress for each store at the end of the week is proportional to the number of hours he works in the store. How many hours should Mike work in each store?
Solve the following LP model. a. Develop a spreadsheet model and find the optimal solution using Excel Solver.b. What is the optimal solution? What is the optimal objective function value? Maximize P = 2x1 + 9x2Subject to 2x1 + 3x2 <= 30 2x1 + x2 <= 16 x1 - x2 <= 0 x1 ≥ 0, x2 ≥ 0