𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Stability conditions for linear programming problems

✍ Scribed by S.A Ashmanov

Publisher
Elsevier Science
Year
1981
Weight
610 KB
Volume
21
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Optimality conditions for convex semi-in
Optimality conditions for convex semi-infinite programming problems
✍ A. Ben-Tal; L. Kerzner; S. Zlobec πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 923 KB

## Abstract This paper gives characterization of optimal Solutions for convex semiinfinite programming problems. These characterizations are free of a constraint qualification assumption. Thus they overcome the deficiencies of the semiinfinite versions of the Fritz John and the Kuhn‐Tucker theories

The Difference between Finite Dimensiona
The Difference between Finite Dimensional Linear Programming Problems and Infinite Dimensional Linear Programming Problems
✍ Tvu-Ying Ho; Yuung-Yih Lur; Soon-Yi Wu πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 161 KB

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