
For this linear programming problem, formulate the linear programming model. Then, find the optimal solution graphically for the LP with only 2 variables.
Max Z = 500x + 300y
Subject to:
4x + 2y <= 60 (1st constraint)
2x + 4y <= 48 (2nd constraint)
x, y >= 0 (non-negativity)
Barahan Plus Chemicals, Inc. produces two products that are sold as raw materials to companies manufacturing bath soaps and laundry detergents. Based on an analysis of current inventory levels and potential demand for the coming month, the company's management has specified that the combined production for products A and B must total at least 350 gallons. Separately, a major customer's order for 125 gallons of product A must be satisfied. Product A requires 2 hours of processing time per gallon while product B requires 1 hour of processing time per gallon, and for the coming month, 600 hours of processing time are available. Barahan Plus Chemicals' objective is to satisfy these requirements at a minimum total production cost. Production costs are ₽80 per gallon for product A and ₽120 per gallon for product B. Formulate a linear programming model that will find the minimum-cost production schedule.
*additional note: philippine peso is used as currency :)*

Trending nowThis is a popular solution!
Step by stepSolved in 3 steps with 3 images

- Solve the linear programming problem using the simplex method. Maximize 2x + 3y subject to the constraints Find the solution. x= 0.2, y = 0.05, M = 0.55 (Type integers or decimals.) 5x + y ≤ 60 3x + 2y ≤ 80. x20,y 20arrow_forwardplease helparrow_forwardUPVOTE WILL BE GIVEN. PLEASE WRITE THE COMPLETE SOLUTIONS LEGIBLY. NO LONG EXPLANATION NEEDED. BOX THE FINAL ANSWERS.arrow_forward
- Solve the linear programming problem using the simplex method. Maximize z = 2x₁ +9x2 subject to 5Xq+X, 550 9x1 + 2x2 ≤70 x1 + x2 ≤60 X1, X2 ≥0. Select the correct choice below and, if necessary, fill in the answer box to complete your choice. OA. The maximum is z = when X1 = , X₂ = S1 = , S2 = and S3= B. There is no maximum solution for this linear programming problem.arrow_forwardFind X₁ and X₂ that maximize the objective function Z = 3x₁ + 5×₂2 with the constraint function 2x, 8 3X₁ ≤ 15 6X₁ + 5X₂ > 30 = Using the simplex method.arrow_forwardNeed only a handwritten solution only (not a typed one).arrow_forward
- Algebra and Trigonometry (6th Edition)AlgebraISBN:9780134463216Author:Robert F. BlitzerPublisher:PEARSONContemporary Abstract AlgebraAlgebraISBN:9781305657960Author:Joseph GallianPublisher:Cengage LearningLinear Algebra: A Modern IntroductionAlgebraISBN:9781285463247Author:David PoolePublisher:Cengage Learning
- Algebra And Trigonometry (11th Edition)AlgebraISBN:9780135163078Author:Michael SullivanPublisher:PEARSONIntroduction to Linear Algebra, Fifth EditionAlgebraISBN:9780980232776Author:Gilbert StrangPublisher:Wellesley-Cambridge PressCollege Algebra (Collegiate Math)AlgebraISBN:9780077836344Author:Julie Miller, Donna GerkenPublisher:McGraw-Hill Education





