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 57.
10. lappuse
... implies there 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 ...
... implies there 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 ...
11. lappuse
... implies that there 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 ...
... implies that there 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 ...
15. lappuse
... implies a = b , and 3. Compositive , a , d E D implies that there 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 ...
... implies a = b , and 3. Compositive , a , d E D implies that there 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 ...
16. lappuse
... implies that ( 4.2 ) is asymptotically unbounded ( AUBD ) , an example of [ 61 , Theorem 9 ] . Actually , the asymptotic limiting behavior of ( 4.2 ) suggests adjoining bounds on the variables having different powers in 0 , e.g. , u1-0 ...
... implies that ( 4.2 ) is asymptotically unbounded ( AUBD ) , an example of [ 61 , Theorem 9 ] . Actually , the asymptotic limiting behavior of ( 4.2 ) suggests adjoining bounds on the variables having different powers in 0 , e.g. , u1-0 ...
19. lappuse
... implies uTP 。> vd , noting that the left - side inequality system is consistent because Program D of ( 1.1 ) is . ( 4.14 ) Consider the following dual pair of finite linear programs . Primal Pj min uT Po subject to uT Pj > cj , for all ...
... implies uTP 。> vd , noting that the left - side inequality system is consistent because Program D of ( 1.1 ) is . ( 4.14 ) Consider the following dual pair of finite linear programs . Primal Pj min uT Po subject to uT Pj > cj , for all ...
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 αΕΩ ΘΕΩ