The document describes a linear programming problem to maximize Z=100X1+150X2 subject to the constraints 8000X1+4000X2≤40000, 15X1+30X2≤200, and X1, X2≥0 and integer. It shows the relaxed solution is (2.22, 5.56) with an objective value of 1056. It then examines the integer solutions around this optimal point.
The document describes a linear programming problem to maximize Z=100X1+150X2 subject to the constraints 8000X1+4000X2≤40000, 15X1+30X2≤200, and X1, X2≥0 and integer. It shows the relaxed solution is (2.22, 5.56) with an objective value of 1056. It then examines the integer solutions around this optimal point.
The document describes a linear programming problem to maximize Z=100X1+150X2 subject to the constraints 8000X1+4000X2≤40000, 15X1+30X2≤200, and X1, X2≥0 and integer. It shows the relaxed solution is (2.22, 5.56) with an objective value of 1056. It then examines the integer solutions around this optimal point.