Mining Engineering > GATE 2020 > Linear Programming

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

A linear programming problem is stated below.
Maximize Z=3x₁+5x₂
subject to, 2x₁+x₂≤8
6x₁+8x₂≤30
x₁,x₂≥0
The objective function has

A

infinite number of solutions

B

unbounded solution

C

unique solution

D

infeasible solution

Check Answer

Explanation

Correct : c

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