نتایج جستجو برای: box set robust optimization
تعداد نتایج: 1177959 فیلتر نتایج به سال:
Representing the uncertainties with a set of scenarios, the optimization problem resulting from a robust nonlinear model predictive control (NMPC) strategy at each sampling instance can be viewed as a large-scale stochastic program. This paper solves these optimization problems using the parallel Schur complement method developed to solve stochastic programs on distributed and shared memory mac...
optimization of reservoir parameters is an important issue in petroleum exploration and production. the ant colony optimization(aco) is a recent approach to solve discrete and continuous optimization problems. in this paper, the ant colony optimization is usedas an intelligent tool to estimate reservoir rock properties. the methodology is illustrated by using a case study on shear wave velocity...
We propose Multi-Strategy Coevolving Aging Particles (MS-CAP), a novel population-based algorithm for black-box optimization. In a memetic fashion, MS-CAP combines two components with complementary algorithm logics. In the first stage, each particle is perturbed independently along each dimension with a progressively shrinking (decaying) radius, and attracted towards the current best solution w...
This paper proposes a systematic technique to design multiple robust H∞ controllers. The proposed technique achieves a desired robust performance objective, which is impossible to achieve with a single robust controller, by dividing the uncertainty set into several subsets, and by designing a robust controller to each subset. To achieve this goal with a small number of divisions of the uncertai...
This study proposes a combination of a fuzzy sliding mode controller (FSMC) with integral-proportion-Derivative switching surface based superconducting magnetic energy storage (SMES) and PID tuned by a multi-objective optimization algorithm to solve the load frequency control in power systems. The goal of design is to improve the dynamic response of power systems after load demand changes. In t...
The Pareto set of a multiobjective optimization problem consists of the solutions for which one or more objectives can not be improved without deteriorating one or more other objectives. We consider problems with linear objectives and linear constraints and use Adjustable Robust Optimization and Polynomial Optimization as tools to approximate the Pareto set with polynomials of arbitrarily large...
A multiobjective binary integer programming model for R&D project portfolio selection with competing objectives is developed when problem coefficients in both objective functions and constraints are uncertain. Robust optimization is used in dealing with uncertainty while an interactive procedure is used in making tradeoffs among the multiple objectives. Robust nondominated solutions are generat...
We consider a distributionally robust optimization problem where the ambiguity set of probability distributions is characterized by a tractable conic representable support set and expectation constraints. Specifically, we propose and motivate a new class of infinitely constrained ambiguity sets in which the number of expectation constraints could potentially be infinite. We show how the infinit...
index tracking is the process of developing a portfolio that reproduces the performance of an index. the tracker portfolio has relatively good diversity and low turnover and low transaction costs. in this paper we applied a binary programming model for index tracking problem. in this model the number of assets for portfolio construction is defined by portfolio manager. the robust optimization f...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید