Mechanical Engineering > GATE 2013 SET-1 > Operations Research

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

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.

Check Answer

Explanation

Correct : b

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?

Question #23 Medium

Which operations on a binary search tree have O(h) complexity?

Question #31 Easy

Compare search complexities of sorted array vs balanced BST.

Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science