- feasible region
- область допустимых решений Syn : constraint region
Большой англо-русский и русско-английский словарь. 2001.
feasible region
Смотреть что такое "feasible region" в других словарях:
Rapid transit in Waterloo Region — There is an ongoing proposal for the introduction of a rapid transit service in the Region of Waterloo in Ontario as an enhancement to Grand River Transit. As of 2008, an Environmental Assessment (EA) is underway to establish a light rail or a… … 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
Cutting-plane method — In mathematical optimization, the cutting plane method is an umbrella term for optimization methods which iteratively refine a feasible set or objective function by means of linear inequalities, termed cuts. Such procedures are popularly used to… … Wikipedia
Mathematical optimization — For other uses, see Optimization (disambiguation). The maximum of a paraboloid (red dot) In mathematics, computational science, or management science, mathematical optimization (alternatively, optimization or mathematical programming) refers to… … Wikipedia
Criss-cross algorithm — This article is about an algorithm for mathematical optimization. For the naming of chemicals, see crisscross method. The criss cross algorithm visits all 8 corners of the Klee–Minty cube in the worst case. It visits 3 additional… … Wikipedia
Optimization (mathematics) — In mathematics, the term optimization, or mathematical programming, refers to the study of problems in which one seeks to minimize or maximize a real function by systematically choosing the values of real or integer variables from within an… … Wikipedia
Newell-Daganzo Merge Model — Variables included in Newell Daganzo merge model represented on diagram of merging traffic branches. In traffic flow theory, the Newell Daganzo merge model describes a simple procedure on how to determine the flows exiting two branch roadways and … Wikipedia
Active set — In optimization, a problem is defined using an objective function to minimize or maximize, and a set of constraints :g 1(x)ge 0, dots, g k(x)ge 0 that define the feasible region , that is, the set of all x to search for the optimal solution.… … Wikipedia
область допустимых решений — — [А.С.Гольдберг. Англо русский энергетический словарь. 2006 г.] область допустимых решений допустимое множество множество возможностей множество допустимых решений область допустимых значений область свободы решений Понятие математического … Справочник технического переводчика
Karmarkar's algorithm — is an algorithm introduced by Narendra Karmarkar in 1984 for solving linear programming problems. It was the first reasonably efficient algorithm that solves these problems in polynomial time. The ellipsoid method is also polynomial time but… … Wikipedia
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
