2003 | OriginalPaper | Buchkapitel
Introduction
verfasst von : Alexander Rubinov, Xiaoqi Yang
Erschienen in: Lagrange-type Functions in Constrained Non-Convex Optimization
Verlag: Springer US
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Consider the following mathematical programming problem with inequality constraints: 1.1<m:math display='block'> <m:mrow> <m:mi>min</m:mi><m:mtext> </m:mtext><m:mi>f</m:mi><m:mrow><m:mo>(</m:mo> <m:mi>x</m:mi> <m:mo>)</m:mo></m:mrow><m:mtext> </m:mtext><m:mi>s</m:mi><m:mi>u</m:mi><m:mi>b</m:mi><m:mi>j</m:mi><m:mi>e</m:mi><m:mi>c</m:mi><m:mi>t</m:mi><m:mtext> </m:mtext><m:mi>t</m:mi><m:mi>o</m:mi><m:mtext> </m:mtext><m:mi>x</m:mi><m:mo>∈</m:mo><m:mtext> </m:mtext><m:mi>X</m:mi><m:mo>,</m:mo><m:msub> <m:mi>g</m:mi> <m:mi>i</m:mi> </m:msub> <m:mrow><m:mo>(</m:mo> <m:mi>x</m:mi> <m:mo>)</m:mo></m:mrow><m:mo>≤</m:mo><m:mn>0</m:mn><m:mtext> </m:mtext><m:mi>i</m:mi><m:mo>=</m:mo><m:mn>1</m:mn><m:mo>,</m:mo><m:mo>…</m:mo><m:mo>,</m:mo><m:mi>m</m:mi><m:mo>,</m:mo></m:mrow> </m:math>]]</EquationSource><EquationSource Format="TEX"><![CDATA[$$\min \;f\left( x \right)\;subject\;to\;x \in \;X,{g_i}\left( x \right) \leqslant 0\quad i = 1, \ldots ,m,$$ where f and g i , i = 1,…, m are real-valued functions defined on a metric space X. Let g(x) = (g1 (x),…, g m (x)). We consider g as a map defined on X and mapping into ℝm. Denote the problem (1.1.1) as P(f, g).