ML, Optimisation, Convex Optimization, Price Optimization.
same convex optimisation as above, the solution we get will be a local minimum as seen below. We get a max profit of 6.86 mil for a optimised price of 5, 018 and product type 0. Local minimum from convex optimisation Basinhopping algorithm Basin-hopping is an algorithm that combines a global