Semi-Infinite Programming: Recent AdvancesMiguel Ángel Goberna, Marco A. López Springer Science & Business Media, 2013. gada 11. nov. - 386 lappuses Semi-infinite programming (SIP) deals with optimization problems in which either the number of decision variables or the number of constraints is finite. This book presents the state of the art in SIP in a suggestive way, bringing the powerful SIP tools close to the potential users in different scientific and technological fields. The volume is divided into four parts. Part I reviews the first decade of SIP (1962-1972). Part II analyses convex and generalised SIP, conic linear programming, and disjunctive programming. New numerical methods for linear, convex, and continuously differentiable SIP problems are proposed in Part III. Finally, Part IV provides an overview of the applications of SIP to probability, statistics, experimental design, robotics, optimization under uncertainty, production games, and separation problems. Audience: This book is an indispensable reference and source for advanced students and researchers in applied mathematics and engineering. |
No grāmatas satura
1.–5. rezultāts no 87.
4. lappuse
... exists an English translation of the journal in which it appeared . More will be written about this important paper in a later section . In the meantime the pair of dual linear semi - infinite programs is given in the first definition ...
... exists an English translation of the journal in which it appeared . More will be written about this important paper in a later section . In the meantime the pair of dual linear semi - infinite programs is given in the first definition ...
9. lappuse
... exists λ¿ ≥ 0 , i Є I , with at most m + 1 nonzero , such that uT Po - d > ( u Pi – ci ) \ i . ΕΙ - ( 3.1 ) The original statement of the theorem was imprecise and therefore incorrect . Haar did not state the assumptions of interiority ...
... exists λ¿ ≥ 0 , i Є I , with at most m + 1 nonzero , such that uT Po - d > ( u Pi – ci ) \ i . ΕΙ - ( 3.1 ) The original statement of the theorem was imprecise and therefore incorrect . Haar did not state the assumptions of interiority ...
10. lappuse
... exists € Σ › Є R11 , λ ≥0 , such that uT Po - d≥ ( uTP ; - ci ) λi for all u € Rm . ΕΙ ( 3.2 ) 4 INTRODUCING AN INFINITY INTO SEMI - INFINITE PROGRAMMING Another major theme of this period was to investigate the introduction of ...
... exists € Σ › Є R11 , λ ≥0 , such that uT Po - d≥ ( uTP ; - ci ) λi for all u € Rm . ΕΙ ( 3.2 ) 4 INTRODUCING AN INFINITY INTO SEMI - INFINITE PROGRAMMING Another major theme of this period was to investigate the introduction of ...
11. lappuse
... exists r , s Є I such that αr αs < 0 . These results are purely algebraic as manifested by the generality obtained by using any ordered field . An opposite sign property algorithm for purification to an extreme point solution was ...
... exists r , s Є I such that αr αs < 0 . These results are purely algebraic as manifested by the generality obtained by using any ordered field . An opposite sign property algorithm for purification to an extreme point solution was ...
15. lappuse
... exists c E D such that a < c and b < c . The net Sa is eventually in a set X if there exists ẞ E D such that ß < Y implies Sy Є X. A net converges to a point P if Sa is eventually in each neighborhood of P. It was rather cumbersome to ...
... exists c E D such that a < c and b < c . The net Sa is eventually in a set X if there exists ẞ E D such that ß < Y implies Sy Є X. A net converges to a point P if Sa is eventually in each neighborhood of P. It was rather cumbersome to ...
Saturs
14 | |
References | 34 |
75 | 40 |
2 | 45 |
ASYMPTOTIC CONSTRAINT QUALIFICATIONS | 75 |
VEX SEMIINFINITE PROGRAMMING | 101 |
6 | 120 |
Alexander Shapiro | 135 |
8 | 217 |
ANALYTIC | 221 |
ON SOME APPLICATIONS OF LSIP TO PROBABILITY | 235 |
References | 254 |
References | 269 |
15 | 325 |
Numerical Results | 345 |
207 | 348 |
Citi izdevumi - Skatīt visu
Semi-Infinite Programming: Recent Advances Miguel Ángel Goberna,Marco A. López Ierobežota priekšskatīšana - 2001 |
Semi-Infinite Programming: Recent Advances Miguel ngel Goberna,Marco A. L pez Priekšskatījums nav pieejams - 2001 |
Bieži izmantoti vārdi un frāzes
algorithm Applications Assume assumption asymptotic Banach space Charnes compact sets computation cone consider constraint qualification convergence Convex Analysis convex functions convex inequality convex programming convex set cutting plane defined denote dual problem duality theory equivalent example exists feasible set feasible solution finite number ft(x fuzzy numbers fuzzy sets given global error bound Hence holds hyperplane implies infinite interval iteration K. O. Kortanek Lemma linear programming linear semi-infinite programming lower semicontinuous LSIP Mathematical Programming method minimizer moment problem nonempty norm obtain Operations Research optimal solution optimization problem parameter previsions primal problem of moments Proof Proposition result satisfied Section semi-infinite optimization semi-infinite programming problems sequence solution set solving Step sup-function t₁ Theorem 3.1 topology val(CLP val(D val(P vector weak PLV property αΕΩ ΘΕΩ