𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Logarithmic SUMT limits in convex programming

✍ Scribed by Garth P. McCormick; Christoph Witzgall


Book ID
105748003
Publisher
Springer-Verlag
Year
2001
Tongue
English
Weight
224 KB
Volume
90
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Conjugacy in quasi-convex programming
✍ U. Passy; E. Z. Prisman πŸ“‚ Article πŸ“… 1984 πŸ› Springer-Verlag 🌐 English βš– 842 KB
Duality gap in convex programming
✍ T. Champion πŸ“‚ Article πŸ“… 2004 πŸ› Springer-Verlag 🌐 English βš– 160 KB
Sensitivity analysis in convex programmi
✍ P. JimΓ©nez Guerra; M.A. Melguizo; M.J. MuΓ±oz-Bouzo πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 536 KB

The object of this paper is to perform an analysis of the sensitivity for convex vector programs with inequality constraints by examining the quantitative behavior of a certain set of optima according to changes of right-hand side parameters included in the program. The results in the paper prove th

A theorem in convex programming
✍ William Karush πŸ“‚ Article πŸ“… 1959 πŸ› John Wiley and Sons 🌐 English βš– 558 KB

## System Develofiment Corporation S a n t a Monica, California An optimization problem which frequently a r i s e s in applications of mathematical programming is the following: t fn (xn)l , A 5x1' . . . Lx, 5 B where f i a r e convex functions. In this paper, the function F i s studied and show