Inexact linear programming with generalized resource sets
type: Item
instance of: scholarly article
title: Inexact linear programming with generalized resource sets
zbMATH Open document ID: 0405.90044
DOI: 10.1016/0377-2217(79)90227-3
author: K. Appert
published in: European Journal of Operational Research
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 52Bxx
zbMATH DE Number: 3630476
zbMATH Keywords: Inexact Linear Programming
zbMATH Keywords: Generalized Resource Sets
MaRDI profile type: Publication
full work available at URL: 0377-2217(79)90227-3
OpenAlex ID: W1989757706
cites work: Q5555406
cites work: On Representations of Semi-Infinite Programs which Have No Duality Gaps
cites work: On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
cites work: Technical Note—Exact Solutions of Inexact Linear Programs
cites work: Q4140014
cites work: Q3872231
cites work: Technical Note—Constraint Qualifications for Inexact Linear Programs
cites work: Q5638112
cites work: Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
cites work: Technical Note—A Duality Theory for Convex Programming with Set-Inclusive Constraints
description: scientific article; zbMATH DE number 3630476