Mechanical Engineering > GATE 2016 SET-1 > Linear Programming

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

Maximize Z = 15X₁ + 20X₂
subject to
12X₁ + 4X₂ ≥ 36
12X₁ - 6X₂ ≤ 24
X₁, X₂ ≥ 0
The above linear programming problem has

A

infeasible solution

B

unbounded solution

C

alternative optimum solutions

D

degenerate solution

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