1: What is the objective function in linear programming problems?
2: Which statement characterizes standard form of a linear programming problem?
3: Maximize z = 2 x + 7 y subject to
z = 2 x + 7 y
for non-negative x and y. Which of the following points are feasible: A(0,0), B(1,1), C(2,2)?
x
y
A(0,0), B(1,1), C(2,2)
A
B
C
4: Consider the constraint
Find the value of the slack variable s associated to this constraint for the point A(1,2,3).
s
A(1,2,3)
s = 8
s = 6
s = 0
s = -1
5: Maximize z = 3x for 0 <= x <= 5 . Find an optimal solution of the problem.
z = 3x
0 <= x <= 5
x = 0
x = 1
x = 3
x = 5
Your Results: