- multilevel programming
- иерархическое программирование
Большой англо-русский и русско-английский словарь. 2001.
multilevel programming
Смотреть что такое "multilevel programming" в других словарях:
Multilevel programming — The level refers to sets of variables. A bilevel program has two sets: min f(x, y): x in X, y in Y, h(x, y)=0, g(x, y)=0. A reason for identifying levels is to apply a decomposition principle for algorithm design. One example is the bilinear… … Wikipedia
Semi infinite programming — In mathematics, semi infinite programming (SIP) is an optimization problem with a finite number of variables and an infinite number of constraints, or a infinite number of variables and a finite number of constraints… … Wikipedia
Generalized semi-infinite programming — In mathematics, generalized semi infinite programming (GSIP) is an optimization problem with a finite number of variables and an infinite number of constraints. The constraints are parameterized by parameters and the feasible set of the… … Wikipedia
Inheritance (object-oriented programming) — In object oriented programming (OOP), inheritance is a way to reuse code of existing objects, establish a subtype from an existing object, or both, depending upon programming language support. In classical inheritance where objects are defined by … Wikipedia
Mathematical programming with equilibrium constraints — (MPEC) is the study of constrained optimization problems where the constraints include variational inequalities or complementarities. MPEC is related to the Stackelberg game. MPEC is used in the study of engineering design, economic equilibrium… … Wikipedia
List of mathematics articles (M) — NOTOC M M estimator M group M matrix M separation M set M. C. Escher s legacy M. Riesz extension theorem M/M/1 model Maass wave form Mac Lane s planarity criterion Macaulay brackets Macbeath surface MacCormack method Macdonald polynomial Machin… … Wikipedia
List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra … Wikipedia
Programmable logic device — A programmable logic device or PLD is an electronic component used to build reconfigurable digital circuits. Unlike a logic gate, which has a fixed function, a PLD has an undefined function at the time of manufacture. Before the PLD can be used… … Wikipedia
Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… … Wikipedia
Phase-change memory — Computer memory types Volatile RAM DRAM (e.g., DDR SDRAM) SRAM In development T RAM Z RAM TTRAM Historical Delay line memory Selectron tube Williams tube Non volatile … Wikipedia
Top Trees — The Top Tree is a binary tree based data structure for unrooted dynamic trees which is used mainly for carrying out various path related operations, it allows simple Divide and conquer algorithms. It has since been augmented to maintain… … Wikipedia
