Answer to Question #3034 in Quantitative Methods for OLUCHI
You have x buses that you have to fill with people. Each bus has a different price p(x). Each bus has to make a minimum amount of money m(x) and you have y people. Come up with an algorithm/ a way to fill the buses given those constraints. Assume the customers usually picks the cheapest bus. So create a pricing algorithm to ensure that the buses are filled to at least attain the minimum amount of money m(x)
Unfortunately, your question requires a lot of work and cannot be done for free. Submit it with all requirements as an assignment to our control panel and we'll assist you.