Linear Programming: A company manufactures two products and each of these products must be processed on two different machines. Product A requires 1 minute of work time per unit on machine 1 and 2 minutes of work time on machine 2. Product B requires 3 minutes of work time per unit on machine 1 and 4 minutes of work time on machine 2. Each day, 100 minutes are available on machine 1 and 200 minutes are available on machine 2. The profit of each unit of product A is $50 and the profit of each unit of product B is $60. (Let x be the number of units of product A and y be the number of units of product B). Identify the variables: x - number of units of product A y - number of units of product B Set up the objective function: Objective function: Profit = 50x + 60y 3. Give the constraints in mathematical expression: Constraints: 1x + 3y ≤ 100 (machine 1 constraint) 2x + 4y ≤ 200 (machine 2 constraint) x ≥ 0 (non-negativity constraint for product A) y ≥ 0 (non-negativity constraint for product B) Graph the constraints and identify the solution - How many units of each product should be produced daily in order to maximize the company's profit? What is the maximum profit daily?
Added by James C.
Close
Step 1
Identify the variables: Let $x$ be the number of units of product A and $y$ be the number of units of product B. Show more…
Show all steps
Your feedback will help us improve your experience
Jason Horton and 58 other Algebra educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
A factory manufactures three products, A, B, and C. Each product requires the use of two machines, Machine I and Machine II. The total hours available, respectively, on Machine I and Machine II per month are 6,520 and 8,900. The time requirements and profit per unit for each product are listed below. | | A | B | C | | :--- | :--- | :--- | :--- | | Machine I | 6 | 8 | 10 | | Machine II | 10 | 10 | 13 | | Profit | $12 | $17 | $19 | How many units of each product should be manufactured to maximize profit, and what is the maximum profit? Start by setting up the linear programming problem, with A, B, and C representing the number of units of each product that are produced. Maximize P = subject to: ≤ 6,520 ≤ 8,900 Enter the solution below. If needed round numbers of items to 1 decimal place and profit to 2 decimal places. The maximum profit is $ when the company produces: units of product A units of product B units of product C
Carson M.
A firm manufactures two types of products A and B and sells them at a profit of Rs. 2 on type A and Rs. 3 on type B. Each product is processed on two machines G and H: Type A requires 1 minute of processing time on G and 2 minutes on H; type B requires 1 minute on G and 1 minute on H. The machine G is available for not more than 6 hours 40 minutes while machine H is available for 10 hours during any working day. Formulate the problem as a linear programming problem. Note: Assume X (No of product A) and Y (No of Product B) Find the Constraints:
Adi S.
Q1 (a) Four products are processed successively on two machines. The manufacturing times in hours per unit of each product are tabulated below for the two machines. The total cost of producing 1 unit of each product is based directly on the machine time. Assume that the costs per hour for machines 1 and 2 are $10 and $15, respectively. The total hours budgeted for all the products on machines 1 and 2 are 500 and 380. If the sales prices per unit for products 1, 2, 3 and 4 are $65, $70, $55 and $45 respectively, formulate the problem as a linear programming model to maximize total net profit. (b) (i) Find the optimal solution for the following Linear Programming problem, using Simplex method. Maximize 2 x1 + x2 + x3 subject to x1 + 5 x2 + x3 ≤ 5 3 x1 + 2 x2 + x3 ≤ 9 5 x1 + 4 x2 + 2 x3 ≤ 10 x1, x2, x3 ≥ 0 (ii) Which of the constraints (1) - (3) are binding, and which of them are non-binding? (iii) Write down the shadow prices of constraints (1) - (3). (iv) Write down the reduced costs for x1, x2 and x3.
Sri K.
Recommended Textbooks
Elementary and Intermediate Algebra
Algebra and Trigonometry
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD