- You Are A Contractor Working For Company C This Company Builds Computer Chips And It Needs To Buy A Lot Of Silicon Wh 1 (91.37 KiB) Viewed 31 times
- You Are A Contractor Working For Company C This Company Builds Computer Chips And It Needs To Buy A Lot Of Silicon Wh 2 (41.96 KiB) Viewed 31 times
- You Are A Contractor Working For Company C This Company Builds Computer Chips And It Needs To Buy A Lot Of Silicon Wh 3 (55.38 KiB) Viewed 31 times
You are a contractor working for company C. This company builds computer chips, and it needs to buy a lot of silicon, which is the main material used to fabricate these chips. Your work, as a contractor, is to buy the amount of silicon needed (in kg ) from other companies, and sell it to company C. However, and since the pandemic started, the price of silicon has been very volatile. So, your task is to determine the max commission you can get from selling (x)kg of silicon to company C considering that several companies are selling silicon it at a different price per kg. For example: given two lists S=[a,b,c,d], and P=[$20,$90,$50,$30] where S represents a list of companies (subcontractors) selling silicon, and P the list of prices per (k) kilograms of silicon offered from these companies, where k=(i+1), and i represents the index of every price in P. Your goal is to find the maximum profit for selling 3 kg of silicon to company C if it is guarantied that you'll get a commission of 20% from this profit From the data given in this problem we can infer that: - Subcontractor company a offers 1 kg of silicon at a price of $20 - Subcontractor company b offers 2 kg of silicon at a price of $90 - Subcontractor company c offers 3 kg of silicon at a price of $50 - Subcontractor company d offers 4 kg of silicon at a price of $30 So, using the above offers from all the subcontractors, you (the contractor) can compute the maximum profit of selling 3 kg of silicon to company C using the following logic:
1. You buy 3 kg of silicon from company "c" at a total price of $50 2. You buy 1 kg of silicon from company "a" and 2 kg of silicon from company "b" at a total price of $20+$90=$110 3. You buy 1 kg+1 kg+1 kg of silicon from company "a" at a total price of $20+$20+$20= $60 4. You buy 3 kg out of 4 kg of silicon from company "d" at a total price of 4kg3kg($30)=$22.5 Therefore, from all the transactions, the one that provides the maximum profit is transaction (2) where you can buy 3 kg of silicon for $110. Once the silicon you got is sold to company C for the same price you bought it, and after 20% of commission is applied, you'll get a profit of $22 for this transaction
1. (2.25 points) Given a list of subcontractor companies Ci=[c1,c2,c3,…,cn] and an unsorted list of prices Pi=[p1,p2,p3,…,pn], where company C[ci] is selling k=(i+1) kilograms of silicon at a price of P[pi]. Create the algorithm to find the maximum profit of selling n kilograms of silicon, and the profit you'll get if you charge a commission of 20% for this sale: (a) (0.25 points) Create a state-space tree to brute force the problem (b) (2 points) Find a dynamic programming solution for this problem. For this part, you can use the sample problem given in page (2) of this assignment: - Create a DP table where I can see all the steps you took to find all the optimal solutions and then, the maximum profit - Explain clearly how you computed your DP maximization function to solve this problem, and prove that this function works for at least two other similar problems with different prices. You must show all your work in detail to get full credit.