Dear Forum I am having trouble figuring out , how to handle a mixed system of constraints in a linear programming system; i.e. a mixture of ≤ and ≥? If anyone could help me figure this one out it would be greatly appreciated. Thanks , - AC-
Follow Math Help Forum on Facebook and Google+
Originally Posted by AlgebraicallyChallenged Dear Forum I am having trouble figuring out , how to handle a mixed system of constraints in a linear programming system; i.e. a mixture of ≤ and ≥? If anyone could help me figure this one out it would be greatly appreciated. Thanks , - AC- You convert them to all be of the same type by multiplying the ones you don't want by -1 which reverses the sense on the inequalities. CB
View Tag Cloud