ML, Optimisation, Convex Optimization, Price Optimization.
Iterations: 3 Function evaluations: 9 Gradient evaluations: 3 The results of the optimisation closely matches to the maximum profit as seen in the generated data set. Hence we know that the optimisation has worked as expected. Max profit values: price (x), volume (y) and profit(z) Non Convex