Linear-Programming

Title and Group Details

Linear programming is the process of using mathematical models to solve linear problems in order to maximize or minimize an objective function while keeping certain restrictions in mind.Let’s suppose that we are a very famous e-commerce platform. We have to introduce a new relay point in a city for the shipment of products. Only information we have is the coordinates of all the clients of the company in the city. We need to minimize the distance between each relay point and each client in the city

from manhattan import solve
M = [(10, 20), (15, 45), (22, 19), (33, 42)]
p = 2
sol = solve(M, p)

sol will give [(14.0, 19.0), (21.0, 43.0)] as output

Lewis, H. (2015, June 8). .Taxicab Geometry. . Retrieved October 25,2021, from Taxicab Geometry.
Bilot, T. (2018). .The power of linear programming, a real life case study.. Retrieved October 25,2021, from The power of linear programming, a real life case study.
Urdaneta, A. , lberto, R. (February, 1996). Coordination of directional relay timing using linear programming. Retrieved November 2, 2021, from Coordination of directional relay timing using linear programming
Journal of Natural Gas Science and Engineering. (2012). Retrieved November 15, 2021, from Refinery Linear Programming Modeling
GeeksForGeeks. (2021, Jan 21). .Maximum Manhattan distance between a distinct pair from N coordinates. Retreived 25 November, 2021, from Maximum Manhattan distance between a distinct pair from N coordinates