
At a Glance
392 Pages
24.13 x 16.51 x 2.54
Hardcover
$169.00
or 4 interest-free payments of $42.25 with
orShips in 5 to 7 business days
| Table of contents | p. vii |
| Preface | p. xiii |
| Acknowledgements | p. xvii |
| Main notations | p. xix |
| Non-connected convexity properties | p. 1 |
| The fields of non-connected convexity properties | p. 3 |
| Classical convexity for sets and the connectivity | p. 4 |
| Axiomatic convexity | p. 5 |
| Convexities defined by segmential methods | p. 9 |
| Convexity in non-linear structures | p. 10 |
| Convexity obtained by restricting the straight-line segment to a part of it | p. 13 |
| Convexity obtained by special straight-line segments | p. 14 |
| Convexity obtained by special conditions on straight-line segments | p. 15 |
| Convexity obtained by putting the straight-line segments in relation with special external points | p. 16 |
| Weak segmential approach | p. 17 |
| Unions of convex sets | p. 17 |
| Intersectional approach | p. 19 |
| Separational approach | p. 20 |
| Convexity with respect to a set | p. 23 |
| Types of convexity with respect to a given set | p. 24 |
| Properties of strong n-convex sets and of slack n-convex sets with respect to a given set | p. 28 |
| Properties of strong convex sets and of slack convex sets with respect to a given set | p. 30 |
| Topology with respect to a given set | p. 35 |
| The problem of best approximation | p. 41 |
| Separation of strong and slack convex sets | p. 44 |
| Integer convex sets and integer polyhedral sets | p. 47 |
| Convexity space with respect to a given set | p. 54 |
| Behaviours. Convexity with respect to a behaviour | p. 61 |
| The notion of behaviour | p. 62 |
| Properties of classes of behaviours | p. 69 |
| Sequences of behaviours | p. 75 |
| Convexity with respect to a behaviour | p. 79 |
| Convexity space | p. 83 |
| Approximation of the convexity | p. 86 |
| Convexity with respect to a set and two behaviours | p. 89 |
| Convexity with respect to a set and two behaviours. Definition and basic properties | p. 90 |
| Properties of sets that are convex with respect to a set and two behaviours in linear spaces | p. 95 |
| Examples | p. 101 |
| Approximation of the classical convexity property | p. 106 |
| Weak cases of convergence to the classical convexity | p. 110 |
| Convexities defined by means of distance functions | p. 113 |
| [alpha]-convex sets in metric spaces | p. 113 |
| ([alpha], [delta])-convexity with respect to a network | p. 115 |
| Particular plane case. Examples | p. 117 |
| Properties of ([alpha], [delta])--convex sets with respect to a network | p. 120 |
| The geometrical characterisation | p. 124 |
| Particular approximations of the classical convexity | p. 126 |
| Weak particular cases of convergence to the classical convexity | p. 130 |
| Induced convexity | p. 133 |
| Induced convexity | p. 134 |
| The element of (f, Y)-induced best approximation | p. 139 |
| Convexity defined by means of given functions | p. 143 |
| ([open phi], [psi])--convex sets | p. 143 |
| (k, g, h, M)--convex sets | p. 145 |
| (g, h, M)--convex sets | p. 151 |
| Classification of the convexity properties | p. 153 |
| The main elements and language conventions | p. 154 |
| Definitions and general remarks | p. 156 |
| The class of (S, s) convexity properties | p. 167 |
| The class of ((S, s), r) convexity properties | p. 185 |
| The class of special partial ((S, s), r) convexities | p. 192 |
| The class of (e, a) - ((S, S), r) convexities | p. 196 |
| The class of partial (a, e) - ((S, s), R) convexities | p. 208 |
| The class of (a, e) - ((S, s), R) convexities | p. 212 |
| The class of special partial (a, e) - ((S, S), R) convexities | p. 212 |
| The class of partial (a, e) - ((S, S), R) convexities | p. 214 |
| The class of (a, e) - ((S, S), R) convexities | p. 215 |
| The class of converted (a, e) - ((S, S), R) convexities | p. 218 |
| The class of (a, a) - ((S, S), R) convexities | p. 219 |
| The classification of convexities for sets. Table of classes | p. 220 |
| Remarks and problems related to the classification of the convexity properties for sets | p. 223 |
| Applications | p. 225 |
| Applications in pattern recognition | p. 227 |
| Digital convexity and its connection with various non-connected convexity properties | p. 227 |
| Measuring the concavity | p. 232 |
| The concavity coarseness | p. 236 |
| The concavity coarseness of some fractals | p. 240 |
| Construction of the convex hull and recognition of convex configurations | p. 242 |
| Alternative theorems and integer convex sets | p. 247 |
| Integer polyhedral sets and integer polyhedral sets with respect to Z[superscript n] | p. 247 |
| Existence theorems for linear homogenous integer systems | p. 251 |
| Theorems of alternative and discrete polyhedral sets | p. 257 |
| Various types of generalised convex functions | p. 263 |
| Linear functions, affine functions and convex functions with respect to a given set | p. 263 |
| Properties of convex functions with respect to a given set | p. 264 |
| Characterisation of convex function and strongly convex function with respect to a given set by divided differences | p. 266 |
| Optimum points of real strongly convex functions with respect to a given set | p. 269 |
| Duality theorems | p. 273 |
| Divided differences and generalized convex functionals in metric spaces | p. 278 |
| Applications in optimisation | p. 285 |
| d-bases | p. 285 |
| Simplexes and p--vertices | p. 299 |
| Characterisation of minimum (maximum) points of linear functions using d-bases | p. 304 |
| Characterisation of minimum (maximum) points of quasi-monotonic functions using d-bases | p. 306 |
| Efficient points and a-vertices | p. 308 |
| Applications in pharmaco-economics | p. 317 |
| Algorithm for determining min-efficient points | p. 318 |
| Application of min-efficient points to construct a medico--economic effectiveness index which characterises a vaccine | p. 321 |
| Application of min-efficient points to choose the best medico-economic drug | p. 323 |
| Algorithm for description of a preference relation between drugs | p. 327 |
| Multiple criteria programming used in medico-economic analysis of treatment protocols | p. 328 |
| References | p. 339 |
| Authors index | p. 355 |
| Subject index | p. 359 |
| Figures index | p. 363 |
| Tables index | p. 365 |
| Table of Contents provided by Syndetics. All Rights Reserved. |
ISBN: 9781402006241
ISBN-10: 1402006241
Series: APPLIED OPTIMIZATION
Published: 31st May 2002
Format: Hardcover
Language: English
Number of Pages: 392
Audience: General Adult
Publisher: Springer Nature B.V.
Country of Publication: US
Dimensions (cm): 24.13 x 16.51 x 2.54
Weight (kg): 0.72
Shipping
| Standard Shipping | Express Shipping | |
|---|---|---|
| Metro postcodes: | $9.99 | $14.95 |
| Regional postcodes: | $9.99 | $14.95 |
| Rural postcodes: | $9.99 | $14.95 |
Orders over $89.00 qualify for free shipping.
How to return your order
At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.
Additional postage charges may be applicable.
Defective items
If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.
For more info please visit our Help Centre.























