Example: dental hygienist
Lecture 4 Linear Programming Models: Standard Form

Lecture 4 Linear Programming Models: Standard Form

Back to document page

Lecture 4 What are the basic solutions? • For a problem in the standard form a basic solution is a point ¯x = (¯x1,...,¯x n) that has at least n − m coordinates equal to 0, and satisfies all the equality constraints of the problem a11x¯1 + a12¯x2 + ··· + a1n¯x n = b1 a21x¯1 + a22¯x2 + ··· + a2n¯x n = b2 a m1¯x1 + a m2x¯2 + ··· + a mn¯x n = b m • If the point ¯x has ...

  Form

Download Lecture 4 Linear Programming Models: Standard Form


Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Related search queries