The Electronics Corporation manufactures four highly technical products that it supplies to erospace firms that hold NAS
Posted: Wed Apr 27, 2022 1:28 pm
The Electronics Corporation manufactures four highly technical products that it supplies to erospace firms that hold NASA contracts. Each of the products must pass through the following departments before they are shipped: wiring, drilling, assembly, and inspection. The time requirement in hours for each unit produced and its corresponding profit value are summarized in the following
table:
Product XJ201 XM897 TR29 BR788 Wiring 0.5 1.5 1.5 1 Drilling 0.3 1 2 3 Department Assembly 0.2 4 1 2 Inspection 0.5 1 0.5 0.5 Unit Profit ($) 9 12 15 11 The production available in each department each month, and the minimum monthly production requirement to fulfill contract, are as follows: Department Capacity (Hours) Product Minimum Production Level Wiring 15,000 XJ201 150 Drilling 17,000 XM897 100 Assembly 26,000 TR29 300 Inspection 12,000 BR788 400
Questions: a. Set up the objective function & its constraints problem using Linear Programming. Assuming XJ201, XM897, TR29, BR788 are represented by X1, X2, X3, and X4 respectively. b. Find the optimal solution of the problem by using LP.
- The Electronics Corporation Manufactures Four Highly Technical Products That It Supplies To Erospace Firms That Hold Nas 1 (46.8 KiB) Viewed 47 times
- The Electronics Corporation Manufactures Four Highly Technical Products That It Supplies To Erospace Firms That Hold Nas 2 (17.11 KiB) Viewed 47 times
Product XJ201 XM897 TR29 BR788 Wiring 0.5 1.5 1.5 1 Drilling 0.3 1 2 3 Department Assembly 0.2 4 1 2 Inspection 0.5 1 0.5 0.5 Unit Profit ($) 9 12 15 11 The production available in each department each month, and the minimum monthly production requirement to fulfill contract, are as follows: Department Capacity (Hours) Product Minimum Production Level Wiring 15,000 XJ201 150 Drilling 17,000 XM897 100 Assembly 26,000 TR29 300 Inspection 12,000 BR788 400
Questions: a. Set up the objective function & its constraints problem using Linear Programming. Assuming XJ201, XM897, TR29, BR788 are represented by X1, X2, X3, and X4 respectively. b. Find the optimal solution of the problem by using LP.