The book also addresses linear programming duality theory and its use in algorithm ... lifting of valid inequalities, and branch and cut algorithms. Concepts and approaches are introduced by ...

Maths Linear Programming Formulas ... the variables are non-negative and satisfy a set of linear inequalities (called linear constraints). Variables are sometimes called decision variables ...

Perold, André, and R. Meidan. "Optimality Conditions and Strong Duality in Abstract and Continuous Time Linear Programming." Journal of Optimization Theory and Applications 40, no. 1 (May 1983): 61–76 ...