Supply Chain Analytics XIBA April 2024

Enter your Registration Number

In linear programming, what does the objective function represent?

• The constraints of the problem

• The maximum or minimum value to be optimized

• The feasible region of the problem

• The decision variables of the problem

Which of the following methods is used to find the optimal solution in linear programming?

• Simplex method

• Gradient descent

• Random search

• Hill climbing

What type of problem is the Transportation Problem?

• Maximization problem

• Minimization problem

• Assignment problem

• Linear programming problem

In the transportation problem, what does the supply represent?

• Demand at each destination

• Cost of transportation between sources and destinations

• Amount of resources available at each source

• Total profit from transportation

Which algorithm is commonly used to solve the Assignment Problem?

• Dijkstra's algorithm

• Bellman-Ford algorithm

• Hungarian algorithm

• Kruskal's algorithm

The simplex method is an alternative approach to solving LPPs, particularly suitable for problems with:

• Only two decision variables

• A large number of variables and constraints

• Non-linear objective functions

• Minimizing resource usage

Which of the following is not a step in the Critical Path Method (CPM)?

• Activity Identification

• Activity Duration Estimation

• Network Diagram Construction

• Resource Allocation

In CPM, what does the critical path represent?

• The longest path through the network

• The shortest path through the network

• The path with the highest resource utilization

• The path with the lowest duration

PERT is better suited for projects with:

• Deterministic activity times

• Stochastic (uncertain) activity times

• Limited resources

• Large number of repetitive tasks