2024/01/18 by Anurag Dutta, Dutta, Anurag, Lakshmanan, K. +4
Engineering · #Aerospace Engineering and Control Systems #FOS: Mathematics #Optimization and Control (math.OC)
paper · pdf · doi:10.48550/arxiv.2401.16428
openalex publication_date 2024/01/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Mathematical Selection is a method in which we select a particular choice from a set of such. It have always been an interesting field of study for mathematicians. Combinatorial optimisation is the practice of selecting the best constituent from a collection of prospective possibilities according to some particular characterization. In simple cases, an optimal process problem encompasses identifying components out of a finite arrangement and establishing the function's significance in possible to lessen or achieve maximum with a functional purpose. To extrapolate optimisation theory, it employs a wide range of mathematical concepts. Optimisation, when applied to a variety of different types of optimization algorithms, necessitates determining the best consequences of the specific predetermined characteristic in a particular circumstance. In this work, we will be working on one similar problem - The Maximal Stretch Problem with computational rigour. Beginning with the Problem Statement itself, we will be developing numerous step - by - step algorithms to solve the problem, and will finally pose a comparison between them on the basis of their Computational Complexity. The article entails around the Brute Force Solution, A Recursive Approach to deal with the problem, and finally a Dynamically Programmed Approach for the same.