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ženo v:
Podrobná bibliografie
Vydáno v:Management science Ročník 20; číslo 3; s. 373 - 377
Hlavní autor: Garstka, Stanley J
Médium: Journal Article
Jazyk:angličtina
Vydáno: Hanover, MD., etc INFORMS 01.11.1973
Institute of Management Sciences
Institute for Operations Research and the Management Sciences
Edice:Management Science
Témata:
Determinism
Mathematical duality
Mathematics
Objective functions
Polyhedrons
ISSN:0025-1909, 1526-5501
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
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.
Bibliografie: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