Can a operation manegment expert answer on operations research quistion. if not can you please tell me what subject should I choose

I will add some examples for tow questions

Sorry wrong subject i should choose operation manegment

1)TVco produces TV picture tubes in three plants. Plant-1 can produce 50 tubes per week, Plant-2 100 tubes per week and Plant-3 70 tubes per week. The tubes are sent to three customers. The cost of transporting one tube from each plant to each customer is shown in the transport cost matrix. Customer-1 is willing to buy 85 tubes per week, Customer-2 35 and Customer-3 100. TV.co wants to find a shipping plan that minimizes shipping costs. Write the values of the decision variables and calculate the minimum transport costs using the Celex code and its results. TP.Kosten-[[75, 60, 69) [79, 73.68). (85, 76, 70J]; range Nerk-1..3; range Kunde-1..3; Nachfragenenge- [85, 39, 100); Angebotsmengd-65e, 100, 70J float TP_Kosten[Werk] [Kunde]-...; float Nachfragemenge [Kunde]-... float Angebotsmenge [Nerk]-...; KH Problem browne 83 WAHANA Breakpolita dvar float+ X[erk] [Kunde]; 192 minimize sunci in Werk,j in Kunde) X[I][]-TP kosten(10): Value subject to forall(j in Kunde) sun(i in Werk) x[i]()--Nachfragemenge! forallci in Werk) sun() in Kunde) X(+6)--Angebotsrenge[13: 3 Nama WOOD Angebotssend Wonde WrNachtroumenge 150 100 70) 1.3 [85 95 100) 1175 60 69] [79 73 68) 185 76 701 TP Kosten u welk VI Decision with urx 1/15 360) 170 0 30) (0 0 701) 3) Kai is a hard-working student at the University of Duisburg-Essen. If he just learns and doesn't play games, he'll be bored. As a result, Kai wants to split his available time of 10 hours per day between studying and playing. He estimates that playing is twice as fun as learning. He also wants to learn at least as much as he plays. He also notices the following: If all of his homework is to be finished, then he annot play more than 4 hours a day. How should Kai plan his available time to maximize his enjoyment of learning and playing? Determine the optimal solution 0 M N2 ai (15) 75 (35) bo 50 (70) F 79 (30) Noo (70) Ez 85. to 70 b; 55 35 3 100 TK = 75 (15) + 60 (35) +7967.) + 68 (90) + 70 (78) = 15 695 (68) 2 / 14 + 66.7% Jei 211; zeit von spielen Fr kai Protag (Stunde) nzi reit von Lernen . For mai pro tag (Stunde Mar z a 2 + 2x2 cod. ~ 1 I ni anla na du no e o 1 20,510 x 2 3 4 ma 15 WS I 1- oni tra Eu G Stunde Protag 22 u Stunde Pro tag FE 14 Stunde von Spa 1)TVco produces TV picture tubes in three plants. Plant-1 can produce 50 tubes per week, Plant-2 100 tubes per week and Plant-3 70 tubes per week. The tubes are sent to three customers. The cost of transporting one tube from each plant to each customer is shown in the transport cost matrix. Customer-1 is willing to buy 85 tubes per week, Customer-2 35 and Customer-3 100. TV.co wants to find a shipping plan that minimizes shipping costs. Write the values of the decision variables and calculate the minimum transport costs using the Celex code and its results. TP.Kosten-[[75, 60, 69) [79, 73.68). (85, 76, 70J]; range Nerk-1..3; range Kunde-1..3; Nachfragenenge- [85, 39, 100); Angebotsmengd-65e, 100, 70J float TP_Kosten[Werk] [Kunde]-...; float Nachfragemenge [Kunde]-... float Angebotsmenge [Nerk]-...; KH Problem browne 83 WAHANA Breakpolita dvar float+ X[erk] [Kunde]; 192 minimize sunci in Werk,j in Kunde) X[I][]-TP kosten(10): Value subject to forall(j in Kunde) sun(i in Werk) x[i]()--Nachfragemenge! forallci in Werk) sun() in Kunde) X(+6)--Angebotsrenge[13: 3 Nama WOOD Angebotssend Wonde WrNachtroumenge 150 100 70) 1.3 [85 95 100) 1175 60 69] [79 73 68) 185 76 701 TP Kosten u welk VI Decision with urx 1/15 360) 170 0 30) (0 0 701) 3) Kai is a hard-working student at the University of Duisburg-Essen. If he just learns and doesn't play games, he'll be bored. As a result, Kai wants to split his available time of 10 hours per day between studying and playing. He estimates that playing is twice as fun as learning. He also wants to learn at least as much as he plays. He also notices the following: If all of his homework is to be finished, then he annot play more than 4 hours a day. How should Kai plan his available time to maximize his enjoyment of learning and playing? Determine the optimal solution 0 M N2 ai (15) 75 (35) bo 50 (70) F 79 (30) Noo (70) Ez 85. to 70 b; 55 35 3 100 TK = 75 (15) + 60 (35) +7967.) + 68 (90) + 70 (78) = 15 695 (68) 2 / 14 + 66.7% Jei 211; zeit von spielen Fr kai Protag (Stunde) nzi reit von Lernen . For mai pro tag (Stunde Mar z a 2 + 2x2 cod. ~ 1 I ni anla na du no e o 1 20,510 x 2 3 4 ma 15 WS I 1- oni tra Eu G Stunde Protag 22 u Stunde Pro tag FE 14 Stunde von Spa