Closed

# Assist me With Python Code (supply and demand)

This project received 13 bids from talented freelancers with an average bid price of \$144 AUD.

\$30 - \$250 AUD
13
###### Project Description

Hi Everyone,

Please note the time is very short. I am working on solving problem (I attached all documents). The idea there is a supplier has a contract to fill up the demand for (t time period) 3 customers, and should be achieved the target of success (fill up the demand over t time) [url removed, login to view], and if

the demand in that time lower than that target he will be penalised.

To calculate that (for example) : fill rate = (total supplied / total demand) for whole time, like, the demand is should be filled 10 everday for 5 days. and supplier filled

(9+10+9+10+10/50)= [url removed, login to view] > higher that [url removed, login to view] no penalty. I have attached this model with the code

I did the code works fine (all goods), NOW, in the previous code (we shuffling the customers (first come first served) which means I solved that in a stochastic.

Now, I need to solve that using (Linear programming) I have attached that. Which if I have 3 customers, and the stock level (number of items) = 15, and their demands (cus1 = 10, cus2=5, , cus 3 = 6) we should be used optimal solution, and supplier gives 5 for each customers as stock level = 15 (in my work stock level = [url removed, login to view]).

To solve that (We need to use Package Called scipiy ([url removed, login to view])), and using that for a formula I have attached in PDF file.

We need only to change in my code (# calculate order part you see that in the code I have explained every thing).

Don't worry in my code most I have just write it to print it and make sure is correct.

Please If you got it let me know to discuss, and Remember to install the package (Anaconda) to solve that other wise the code can't run.

Please be reasonable price with bid, hope to hear from You....

## Hire Freelancers who also bid on this project

• Forbes
• The New York Times
• Time
• Wall Street Journal
• Times Online