Abstract
We propose a notion of dual problem for the inexact linear programming problem in general form. Weak and strong duality relations are discussed
Keywords:
∗Supported by Fondecyt, under grants 194-05-40 and 196-11-01, Fundación Andes and Bourse Dépcaternentale-UCL 95-96
∗Supported by Fondecyt, under grants 194-05-40 and 196-11-01, Fundación Andes and Bourse Dépcaternentale-UCL 95-96
Notes
∗Supported by Fondecyt, under grants 194-05-40 and 196-11-01, Fundación Andes and Bourse Dépcaternentale-UCL 95-96