Operations ResearchTU Board 2079
Solve the given Linear Programming Problem (LPP) by using simplex method and interpret the results. Minimize Z = 2A + 10B Subject to constraints: A + B = 50 A ≥ 20 B ≤ 40 Where, A, B ≥ 0
10A worked answer is on its wayMeanwhile, read the Operations Research notes for this topic.
Discussion
Loading…
More Operations Research questions
A milkman buys milk at Rs. 20 per litre and sells at Rs. 25 per litre. Unsold milk has to be thrown away. The daily demand has the following probability…TU Board 208110Determine the minimum transportation cost from the following matrix. StoresWarehouseP₁P₂P₃P₄SupplyCost per…TU Board 208110Solve the given linear programming problem (LPP) by using simplex method and interpret the findings. Min Z = 20A + 10B Subject to A + 2B ≤ 40 4A + 3B ≥ 60 3A…TU Board 208110There are three jobs P, Q and R to be completed on four machines A, B, C and D. The costs of performing the different jobs on different machines are given…TU Board 20815A TV repairman finds that the time spent on his job has an exponential distribution with mean 30 minutes. If he repairs sets in the order in which they come…TU Board 20815Assume that two firms are competing for market share for a particular product. Each firm is considering what promotional strategy to employ for the coming…TU Board 20815