Notice: Payments for answers will end 4/10/2017. Click for more info.
You have new items in your feed. Click to view.
Q: explain the role of artificial variable in linear programming
A: In linear programming, a slack variable is required to turn an inequality into an equality where a linear combination of variables is less than or equal to a given constant in the former. [ As with the other variables in the augmented constraints, the slack variable cannot take on negative values, as the Simplex algorithm requires them to be positive or zero. - If the slack variable associated
with a constraint is zero in a given state, the constraint is binding, as the constraint restricts the possible changes of the point. - If a slack variable is positive in a given state, the constraint is non-binding, as the constraint does not restrict the possible changes of the point. - If a slack variable is negative in a given state, the point is infeasible, and not allowed, as it does not satisfy the constraint. ]
Sting|Points 1037|
Question
Asked 11/17/2012 3:59:46 PM
Rating

There are no new answers.

There are no comments.

*
Get answers from Weegy and a team of really smart lives experts.
S
L
Points 230 [Total 248] Ratings 0 Comments 160 Invitations 7 Offline
S
L
Points 130 [Total 130] Ratings 0 Comments 130 Invitations 0 Offline
S
L
R
Points 105 [Total 256] Ratings 1 Comments 5 Invitations 9 Offline
S
R
L
R
P
R
P
R
Points 66 [Total 734] Ratings 0 Comments 6 Invitations 6 Offline
S
1
L
L
P
R
P
L
P
P
R
P
R
P
R
P
P
Points 60 [Total 13327] Ratings 0 Comments 60 Invitations 0 Offline
S
L
1
R
Points 31 [Total 1447] Ratings 2 Comments 11 Invitations 0 Offline
S
Points 20 [Total 20] Ratings 1 Comments 0 Invitations 1 Offline
S
L
Points 10 [Total 187] Ratings 0 Comments 0 Invitations 1 Offline
S
Points 10 [Total 13] Ratings 0 Comments 10 Invitations 0 Offline
S
Points 10 [Total 10] Ratings 0 Comments 0 Invitations 1 Offline
* Excludes moderators and previous
winners (Include)
Home | Contact | Blog | About | Terms | Privacy | © Purple Inc.