TU Papers Notes

BCA 8th Semester
Operational Research 2025 Board Question Paper - Tribhuvan University (TU) 2025

Views: …
Tribhuvan University official logo

Tribhuvan University

Faculty of Humanities & Social Science
OFFICE OF THE DEAN
TUpapers.com TUpapers.com

Bachelor In Computer Application

Course Title: Operational Research

Code No: CAOR 451

Semester: VIII

Full Marks: 60 Pass Marks: 24 Time: 3 hours

Candidates are required to answer the question in their own words as far as possible.

Group B
Attempt any SIX question.
[6x5=30]
2.

What is operational research? Explain the general method of solving or model. What are the limitations of operational research?

3.

A 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. Factor 1 cost rupees 25 per kilogram and factor 2 cost rupees 10 per kilogram. Use the simplex method to find the amount of factor 1 and factor 2 which should be used to minimize the cost.

4.

Write Hungarian algorithm to solve the assignment problem.

5.

Given the transportation framework, find the optimal transportation cost.

From ↓ To→ABCDPlant capacity
W32765000
X75236000
Y25452500
Requirement6000400020001500

6.

Discuss queuing process with suitable example of queuing model? Give its assumptions.

7.

Write short notes on (Any two)
a. Kendall's notation
b. Types of inventory system.
c. Importance and advantage of duality problem.

8.

Food manufacturers Company 1 and Company 2 are competing for an increased market share. The payoff matrix shown in the following table describes the increase in market share for Company 1 and decrease in market share for Company 2. Determine optimal strategies for both the companies and the value of the game.

Company One.Company 2.
Give coupons.Decrease price.Maintain present strategy.Increase advertising.
Give coupons.2-241
Decrease price.61123
Maintain present strategy.-3206
Increase advertising.2-371

Group C

Attempt any TWO questions

[2x10=20]
9.

Solve the duality problem.
Minimize cost Z = 300X₁ + 800X₂
Subject to X₁ + X₂ = 200
X₁ ≤ 40
X₂ ≥ 30
and X₁, X₂ ≥ 0

10.

There are four workers for four tasks to be conducted. Workers have different efficiencies and the task have different difficulty levels. Estimate of profit in rupees for each person is given below. How the task should be allocated to each man so to maximize total earnings?

WorkersTask 1Task 2Task 3Task 4
A540205
B25353025
C15252010
D1553015

11.

a) Find the cost per period of individual replacement policy of an installation of 3000 light bulbs given in the following.
i. Cost of replacing an individual bulb is RS 20.
ii. Cumulative probability of failure is given below.

Months01234
Cumulative probability of failure.00.10.30.81

Calculate the number of light bulbs that would fail during each of the four months.
b) Write The algorithm for solving transportation problem and optimizing using MODI method.