Mechanical Engineering > GATE 2013 SET-4 > Linear Programming
A linear programming problem is shown below.
Maximize 3x + 7y
Subject to
3x + 7y ≤ 10
4x + 6y ≤ 8
x, y ≥ 0
It has
A
an unbounded objective function.
B
exactly one optimal solution.
C
exactly two optimal solutions.
D
infinitely many optimal solutions.

Correct : b

Similar Questions

At the current basic feasible solution (bfs) v0 (v0 ∈ ℝ5), the simplex method yields the following form of a linear programming problem in standard form. min...
#196 MCQ
Which one of the options given represents the feasible region of the linear programming model: Maximize
#227 MCQ
A manufacturing unit produces two products P1 and P2. For each piece of P1 and P2, the table below provides quantities of materials M1, M2, and M3 required, a...
#361 MCQ

Related Topics

linear programming problem LPP optimal solution GATE Mechanical Engineering 2013 GATE ME 2013 Q46 maximize objective function infinitely many optimal solutions operations research linear programming constraints

Unique Visitor Count

Total Unique Visitors

Loading......

Question Options

Contributed by: