Operational ResearchTU Board 2024
Solve the following LP problems using the simplex method. Maximize z = 5x₁ + 3x₂ Subject to Constraints 2x₁ + x₂ ≤ 5 x₁ + x₂ ≤ 4 and x₁, x₂ ≥ 0
10A worked answer is on its wayMeanwhile, read the Operational Research notes for this topic.
Discussion
Loading…
More Operational Research questions
What is operational research? Explain the general method of solving or model. What are the limitations of operational research?TU Board 20255A company combines factor 1 and factor 2 to form a product, which weigh 100 kgs. At least 50KG of factor A and no more than 60KG of factor B. Should be used.…TU Board 20255Write Hungarian algorithm to solve the assignment problem.TU Board 20255Given the transportation framework, find the optimal transportation cost. From ↓ To→ABCDPlant capacityW32765000X75236000Y25452500Requirement6000400020001500TU Board 20255Discuss queuing process with suitable example of queuing model? Give its assumptions.TU Board 20255Write short notes on (Any two) a. Kendall's notation b. Types of inventory system. c. Importance and advantage of duality problem.TU Board 20255