Mechanical Engineering > GATE 2014 SET-2 > Transportation Problems

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

If there are m sources and n destinations in a transportation matrix, the total number of basic variables in a basic feasible solution is

A

m + n

B

m + n + 1

C

m + n − 1

D

m

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