(i) A linear programming problem must have a solution where the number of bindin

Question

(i) A linear programming problem must have a solution where the number of binding resource constraints equals the number of activities.

(ii) A nonlinear programming problem where the objective function is quadratic must have a solution where the number of binding resource and nonnegativity constraints equals the number of activities.

(iii) A linear programming problem must have a solution where the number of binding resource and nonnegativity constraints equals the number of activities.

Select one:

a. (i) is true.

b. Only (ii) is true.

c. Only (iii) is true.

d. (ii) and (iii) are true.

Explanation / Answer

A) (i ) is true

Solution will exist because then no of unknowns will be equal to no of equations

Related Questions

Navigate

• Browse (All)
• Browse #
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.