What is the "standard form" of a Linear Programming problem?

a) When constraints are written as inequalities

b) When constraints are written as equalities with non-negative variables

c) When all variables are integers

d) When the objective function is non-linear