Consider the Linear Programming Problem \( P \): \[ \text{Minimize } 2x_1 - 5x_2 \] subject to \[ 2x_1 + 3x_2 + s_1 = 12, \] \[ -x_1 + x_2 + s_2 = 1, \] \[ -x_1 + 2x_2 + s_3 = 3, \] \[ x_1 \geq 0, x_2 \geq 0, s_1 \geq 0, s_2 \geq 0, \text{ and } s_3 \geq 0. \] If \[ \left[ \begin{array}{c} x_1 \\ s_1 \\ s_2 \\ s_3 \end{array} \right] \] is a basic feasible solution of \( P \), then \( x_1 + s_1 + s_2 + s_3 = \underline{\hspace{1cm}}. \)
Consider the Linear Programming Problem \( P \): \[ \text{Minimize } 2x_1 - 5x_2 \] subject to \[ 2x_1 + 3x_2 + s_1 = 12, \] \[ -x_1 + x_2 + s_2 = 1, \] \[ -x_1 + 2x_2 + s_3 = 3, \] \[ x_1 \geq 0, x_2 \geq 0, s_1 \geq 0, s_2 \geq 0, \text{ and } s_3 \geq 0. \] If \[ \left[ \begin{array}{c} x_1 \\ s_1 \\ s_2 \\ s_3 \end{array} \right] \] is a basic feasible solution of \( P \), then \( x_1 + s_1 + s_2 + s_3 = \underline{\hspace{1cm}}. \)
Show Hint
Correct Answer: 5
Solution and Explanation
Top GATE MA Linear Programming Questions
- Let \( y = (\alpha, -1)^T \), where \( \alpha \in \mathbb{R} \), be a feasible solution for the dual problem of the linear programming problem
Maximize: \( 5x_1 + 12x_2 \)
subject to: \[ x_1 + 2x_2 + x_3 \leq 10 \] \[ 2x_1 - x_2 + 3x_3 = 8 \] \[ x_1, x_2, x_3 \geq 0 \] Which of the following statements is TRUE?
- Let \( A \in \mathbb{R}^{m \times n}, c \in \mathbb{R}^n \) and \( b \in \mathbb{R}^m \). Consider the linear programming primal problem
\[ \text{Minimize: } c^T x \] \[ \text{subject to: } A x = b, \quad x \geq 0. \] Let \( x^0 \) and \( y^0 \) be feasible solutions of the primal and its dual, respectively. Which of the following statements are TRUE?
Three companies \( C_1, C_2 \) and \( C_3 \) submit bids for three jobs \( J_1, J_2 \) and \( J_3 \). The costs involved per unit are given in the table below: \[ \begin{array}{c|ccc} & J_1 & J_2 & J_3 \\ \hline C_1 & 10 & 12 & 8 \\ C_2 & 9 & 15 & 10 \\ C_3 & 15 & 10 & 9 \\ \end{array} \]
- The optimal value for the linear programming problem Maximize: \( 6x_1 + 5x_2 \) subject to: \[ 3x_1 + 2x_2 \leq 12 \] \[ -x_1 + x_2 \leq 1 \] \[ x_1, x_2 \geq 0 \] is __________.
A certain product is manufactured by plants \( P_1, P_2 \) and \( P_3 \) whose capacities are 15, 25, and 10 units, respectively. The product is shipped to markets \( M_1, M_2, M_3 \), and \( M_4 \), whose requirements are 10, 10, 10, and 20, respectively. The transportation costs per unit are given in the table below. \[ \begin{array}{|c|c|c|c|c|} \hline \text{Plant} & M_1 & M_2 & M_3 & M_4 \\ \hline P_1 & 1 & 3 & 1 & 15 \\ P_2 & 2 & 4 & 1 & 25 \\ P_3 & 2 & 1 & 2 & 10 \\ \hline \end{array} \] Then the cost corresponding to the starting basic solution by the Northwest-corner method is __________.
Top GATE MA Linear Programming Questions
- Let \( y = (\alpha, -1)^T \), where \( \alpha \in \mathbb{R} \), be a feasible solution for the dual problem of the linear programming problem
Maximize: \( 5x_1 + 12x_2 \)
subject to: \[ x_1 + 2x_2 + x_3 \leq 10 \] \[ 2x_1 - x_2 + 3x_3 = 8 \] \[ x_1, x_2, x_3 \geq 0 \] Which of the following statements is TRUE?
- Let \( A \in \mathbb{R}^{m \times n}, c \in \mathbb{R}^n \) and \( b \in \mathbb{R}^m \). Consider the linear programming primal problem
\[ \text{Minimize: } c^T x \] \[ \text{subject to: } A x = b, \quad x \geq 0. \] Let \( x^0 \) and \( y^0 \) be feasible solutions of the primal and its dual, respectively. Which of the following statements are TRUE?
Three companies \( C_1, C_2 \) and \( C_3 \) submit bids for three jobs \( J_1, J_2 \) and \( J_3 \). The costs involved per unit are given in the table below: \[ \begin{array}{c|ccc} & J_1 & J_2 & J_3 \\ \hline C_1 & 10 & 12 & 8 \\ C_2 & 9 & 15 & 10 \\ C_3 & 15 & 10 & 9 \\ \end{array} \]
- The optimal value for the linear programming problem Maximize: \( 6x_1 + 5x_2 \) subject to: \[ 3x_1 + 2x_2 \leq 12 \] \[ -x_1 + x_2 \leq 1 \] \[ x_1, x_2 \geq 0 \] is __________.
A certain product is manufactured by plants \( P_1, P_2 \) and \( P_3 \) whose capacities are 15, 25, and 10 units, respectively. The product is shipped to markets \( M_1, M_2, M_3 \), and \( M_4 \), whose requirements are 10, 10, 10, and 20, respectively. The transportation costs per unit are given in the table below. \[ \begin{array}{|c|c|c|c|c|} \hline \text{Plant} & M_1 & M_2 & M_3 & M_4 \\ \hline P_1 & 1 & 3 & 1 & 15 \\ P_2 & 2 & 4 & 1 & 25 \\ P_3 & 2 & 1 & 2 & 10 \\ \hline \end{array} \] Then the cost corresponding to the starting basic solution by the Northwest-corner method is __________.
Top GATE MA Questions
- No. of group homomorphism from Z4 to S4
- Number of finite non-isomorphic groups with exactly 3 conjugacy classes_____.
- f(x,y)=\(\left\{\begin{matrix} 1-cos(\frac{x^2}{y^2}) \\ \sqrt{x^2+y^2} \end{matrix}\right.\) ;if y≠0 & n∈R, then
- If ‘=’ denotes increasing order of intensity, then the meaning of the words [drizzle — rain — downpour] is analogous to [ — quarrel — feud]. Which one of the given options is appropriate to fill the blank?
- Statements: 1. All heroes are winners.
2. All winners are lucky people. Inferences: I. All lucky people are heroes.
II. Some lucky people are heroes.
III. Some winners are heroes. Which of the above inferences can be logically deduced from statements 1 and 2?