stochastic programming

stochastic programming
матем. стохастическое программирование

Большой англо-русский и русско-английский словарь. 2001.

Игры ⚽ Поможем написать реферат

Смотреть что такое "stochastic programming" в других словарях:

  • Stochastic programming — is a framework for modeling optimization problems that involve uncertainty. Whereas deterministic optimization problems are formulated with known parameters, real world problems almost invariably include some unknown parameters. When the… …   Wikipedia

  • stochastic programming — tikimybinis programavimas statusas T sritis automatika atitikmenys: angl. stochastic programming vok. stochastische Programmierung, f rus. стохастическое программирование, n pranc. programmation stochastique, f ryšiai: sinonimas – stochastinis… …   Automatikos terminų žodynas

  • Stochastic calculator — The concept of calculator stochastic is already old (for the young history of data processing) and contemporary of research and applications developed at the any end of the decade 1950 and until the middle of the decade 1970.Their definition in… …   Wikipedia

  • Stochastic context-free grammar — A stochastic context free grammar (SCFG; also probabilistic context free grammar, PCFG) is a context free grammar in which each production is augmented with a probability. The probability of a derivation (parse) is then the product of the… …   Wikipedia

  • Linear programming — (LP, or linear optimization) is a mathematical method for determining a way to achieve the best outcome (such as maximum profit or lowest cost) in a given mathematical model for some list of requirements represented as linear relationships.… …   Wikipedia

  • Dynamic programming — For the programming paradigm, see Dynamic programming language. In mathematics and computer science, dynamic programming is a method for solving complex problems by breaking them down into simpler subproblems. It is applicable to problems… …   Wikipedia

  • Second-order cone programming — A second order cone program (SOCP) is a convex optimization problem of the form:minimize f^T x subject to:lVert A i x + b i Vert 2 leq c i^T x + d i,quad i = 1,dots,m:Fx = g where the problem parameters are f in mathbb{R}^n, A i in mathbb{R}^n i} …   Wikipedia

  • Mathematical Programming Society — Known as the Mathematical Programming Society until 2010,[1] the Mathematical Optimization Society (MOS) is an international association of researchers active in optimization. The MOS encourages the research, development, and use of optimization… …   Wikipedia

  • Mathematical Programming —   Former name(s) Mathematical Programming Studies …   Wikipedia

  • Mathematical Programming Society — Logo der Mathematical Programming Society Die Mathematical Programming Society (MPS) ist eine internationale Organisation im Bereich der mathematischen Optimierung. Ihr Ziel ist die Förderung der Optimierung in Theorie und Praxis. Die MPS… …   Deutsch Wikipedia

  • Marginal conditional stochastic dominance — In finance, marginal conditional stochastic dominance is a condition under which a portfolio can be improved in the eyes of all risk averse investors by incrementally moving funds out of one asset (or one sub group of the portfolio s assets) and… …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»