linear program - (LP). Opt{cx: Ax = b, x >= 0}. (Other forms of the constraints are possible, such as Ax <= b.) The standard form assumes A has full row rank. Computer systems ensure this by having a logical variable (y) augmented, so the form appears as Opt{cx: Ax + y = b, L <= (x, y) <= U} (also allowing general bounds on the variables). The original variables (x) are called structural. Note that each logical variable can be a slack, surplus, or artificial variable, depending on the form of the original constraint. This computer form also represents a range constraint with simple bounds on the logical variable. Some bounds can be infinite (i.e., absent), and a free variable (logical or structural) is when both of its bounds are infinite. See my LP Short course, which includes a list of LP terms in this glossary, my compilation of web sites, and more. ;
дс тдрлими цюлютдажкию дроемжки аиакиохдйис лидр
http://carbon.cudenver.edu/~hgreenbe/glossary/L.html;
