Regularity Conditions for a Class of Convex Programs

This paper develops regularity conditions for a class of convex programming problems (convex objective functions and linear constraints). The objective functions considered are lower semicontinuous and have bounded level sets. The constraint set may be unbounded. Results pertaining to the solvabilit...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Management science Ročník 20; číslo 3; s. 373 - 377
Hlavný autor: Garstka, Stanley J
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Hanover, MD., etc INFORMS 01.11.1973
Institute of Management Sciences
Institute for Operations Research and the Management Sciences
Edícia:Management Science
Predmet:
Determinism
Mathematical duality
Mathematics
Objective functions
Polyhedrons
ISSN:0025-1909, 1526-5501
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This paper develops regularity conditions for a class of convex programming problems (convex objective functions and linear constraints). The objective functions considered are lower semicontinuous and have bounded level sets. The constraint set may be unbounded. Results pertaining to the solvability, stability and dualizability of such programs are obtained. The results are then applied to a class of nonlinear stochastic programs with recourse.
Bibliografia:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Statistics/Data Report-1
ISSN:0025-1909
1526-5501
DOI:10.1287/mnsc.20.3.373