Which of the following is a valid objective function for a linear programming problem?

In linear programming, objective function and objective constraints are:

Linear function Z= ax + by, where a, b are constants, which has to be maximised or minimized, is called a linear objective function.

In a LPP, the objective function is always ...........

True or false In an LPP, the objective function is always a linear function.

In a LPP, the maximum value of the objective function Z-ax+by is always finite.

The objective function is maximum or minimum at a point, which lies on the boundary of the feasible region .

Any feasible solution which maximises or minimises the objective function is called:

Fill ups If the feasible region for an LPP is unbounded, then the maximum or the minimum of the objective function………………. .

Fill ups In an LPP, if the objective function Z=ax+by has the same maximum value at two corner points of the feasible region then……………..on the line segment joining these two p oints gives the same………………value of he objective function.