𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimum norm problems over transportation polytopes

✍ Scribed by Achim Bachem; Bernhard Korte

Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
638 KB
Volume
31
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Nonlinear one-parametric linear programm
Nonlinear one-parametric linear programming and t-norm transportation problems
✍ Axel WΓΌstefeld; Uwe Zimmermann πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 572 KB

Previous methods for solving the nonlinear one-parametric linear programming problem min (c(r)'x IAx = b, x >/ 0) for f € b,PI were based on the simplex method using a considerably extended tableau. The proposed method avoids such an extension. A finite sequence of feasible bases (Bk I k = 1, 2, . .

Approximating minimum norm solutions of
Approximating minimum norm solutions of rank-deficient least squares problems
✍ Achiya Dax; Lars EldΓ©n πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 133 KB πŸ‘ 2 views

In this paper we consider the solution of linear least squares problems min x Ax -b 2 2 where the matrix A ∈ R mΓ—n is rank deficient. Put p = min{m, n}, let Οƒ i , i = 1, 2, . . . , p, denote the singular values of A, and let u i and v i denote the corresponding left and right singular vectors. Then

Solving minimum norm problems using pena
Solving minimum norm problems using penalty functions and the gradient method
✍ Stefen Hui; Walter E. Lillo; Stanislaw H. Ε»ak πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 827 KB

Algorithms for solving minimum norm problems are proposed using a penalty function approach and the gradient method. Numerical examples and computer simulations illustrate the results obtained.