Question

A general linear programming problem which is a maximization problem in two decision variables (x₁ and x₂) and two resource constraints (b₁, and b₂) can be set up in the following way:
A. Specify the inequality constraints also known as the resource constraints as a₁₁x₁+a₁₂x₂ ≤ b₁ and a₂₁x₁+ a₂₂x₂ <b₂ ; and non-negativity constraints: x₁ ≥0, x₂ ≥ 0. 
B. Solve the problem and plot the constraints on a graph in (x₁, x₂) space to define the feasible solution. 
C. Specify the criterion function which involves maximizing a linear function: max, z=c₁x₁+c₂x₂.
D. The optimal solutions given by \((\text{x}^*_{1},\text{x}^*_{2})\) can be used to find the maximum value of the objective function z*. 
Choose the correct answer from the options given below:

• A. D, A, B, C
• B. C, A, B, D
• C. C, B, D, A
• D. D, C, B, A

Answer 1

The Correct Option is B

The correct answer is (B) : C, A, B, D