For a salesman who has to visit n cities, following are the ways of his tour plan___.

Related MCQs

• Traveling salesman problem will have a total of _____different sequences.
• If the primal has an unbound objective function value then the other problem has ___________ .
• If primal linear programming problem has a finite solution, then dual linear programming problem should have____________.
• If an activity has zero slack, it implies that_________.
• A petrol pump has two pumps; Vehicles arrive at the petrol pump according to poison input process at average of 12 per hour. The service time follows exponential distribution with a mean of 4 minutes. The pumps are expected to be idle for _____.
• If the constraints of an Linear Programming Problem has an in equation of greater than or equal to type, the variable to be added to are ___________
• If the constraint of an Linear Programming Problem has an in equation of less than or equal to type, the variables to be added are__________
• If the primal problem has n constraints and m variables then the number of constraints in the dual problem is __________.
• Any solution to a Linear Programming Problem which also satisfies the non- negative notifications of the problem has _________.
• The initial event which has all outgoing arrows with no incoming arrow is numbered _____________.