Please complete part B Homework: GP #3 Module B Linear Programming Save Score: 0

Question

Please complete part B

Homework: GP #3 Module B Linear Programming Save Score: 0 of 10 pts 1 of 4 (0 complete) HW Score: 0%, 0 of 40 pts Problem B.7 Question Help Green Vehicle Inc., manufactures-ectric cars and small delivery trucks. It has just opened new factory where the C1 car and the T1 truck can beth be mand To ake ctr veck, processing in the assembly shop and in the paint shop are requ red. t takes 1140 ot a day and 1.8u ot a day to paint a truck ot type 1 and a car af type C1 in the paint shop, respectively It takes 145 of a day to assemble either type of vehizle in the assembly shop A T1 ruck and a C1 car yield profils of $300 and $220, especlively, per vehick suld The aim of the objective function or reen Vehicle Inc should be to Maximize the objective value Decision variables T number of trucks lo be produced per day C- number ot cars to be produced per day a) Objective function: 2-30220 C Subject to: (1/4OIT, (1:80)C 145)T 1 45C T, C 20 1 (C1) 1 (C2) 0 10 20 30 10 50 60 70 80 90 100 b) On the sraph on righl, coistraints C1 ad C2 have been drawn Using the poidawing too, plot all the copoints for the feasiblc arca

Explanation / Answer

Answer.

Feasible region : corner points

A= (0, 45)

B=(0,0)

C=(40,0)

D=(35, 10)

(I don't know if it's 1/45, or 1/40, but according to your graph, these are the corner points, if any problem than comment.

Or it is in this way?

A= (0, 1/45)

B=(0,0)

C=(1/40, 0)

D=(1/35, 1/10)

(I apologise if it's not upto your requirement)

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.