need your assistance with decision analysis spreadsheet. ii have attached the question, and spreadsheet that is needed to be used. thank you

Problem 6-30 (Rank 1 Goals Only) Edge File Works CO. place "1" in correct field as given in objective there are two "1" to be placed. The number is the coefficient of d1(-), for example Solution value Obj Coefficient Constraints: Profit Production limit 2-drawer sales 3-drawer sales 2-draw 3-draw d1 650.00 300.00 0.00 12 1.5 1 14 2 1 d1+ d2- d3- d4- 0.00 25.00 0.00 100.00 ct field as given in constraint equestion, Rank to be placed -1 1 1 1 1 LHS = 12000 = 1600 = 650 = 400 Sign RHS Given: demand for 2-file drawer model = 650 cabinets per Week demand for 3-file drawer model = 400 cabinets per Week company (Edge) has Weekly operating capacity = 1,600 hours 2-drawer cabinet takes = 1.5 hours 3-drawer cabinet takes = 2.0 hours 2-drawer cabinet sold yield = $12 profit 3-drawer cabinet sold yield = $14 profit Goal Rank Order: Rank 1: Rank 2: Rank 3: Attain a profit as close to $12,000 as possible each week Avoid underutilization of the firm's production capacity. Sell as many 2 and 3 drawer cabinets as demand indicates Rank1: Rank2: Rank3 ct field as given in objective equestion, Rank1. HINT: to be placed. The number 1 is placed there since this of d1(-), for example constraint equestion, Rank1. HINT: there are two "1" Developed Equations: Let: Rank1 = number of 2-drawer cabinets per week Rank2 = number of 3-drawer cabinets per week d1(-) = underachievement of profit goal d1(+) = overachievement of profit goal d2(-) = idle time in production capacity d3(-) = underachievement of sales goal of 2-drawer cabinets d4(-) = underachievement of sales goal for 3-drawer cabinets Objective: Min ranked deviations = Rank1[d1(-) + d1(+)] + Rank2[d2(-)] + Rank3[d3(-) + d4(-)] Subject to (Constraints, per week): 12Rank1 + 14Rank2 + d1(-) - d1(+) 1.5Rank1 + 2Rank2 + d2(-) Rank1 + d3(-) Rank2 + d4(-) All vars = = = = >= $12, 000 (Profit Target) 1,600 (Operating capacity Limit) 650 (2-drawer sales limit) 400 (3-drawer sales limit) non-negativity Problem 6-30 (Rank 2 Goals Only) Edge File Works CO. Same as help comment from Rank1. place objective equestion. HINT: there is one "1 2-draw 3-draw d1- d1+ d2- d3- d4- Solution value Obj Coefficient Constraints: Profit Production limit 2-drawer sales 3-drawer sales LHS Given: demand for 2-file drawer model = 650 cabinets per Week demand for 3-file drawer model = 400 cabinets per Week company (Edge) has Weekly operating capacity = 1,600 hours 2-drawer cabinet takes = 1.5 hours 3-drawer cabinet takes = 2.0 hours 2-drawer cabinet sold yield = $12 profit 3-drawer cabinet sold yield = $14 profit Goal Rank Order: Rank 1: Rank 2: Rank 3: Attain a profit as close to $12,000 as possible each week Avoid underutilization of the firm's production capacity. Sell as many 2 and 3 drawer cabinets as demand indicates = = = = Sign RHS as help comment from Rank1. place "1" in correct field as given in tive equestion. HINT: there is one "1" to be placed Additional Help for filling in Solver: See page 239, screenshot 6-7B. Notice the blue bubble note at bottom. it shows what is required to add to solver constraint from Rank1. In other words, solver is same for Rank2, but you add the additional constraint as explained in the scrrenshot. Developed Equations: Let: Rank1 = number of 2-drawer cabinets per week Rank2 = number of 3-drawer cabinets per week d1(-) = underachievement of profit goal d1(+) = overachievement of profit goal d2(-) = idle time in production capacity d3(-) = underachievement of sales goal of 2-drawer cabinets d4(-) = underachievement of sales goal for 3-drawer cabinets Objective: Min ranked deviations = Rank1[d1(-) + d1(+)] + Rank2[d2(-)] + Rank3[d3(-) + d4(-)] Rank1: Rank2: Rank3 Subject to (Constraints, per week): 12Rank1 + 14Rank2 + d1(-) - d1(+) 1.5Rank1 + 2Rank2 + d2(-) Rank1 + d3(-) Rank2 + d4(-) All vars = = = = >= $12, 000 (Profit Target) 1,600 (Operating capacity Limit) 650 (2-drawer sales limit) 400 (3-drawer sales limit) non-negativity Problem 6-30 (Rank 3 Goals Only) Same as help comment from Rank1. objective equestion. HINT: there are Edge File Works CO. Solution value Obj Coefficient Constraints: Profit Production limit 2-drawer sales 3-drawer sales 2-drawer 3-drawer d1- d1+ 12 1.5 1 14 2 1 -1 d2- d3- d4- 1 1 1 1 LHS Given: demand for 2-file drawer model = 650 cabinets per Week demand for 3-file drawer model = 400 cabinets per Week company (Edge) has Weekly operating capacity = 1,600 hours 2-drawer cabinet takes = 1.5 hours 3-drawer cabinet takes = 2.0 hours 2-drawer cabinet sold yield = $12 profit 3-drawer cabinet sold yield = $14 profit Goal Rank Order: Rank 1: Rank 2: Rank 3: Attain a profit as close to $12,000 as possible each week Avoid underutilization of the firm's production capacity. Sell as many 2 and 3 drawer cabinets as demand indicates = = = = Sign RHS help comment from Rank1. place "1" in correct field as given in e equestion. HINT: there are two "1" to be placed Additional Help for filling in Solver: See page 240, screenshot 6-7C. Notice the blue bubble note at bottom. it shows what is required to add to solver constraint from Rank1. In other words, solver is same for Rank1, but you add the additional constraint as explained in the scrrenshot. Developed Equations: Let: Rank1 = number of 2-drawer cabinets per week Rank2 = number of 3-drawer cabinets per week d1(-) = underachievement of profit goal d1(+) = overachievement of profit goal d2(-) = idle time in production capacity d3(-) = underachievement of sales goal of 2-drawer cabinets d4(-) = underachievement of sales goal for 3-drawer cabinets Objective: Min ranked deviations = Rank1[d1(-) + d1(+)] + Rank2[d2(-)] + Rank3[d3(-) + d4(-)] Rank1: Rank2: Rank3 Subject to (Constraints, per week): 12Rank1 + 14Rank2 + d1(-) - d1(+) 1.5Rank1 + 2Rank2 + d2(-) Rank1 + d3(-) Rank2 + d4(-) All vars = = = = >= $12, 000 (Profit Target) 1,600 (Operating capacity Limit) 650 (2-drawer sales limit) 400 (3-drawer sales limit) non-negativity Number of units Profit ($'000) Constraints: $ available (millions) Space (Sq. Ft.) Max Double Max ICU Max CCU Min Single Min ICU Min CCU max profit Single 45 $21 Double 54 $28 ICU 110 $48 CCU 104 $41 300 360 50 320 340 20 20 35 10 10 3,669,000 $48.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 LHS = >= >= Sign 8000.0 40000.0 50.0 20.0 20.0 35.0 10.0 10.0 RHS Problem 7-18, you can use any drawing tool to past network diagram here..see pg 279 for examp here..see pg 279 for example Problem 7-18 "LFT" -- this requires cell equation paranthesis and choose the smalle does the same except now display Activity Pred Optim time (a) Most likely time (m) Pessim time (b) Activity time Variance Standard deviation EST 0.00 0.00 0.00 See pg. 309 (from assigned problem) See pg. 284 for how to use equations Critical path = Project length = Project variance = Project std deviation = P(Finish = 29 days) = 0.00 0.00 0.00 Err:502 Err:502 days days Help Hint: Do the example sta understand how to complete missing information from above table. HINT1: C EFT value nothing to do here. equations already in place. see section 7.4 for explanation of equetions "LFT" -- this requires cell equation using the MIN function. The MIN function will look at the list in aranthesis and choose the smallest value to display. NOTE: there is also a MAX function which oes the same except now displays the largest value from list in paranthesis. EFT 0.00 0.00 LST 0.00 0.00 LFT 0.00 0.00 0.00 Slack 0.00 0.00 Critical? Y Y Y Y Y Y Y Y Y See pg. 279, Table 7-3. Help Hint: Do the example starting pg. 275, section 7.3 to help understand how to complete this table. "Critical?" -- this already done. notice how equation is in cell N8, the equation says: if M8 = 0, then display Y. otherwise, display N Notice 1st two rolws are already completed for you MAX function example: "EST" -- this cell requires equa MAX function. The MAX function will look at the list in choose the largest value to display. EXMPLE: =MAX(J13 Start Here. Since this is last activity we begin by placin equation pointing to it's EFT or MIN(J16). we use MIN t apply the equation for LFT to find min of all immediate following activities. mation from above table. HINT1: Critical path is sequence with "Y" from 'Critical?' column. HINT2: project length is the last activity node quations already in place. planation of equetions dy done. notice how equation is used n says: if M8 = 0, then display Y. re already completed for you e: "EST" -- this cell requires equation is using the AX function will look at the list in paranthesis and ue to display. EXMPLE: =MAX(J13,J14) is last activity we begin by placing t's EFT or MIN(J16). we use MIN to r LFT to find min of all immediate ect length is the last activity node, 6-30 Sandy Edge is president of Edge File Works, a firm that manufactures two types of metal file cabinets. The demand for the two-drawer model is 650 cabinets per week; demand for the three- drawer cabinet is 400 per week. Edge has a weekly operating capacity of 1,600 hours, with the two- drawer cabinet taking 1.5 hours to produce and the three-drawer cabinet requiring 2 hours. Each two-drawer model sold yields a $12 profit, and the profit for the three-drawer model is $14. Edge has listed the following goals, in rank order: Rank 1: Attain a profit as close to $12,000 as possible each week. Rank 2: Avoid underutilization of the firm's production capacity. Rank 3: Sell as many two- and three-drawer cabinets as the demand indicates. Set up and solve this problem as a goal programming model. 7-18 A plant engineering group needs to set up an assembly line to produce a new product. The table in the next column describes the relationships between the activities that need to be completed for this product to be manufactured. (a) Develop a project network for this problem. (b) Determine the expected duration and variance for each activity.(c) Determine the EST, EFT, LST, LFT, and slack for each activity. Also determine the total project completion time and the critical path(s). (d) Determine the probability that the project will be completed in less than 34 days. (e) Determine the probability that the project will take more than 29 days