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 44.
viii. lappuse
... topology of M 3 4 5 A local first order description of M First order optimality conditions Final remarks References 121 123 126 130 132 132 7 ON DUALITY THEORY OF CONIC LINEAR PROBLEMS Alexander Shapiro viii SEMI - INFINITE PROGRAMMING ...
... topology of M 3 4 5 A local first order description of M First order optimality conditions Final remarks References 121 123 126 130 132 132 7 ON DUALITY THEORY OF CONIC LINEAR PROBLEMS Alexander Shapiro viii SEMI - INFINITE PROGRAMMING ...
4. lappuse
... topology with the probing taking place in an infinite programming setting . See [ 11 ] . The authors started from the 1924 paper of A. Haar , [ 58 ] , and defined the notion of " Haar " ( or " semi - infinite " ) programs having the ...
... topology with the probing taking place in an infinite programming setting . See [ 11 ] . The authors started from the 1924 paper of A. Haar , [ 58 ] , and defined the notion of " Haar " ( or " semi - infinite " ) programs having the ...
5. lappuse
... topology are specified , see [ 5 ] . The power of semi - infinite programming stems from the close relationship to ordinary finite linear programming , where no topological considerations need be made . The simplex method [ 25 ] works ...
... topology are specified , see [ 5 ] . The power of semi - infinite programming stems from the close relationship to ordinary finite linear programming , where no topological considerations need be made . The simplex method [ 25 ] works ...
10. lappuse
... topology ( analysis ) and algebra . A quotation by Hardy [ 60 , APPENDIX IV The infinite in analysis and geometry ] describes the dichotomy : 6 " The infinite in analysis is a ' limiting and not an ' actual ' infinite . " Hardy goes on ...
... topology ( analysis ) and algebra . A quotation by Hardy [ 60 , APPENDIX IV The infinite in analysis and geometry ] describes the dichotomy : 6 " The infinite in analysis is a ' limiting and not an ' actual ' infinite . " Hardy goes on ...
15. lappuse
... topological nets . Definition 4.3 A net is an ordered triple ( Sa , a D , < ) = Sa , where S is a function on the ... topology of pointwise convergence . But an even more palatable characterization of asymptotic consistency for ( 1.2 ) ...
... topological nets . Definition 4.3 A net is an ordered triple ( Sa , a D , < ) = Sa , where S is a function on the ... topology of pointwise convergence . But an even more palatable characterization of asymptotic consistency for ( 1.2 ) ...
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 αΕΩ ΘΕΩ