A Comparative Investigation into the Operation of an Optimal Control Problem: The Maximal Stretch
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929228127141888 |
|---|---|
| author | Dutta, Anurag Lakshmanan, K. Harshith, John Ramamoorthy, A. |
| author_facet | Dutta, Anurag Lakshmanan, K. Harshith, John Ramamoorthy, A. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_16428 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Comparative Investigation into the Operation of an Optimal Control Problem: The Maximal Stretch Dutta, Anurag Lakshmanan, K. Harshith, John Ramamoorthy, A. Optimization and Control 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. |
| title | A Comparative Investigation into the Operation of an Optimal Control Problem: The Maximal Stretch |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2401.16428 |