12. Durian Manufacturing produces two products X and Y. Product X requires six hours of time on machine 1 and twelve hours of time on machine 2. Product Y requires 4 hours on machine 1 and no time on machine 2. Both machines are available for 24 hours. Assuming that the objective function of the total contribution margin is 2X + 1 Y, what product mix will produce the maximum profit? a.0 unit of X, 6 units of Y b. 1 unit of X, 4 units of Y c. 2 units of X, 3 units of Y d. 4 units of X, 0 unit of Y 13. Lemon Company makes products X and Y, with the following production constraints representing two machines: Machine 1: 2X+3Y18 Machine 2: 2X+Y<10 If the profit equation is Z=4x+2y, then what is the maximum possible profit? a. P18 с. Р21 d. P24 b. P20 14. The term ʻconstraints' in a linear programming model generally refers to: a. Costs b. Inefficiencies c. Scarce resources d. Dependent variables

12. Durian Manufacturing produces two products X and Y. Product X requires six hours of time on machine 1 and twelve hours of time on machine 2. Product Y requires 4 hours on machine 1 and no time on machine 2. Both machines are available for 24 hours. Assuming that the objective function of the total contribution margin is 2X + 1 Y, what product mix will produce the maximum profit? a.0 unit of X, 6 units of Y b. 1 unit of X, 4 units of Y c. 2 units of X, 3 units of Y d. 4 units of X, 0 unit of Y 13. Lemon Company makes products X and Y, with the following production constraints representing two machines: Machine 1: 2X+3Y18 Machine 2: 2X+Y<10 If the profit equation is Z=4x+2y, then what is the maximum possible profit? a. P18 с. Р21 d. P24 b. P20 14. The term ʻconstraints' in a linear programming model generally refers to: a. Costs b. Inefficiencies c. Scarce resources d. Dependent variables

Name: (The topic is linear programming) 12. Durian Manufacturing produces tw
Uploaded: 2024-03-20T07:07:26.000Z
Channel: Bartleby
Description: (The topic is linear programming) 12. Durian Manufacturing produces two products X and Y. Product X requires six hours of time on machine 1and twelve hours of time on machine 2. Product Y requires 4 hours on machine 1 and no time onmachine 2. Both ma

Advanced Engineering Mathematics

10th Edition

ISBN:9780470458365

Author:Erwin Kreyszig

Publisher:Erwin Kreyszig

Chapter2: Second-order Linear Odes

Section: Chapter Questions

Problem 1RQ

See similar textbooks

Similar questions

Hugh and his partners grow tomatoes exclusively. Although they grow many varieties, tomatoes are all that they produce for leading supermarket chains in the UK. Should they diversify into related products such as lettuce? Write a summary report, focusing on the objective function, constraints, and decision variables that are used for Linear Programming. L for box for lettuce T for box of tomato
Example 5.1 Find the dependent and independent variables of the following system 0. + 3x2 201 + 6x2 2.x3 5x3 + 2x5 2.x4 + 4x5 3x6 -1 + 15x6 8x4 + 4x5 + 18x6 5x3 + 10x4 +. 2.x1 + 6x2 9. Solution
Below is the Simplex table of a basic feasible solution (BFS) of a linear programming problem where some values are represented by letters. RHS X5 f X2 X3 X4 a 3 b 4 1 e h -5 -3 -1 -1 1 2 d 1 -4
Asap plz
Set up the linear programming problem. Do not attempt to solve it. (See Example 1.) An import company obtains a license to import up to 180 pieces of hand-carved furniture. The importer may import chests, desks, and silverware boxes. The cost, volume, and profit are the following: Silverware Box Desk Chest $250 $160 $90 $320 $300 $50 7 12 1.5 The import company may purchase up to $4000 worth of furniture, and the furniture must all fit into a 1200-cubic-foot shipping container. Find the number of each type of furniture that should be ordered so that profit is maximum. (Let x₁ represent the number of chests, x₂ the number of acres of desks, x3 the number of silverware boxes, and z the profit in dollars.) ---Select--- V|Z = cost limitation Cost Profit Volume (cubic feet) space limitation maximum number allowed subject to X₁ ≥ 0, X₂ ≥ 0, X3 ≥ 0
The function to be optimized in a linear programming application is called the __________ function.
Examples of how linear programming can help managers make better decisions Give detailed examples and numbers to back up your points.
How do I so this in steps? Thanks
Is there any "real world" implementation of dynamic programming?
Explain important characteristics of situations to which linear programming method can be successfully applied. Assume a suitable example A firm manufactures three products A, B, and Time to manufacture product A is twice that for B and thrice that for C and if the entire labour is engaged in making product A, 1,600 units of this product can be produced. These products are to be produced in the ratio 3:4:5. There is demand for at least 300, 250 and 200 units of products A, B and C and the profit earned per unit is sh. 90, sh. 40 and sh. 30 respectively. Table Raw material Requirement per unit of product (kg) Total availability (kg) A B C P 6 5 2 5,000 Q 4 7 3 6,000 Formulate the problem as a linear programming problem.