00:01
In this question, we have been asked which of the given is not a property of all linear programming problems.
00:07
Now, our options are a set of constraints, an objective to maximize or minimize the computer program, and a set of decision variables.
00:16
Now, note that if we have a linear programming problem, then it is of the type either maximize or minimize an objective function, which will be some linear programming problem.
00:31
Function of the variables.
00:35
So we can write it like this.
00:37
And this will be subject to a set of constraints.
00:46
So these will be linear, well, we won't write c1, maybe some other constant, maybe a1, x1, plus a2, x2, to an, xn will either have less than.
01:02
Or lesser equal or maybe just equal or greater than or greater than you're equal to some constant.
01:14
Maybe we'll have an inequality or an equation and we'll have more of them of that sort.
01:20
And in a linear programming problem, usually we have the non -negativity constraint as well...