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 76.
viii. lappuse
... FEASIBLE SET MAPPING IN CON- VEX SEMI - INFINITE PROGRAMMING 101 Marco A. López and Virginia N. Vera de Serio 1 Introduction 101 2 Preliminaries 103 3 A distance between convex functions 104 4 Stability properties of the feasible set ...
... FEASIBLE SET MAPPING IN CON- VEX SEMI - INFINITE PROGRAMMING 101 Marco A. López and Virginia N. Vera de Serio 1 Introduction 101 2 Preliminaries 103 3 A distance between convex functions 104 4 Stability properties of the feasible set ...
x. lappuse
... sets in separable normed spaces 262 Strong separation of finite sets in the Hadamard space 265 References 269 13 A ... feasibility result 277 Problem solution using an hybrid algorithm 281 Penalty computation via interval analysis 284 An ...
... sets in separable normed spaces 262 Strong separation of finite sets in the Hadamard space 265 References 269 13 A ... feasibility result 277 Problem solution using an hybrid algorithm 281 Penalty computation via interval analysis 284 An ...
xiv. lappuse
... feasible set ( M.A. López and V. Vera de Serio ) , and regularity and optimality conditions ( by A. Hassouni and W. Oettly , who also died during the preparation of this book ) . The remaining papers are focussed on different extensions ...
... feasible set ( M.A. López and V. Vera de Serio ) , and regularity and optimality conditions ( by A. Hassouni and W. Oettly , who also died during the preparation of this book ) . The remaining papers are focussed on different extensions ...
5. lappuse
... set Mm + 1 = convex cone { ( ~~ ) . Pi U -Ci ΕΙ The standard definition of the moment cone of ( 1.1 ) is convex cone ... feasible for the primal and dual programs . Then Hence , Ꭲ ut Po≥ Σcidi . ΕΙ vp > VD . ( 1.5 ) If the inequality ...
... set Mm + 1 = convex cone { ( ~~ ) . Pi U -Ci ΕΙ The standard definition of the moment cone of ( 1.1 ) is convex cone ... feasible for the primal and dual programs . Then Hence , Ꭲ ut Po≥ Σcidi . ΕΙ vp > VD . ( 1.5 ) If the inequality ...
6. lappuse
... set in the n - space and ( ii ) , the maximization of a linear functional in non - negative variables on a ... feasible solutions , [ 48 ] , constructed as infinite sequences were advanced to remove " duality gaps " in finite dimensional ...
... set in the n - space and ( ii ) , the maximization of a linear functional in non - negative variables on a ... feasible solutions , [ 48 ] , constructed as infinite sequences were advanced to remove " duality gaps " in finite dimensional ...
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 αΕΩ ΘΕΩ