Technical Note—Constraint Qualifications for Inexact Linear Programs

Abstract

By means of a new constraint qualification, we establish a duality theorem for inexact linear programs, complementing the results stated by Soyster, which, as shown by two examples, are not generally true without further assumptions. Qualifications are then discussed in this context.