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

Help with all parts please.
Which of the following is not true about linear programming? The value of the variables can be negative. The objective is either to maximize or to minimize. The relationship between variables can be expressed in equations or inequalities. The actions are constrained.
What is the fundamental concept underlying Sequential Quadratic Programming, how is it utilised, and in what context for planning with dynamics does it find its most common use, and why?
We all use linear programming whether we realize it or not. Simple calculations such as length of time to get from point A to point B when traveling at an average of x miles per hour are linear equations. provide an example with the formula and calculated answer regarding how you use linear calculations in your day-by-day activities.
Does the average person really need to deal with the complexities of dynamic programming?
Please use R-programming. Please provide the source code that makes the program run, and then screenshot the output. Question: Suppose a parallel reliability system consists of cables of wires holding a bridge andthat one of them must have at least 90 wires. If the reliability of a single wire is 0.25 what is a minimal number of wires counted from 90 (or more) should that cable have in order to maintain the reliability of the system to at least 0.95?
2x/5+5x=22/15
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
Asap plz
The function to be optimized in a linear programming application is called the __________ function.
How do I so this in steps? Thanks
Is there any "real world" implementation of dynamic programming?