Connections between generalized, inexact and semi-infinite linear programming
β Scribed by R. Tichatschke; R. Hettich; G. Still
- Publisher
- Springer
- Year
- 1989
- Tongue
- English
- Weight
- 498 KB
- Volume
- 33
- Category
- Article
- ISSN
- 0340-9422
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
For a min-max problem in the form of minxEx maxtET {A(X)}, the nondi\_fferentiability of the max function F(x) --maxtET {ft(x)} presents special difficulty in finding optimal solutions. We show that an entropic regularization procedure can provide a smooth approximation Fp(x) that uniformly converge
This paper studies the difference between finite-dimensional linear programming problems and infinite dimensional linear programming problems. We discuss a special class of continuous linear programming problems. We develop the structure of extreme points of feasible region for this problem. Under s
Two models of steady state brittle crack motion are commonly used. They are the models of Yoff6 (1) and of Craggs (2) (similar models have also been used by Barenblatt etc. of the Russian school). As is well known, Yoffr's model consists of a constant finite length crack moving with uniform velocity