An assignment problem can be solved by.
A. Simplex method
B. Transportation method
C. Both a & b
D. None of the above
Answer: Option C
Solution(By Examveda Team)
An assignment problem can be solved by Simplex method and Transportation method. The simplex method is a method for solving problems in linear programming. This method, invented by George Dantzig in 1947, tests adjacent vertices of the feasible set (which is a polytope) in sequence so that at each new vertex the objective function improves or is unchanged. The Transportation Method of linear programming is applied to the problems related to the study of the efficient transportation routes i.e. how efficiently the product from different sources of production is transported to the different destinations, such as the total transportation cost is minimum.Related Questions on Operations Research
A. Is possible when the variables value is known
B. Reduces the scope of judgement & intuition known with certainty in decision-making
C. Require the use of computer software
D. None of the above
A. Must be deterministic
B. Requires computer aid for its solution
C. Represents data in numerical form
D. All of the above
A physical model is example of.
A. An iconic model
B. An analogue model
C. A verbal model
D. A mathematical model
The qualitative approach to decision analysis relies on.
A. Experience
B. Judgement
C. Intuition
D. All of the above
Join The Discussion