Register

GATE ME 2013 | Question: 36

• retagged by
0 votes
0 votes

A linear programming problem is shown below.

$\begin{array}{ll} \text{Maximize} & 3x + 7y \\ \text{Subject to} & 3x + 7y \leq 10 \\ & 4x + 6y \leq 8 \\ & x, y \geq 0 \end{array}$

It has

  1. an unbounded objective function.
  2. exactly one optimal solution.
  3. exactly two optimal solutions.
  4. infinitely many optimal solutions.
• retagged by

Please log in or register to answer this question.

← PreviousNext →
← Previous in categoryNext in category →
Answer:

Related questions

0 answers
0 votes
piyag476 asked Feb 19, 2017
GATE ME 2013 | Question: 3
Match the CORRECT pairs: ... $P-2; Q-1; R-3$ $P-3; Q-2; R-1$ $P-1; Q-2; R-3$ $P-3; Q-1; R-2$
Match the CORRECT pairs:$\begin{array}{llll} & \text{Numerical Integration Scheme} & & \text{Order of Fitting Polynomial} \\ P. & \text{Simpson's 3/8 Rule} & 1. & \text{F...
0 answers
0 votes
Arjun asked Feb 17, 2018
GATE2018-2-35
The problem of maximizing $z=x_1-x_2$ subject to constraints $x_1+x_2 \leq 10, \: x_1 \geq 0, x_2 \geq 0$ and $x_2 \leq 5$ has no solution one solution two solutions more than two solutions
The problem of maximizing $z=x_1-x_2$ subject to constraints $x_1+x_2 \leq 10, \: x_1 \geq 0, x_2 \geq 0$ and $x_2 \leq 5$ hasno solutionone solutiontwo solutionsmore tha...
0 answers
0 votes
Arjun asked Feb 24, 2017
GATE2016-1-55
Maximize $Z = 15X_1 + 20X_2$ subject to $\begin{array}{l} 12X_1 + 4X_2 \geq 36 \\ 12X_1 − 6X_2 \leq 24 \\ X_1, X_2 \geq 0 \end{array}$ The above linear programming problem has infeasible solution unbounded solution alternative optimum solutions degenerate solution
Maximize $Z = 15X_1 + 20X_2$ subject to $$\begin{array}{l} 12X_1 + 4X_2 \geq 36 \\ 12X_1 − 6X_2 \leq 24 \\ X_1, X_2 \geq 0 \end{array}$$The above linear programming pr...
Voting & Accepting an answer helps improve the community
Link Copied!