Linear programming is a mathematical method that is used to optimize the allocation of resources. It can be applied to a wide range of problems, such as maximizing profits or minimizing costs. One of the key concepts in linear programming is the shadow price, which can be used to determine how a change in one of the constraints of a linear programming problem affects the optimal solution.
Mathematical programming is a field of mathematics that deals with the optimization of complex systems and processes. It has a rich history that dates back to the 1940s when George Dantzig, an American mathematician, developed the simplex method for solving linear programming problems. Since then, it has grown into a vast and dynamic discipline that has found applications in various fields such as finance, transportation, engineering, and operations research.
In this blog post, I will explore the origins of mathematical programming, provide an example of a problem that can be tackled and list some classical problems. I will also discuss some of the software products used in mathematical programming, both open-source and commercial.
I was introduced to the shortest superstring problem by a request I got on Fiverr. The request turned out to be a waste of time but I really enjoyed learning about it.
The shortest common superstring problem aims to find a string with a minimal length that contains every string in a given set.
