Preprint
Article

Fine-Tune Robust Optimization

Altmetrics

Downloads

245

Views

166

Comments

0

A peer-reviewed article of this preprint also exists.

Submitted:

23 October 2020

Posted:

26 October 2020

You are already at the latest version

Alerts
Abstract
A Robust Optimization framework with original concepts and fundamentals also admitting a fusion of ideals from relative regret models and static robust optimization, containing conservatism concepts is disclosed. The algorithm uses a fine-tune strategy to tune the model so the robustness and a target ideality can be mutually achieved with a specified risk. The framework comprises original concepts, a mathematical approach and an algorithm. The statistical treatment of the data with the original concepts from the framework make it able to make short, middle or long-term decision-making setting. The framework has high tractability since the algorithm forces the creation of a setting that makes a robust optimization with the specified risk. The framework can be applied in linear and nonlinear mathematical models since that the objective function is monotonic in the domain of the active convex region. Several examples are solved to best understand the framework and all results demonstrated high tractability and performance. There is a wide range of applications. Along all the text, there is a profound discussion about its philosophy, objective, original concepts, fields of application, statistical and probabilistic fundamentals.
Keywords: 
Subject: Computer Science and Mathematics  -   Algebra and Number Theory
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2024 MDPI (Basel, Switzerland) unless otherwise stated