Mechanical Engineering > GATE 2014 SET-3 > Linear Programming
Consider an objective function Z(x1, x2) = 3x1 + 9x2 and the constraints
x1 + x2 ≤ 8,
x1 + 2x2 ≤ 4,
x1 ≥ 0, x2 ≥ 0.
The maximum value of the objective function is _______

Explanation

Correct : 17 to 19

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