A company produces and sells 4 types of products – P1, P2, P3, and P4. The table below summarizes the relevant data.
Three types of raw materials – RM1, RM2, and RM3 are required for the manufacturing process. The availability and cost per unit for each raw material are specified under the columns Available and Cost per unit, respectively.
The company is contractually obligated to produce at least a minimum quantity for each product; these are specified in the row Minimum quantity.
The selling price per unit of the products are specified in the row Selling price per unit.
The resource requirements for each product are as follows:
The fixed cost incurred to produce each unit of product are specified in the row Fixed cost/unit.
The cost of producing each unit of each product is given by the fixed cost plus the cost of the raw material used in producing that unit.
P1 |
P2 |
P3 |
P4 |
Available |
Cost per unit |
|
RM1 |
2 |
4 |
5 |
2 |
18000 |
$3 |
RM2 |
4 |
5 |
8 |
3 |
30000 |
$4 |
RM3 |
5 |
6 |
10 |
4 |
36000 |
$2 |
Minimum quantity |
1000 |
1000 |
1000 |
1000 |
||
Fixed cost/unit |
$6 |
$8 |
$10 |
$4 |
||
Selling price per unit |
$50 |
$60 |
$90 |
$40 |
Formulate this problem as a linear program and obtain the optimal solutions so as to maximize the total profits under the given constraints.
A company produces and sells 4 types of products – P1, P2, P3, and P4. The table below summarizes...
A company makes 4 products P1, P2, P3 and P4. The raw materials (A, B, C) and the labor hours needed to produce each product is given the table. Also the profit per each of these products is given. A B C Labor hours Profit per each P1 4 0 1 3 $24 P2 0 4 0 1 $28 P3 2 2 2 2 $20 P4 3 1 1 1 $25 During next week, the company has: 2800 units of...
4. The below table shows four different processors P1, P2, P3, and P4 executing the same program with clock rates and average CPls as shown below. Answer the following showing all the steps. Processor Clock rate CP 1.0 GHz 4.0 GHz 3.0 GHz 2.0 GHz P1 3.0 P2 2.0 P3 1.5 P4 2.5 a. Which processor has the best performance in terms of execution time? (8 Points) b. If the program has 5000 instructions, what is the time spent on...
TB MC Qu. 25-104 Rosie's Company has three products... Rosie's Company has three products, P1, P2, and P3. The maximum Rosie's can sell is 65,000 units of P1, 24,000 units of P2, and 12,000 units of P3. Rosie's has limited production capacity of 9,000 hours. It can produce 12 units of P1, 6 units of P2, and 3 units of P3 per hour. Contribution margin per unit is $5 for the P1, $15 for the P2, and $25 for the...
You choose a random permutation (p1, p2, p3, p4, p5, p6, p7) of 1, 2, 3, 4, 5, 6, 7, with each of the 7! permutations equally likely. What is the probability that (1 + p1)(2 + p2)(3 + p3)(4 + p4)(5 + p5)(6 + p6)(7 + p7) is even? Give an exact answer as a simplified fraction and justify your answer.
Need the process that how we get P2 P1 P4 P3 and waiting time please 1. Draw a Gantt chart below similar to the ones from lecture that illustrates the execution of the processes using the shortest-job-first CPU scheduling algorithm. Process Arrival Burst | Time Time P. 7 ms 2 ms | P2 Oms 8 ms 11 ms 5 ms P4 4 ms 9 ms P2 P2 P4 P3 oms 8 10 19 24 | Using the chart you drew,...
Let P1 = number of Product 1 to be produced P2 = number of Product 2 to be produced P3 = number of Product 3 to be produced P4 = number of Product 4 to be produced Maximize 15P1 + 20P2 + 24P3 + 15P4 Total profit Subject to 8P1 + 12P2 + 10P3 + 8P4 ≤ 3000 Material requirement constraint 4P1 + 3P2 + 2P3 + 3P4 ≤ 1000 Labor hours constraint P2 > 120 Minimum quantity needed for...
There are FIVE processesing station in a prodcution system: P1, P2, P3, P4 and P5. The times taken at each process are as follows 2 minutes, 6 minutes, 4 minutes, 8.6 and 15 minutes. Job request inflow rate is 16 per hour and jobs requests are accepted for six hours only. The systems closes after all accepted jobs have been completed, that is at the closing there are no unfinished jobs in the system. The system capacity = /hour The...
implement MLFQ using C++ please preferably linked list P1 {4,24,5,73,3,31,5,27,4,33,6,43,4,64,5,19,2} P2 {18,31,19,35,11,42,18,43,19,47,18,43,17,51,19,32,10} P3 {6,18,4,21,7,19,4,16,5,29,7,21,8,22,6,24,5} P4 {17,42,19,55,20,54,17,52,15,67,12,72,15,66,14} P5 {5,81,4,82,5,71,3,61,5,62,4,51,3,77,4,61,3,42,5} P6 {10,35,12,41,14,33,11,32,15,41,13,29,11} P7 {21,51,23,53,24,61,22,31,21,43,20} P8 {11,52,14,42,15,31,17,21,16,43,12,31,13,32,15} will compute the overall wait times, response times, and turnaround times for each process and averages for FCFS the processes follow {CPU, IO, CPU, IO, ...} output should look like this Now Running: P1 Ready Queue: Process Burst P2 18 P3 6 P4 17 P5 5 P6 10 P7 21 P8 11 Now In I/O: Process...
consider the following processes: process: p1 p2 p3 p4 p5 Arrival time: 0 1 3 4 5 CPU time: 5 4 2 3 2 draw a timing graph that shows when each process executes under SJF(shortest job first) and another graph for SRT(shortest remaining time).
Process Arrival Time CPU Burst Time P1 0 7 P2 3 8 P3 4 3 P4 6 7 For the following algorithms, calculate the average wait time and turn around time. Round-robin with quantum of one time-unit