Internal Assessments

Program – MBA
Subject - Advanced Operation Research

Assessment Type – Internal Assessment (Subjective

Assignment)

Total Marks - 100

Guidelines:

 The response sheet should be in word format which should be uploaded in

the learning management system
 A plagiarism check should be done by student through plagiarism tool
provided in the learning management system
 Permissible plagiarized limit is 10%. Response sheet found with plagiarized
content above 10% would not be evaluated for the said assessment.
 The said assignment is for 100 marks with 5 questions each. (20 marks per
questions)
 Passing criteria is 50% for every assignment.

Questions:

1. Minimize
To minimize the expression X^2 + 3X^2 - 2XX - 6X - 8XX 2
+3X
2
−2XX−6X−8X, you can combine like terms:

X^2 + 3X^2 - 2XX - 6X - 8X = 4X^2 - 16XX

2
+3X
2
−2XX−6X−8X=4X
2
−16X
 Now, to find the minimum, take the derivative with respect to XX and set it
equal to zero:

8X - 16 = 08X−16=0

Solving for XX, you get X = 2X=2. Therefore, the minimum occurs at X = 2X=2.
2. You flip a fair, two-sided coin 100 times. Define a ‘run’ as a sequence of coin flips
with the same value (heads or tails). for example, the sequence HTTHH has 3
runs: the first H, then the TT block, then the HH block.

In order to approximate E(X) for a large number of coin flips n by envisioning

the process as a Markov Chain, let's consider the states and transitions
involved. We'll treat the Markov Chain as a model for the number of runs in
the sequence.

Define the state Sk as the number of runs observed after k flips. Since each
flip can either continue the current run or start a new run, we can model this
process as a Markov Chain with two states for each possible number of runs
after a given flip.

 If Sk=i, the next flip could either maintain the current run (stay in state i) or
start a new run (move to state i+1).
 If Sk=i+1, the next flip could either extend the current run (stay in state i+1)
or start a new run (move to state i+2).

In this way, we can set up a transition matrix P where Pij represents the
probability of moving from state i to state j.

Now, the expected number of runs after n flips, denoted as E(X), can be
approximated by the expected value of the final state Sn, which can be
expressed as a vector product E(X)=π⋅v, where π is the initial state
distribution and v is a column vector representing the final state.

To implement this, you would construct the transition matrix P, define the
initial state distribution π, and then calculate E(X) using matrix multiplication.
This approach provides a way to approximate the expected number of runs
using the principles of Markov Chains, which are particularly useful for
modeling random processes over time.
 Let X be the number of runs we observe in n flips. We’ve discussed how to find
E(X) using indicators. Now, approximate E(X) for large n by imagining this process
as a Markov Chain.
3. Distinguish between total covering problem and partial covering problem. Also,
discuss the related models.
Total Covering Problem: The Total Covering Problem is a type of
combinatorial optimization problem where the goal is to find a subset of
items from a given set that covers (or satisfies) all the constraints. In this
problem, each constraint must be covered by at least one item in the selected
subset. The objective is to minimize or maximize a certain function (e.g., cost,
distance) associated with the chosen subset. This problem arises in various
applications, such as facility location, network design, and resource allocation.

Partial Covering Problem: The Partial Covering Problem is a variant where

the goal is to cover as many constraints as possible with a limited subset of
items, rather than requiring all constraints to be covered. In this case, the
objective is typically to maximize the number of covered constraints, subject
to some constraints on the selected subset (e.g., limited budget or capacity).
Partial covering problems often appear in scheduling, project management,
and allocation scenarios.

Related Models:

1. Set Covering Problem:

 Type: Total Covering Problem
 Description: In the Set Covering Problem, the goal is to find the
smallest subset of sets (from a given collection) such that each element
from the universal set is covered by at least one selected set. It is a
classical NP-hard optimization problem with applications in logistics,
scheduling, and telecommunications.
2. Vertex Cover Problem:
 Type: Total Covering Problem
 Description: In the Vertex Cover Problem, the objective is to find the
smallest subset of vertices in a graph such that every edge in the graph
is incident to at least one vertex from the selected subset. Vertex cover
problems have applications in network design, facility location, and
resource allocation.
3. Maximum Coverage Problem:
 Type: Partial Covering Problem
 Description: The Maximum Coverage Problem involves selecting a
subset of items (e.g., advertisements, tasks) to maximize the coverage
 of a given set of constraints (e.g., audience, project requirements) while
adhering to certain limitations or constraints. This problem is common
in marketing, project management, and optimization of service delivery.
4. Knapsack Problem:
 Type: Partial Covering Problem
 Description: The Knapsack Problem involves selecting a subset of
items with given weights and values to maximize the total value,
subject to a constraint on the total weight (capacity) of the selected
items. This problem has applications in resource allocation, financial
portfolio optimization, and project scheduling.

In summary, the distinction between total covering and partial covering

problems lies in whether the goal is to satisfy all constraints or to maximize
the coverage within certain constraints. Various related models and problems
exist, each with its own set of applications and solution techniques.

4. a cargo-loading problem, there are four items of different per unit weight and
value as given below. The minimum cargo load is restricted to 10 units. How
many units of each item are loaded to maximize the value?

It seems that the specific values for the items' per unit weight and value are
missing from your question. In order to assist you with solving the cargo-
loading problem and determining the optimal number of units for each item
to maximize the value, I need information about the per unit weight and value
for each item.

Once you provide the necessary details, we can use mathematical

optimization techniques, such as linear programming, to formulate and solve
the problem. The objective is to maximize the total value subject to the
constraint that the cargo load is at least 10 units.

Please provide the per unit weight and value for each item, and I'll be happy
to help you with the solution.

5. Consider the details of the distance network as given below:

 a) Construct the distance network.
b) Find the shortest path from node 1 to node 9 using the systematic method.
It seems you're referring to a network or graph where nodes are connected by
edges with associated distances. However, the specific details of the nodes,
edges, and distances are not provided. To assist you in constructing the
distance network and finding the shortest path from node 1 to node 9 using a
systematic method, I'll provide a general explanation and steps. Please
provide the specific details if you want a more detailed response.

a) Constructing the Distance Network: A distance network is typically

represented as a graph, where nodes represent locations, and edges represent
connections between these locations with associated distances. Each edge has
a weight (distance) that reflects the cost of moving from one node to another.

b) Finding the Shortest Path: One systematic method to find the shortest
path between two nodes in a network is to use Dijkstra's algorithm. Here are
the general steps:

1. Initialization:
 Assign a tentative distance value to every node. Set the initial node's
distance to 0 and all other nodes' distances to infinity.
 Set the initial node as the current node.
2. Visit Neighbors:
 For the current node, consider all of its neighbors (nodes that can be
reached directly from the current node).
 For each neighbor, calculate the tentative distance from the initial node
through the current node.
 Compare the tentative distance to the current assigned value and
assign the smaller one.
3. Mark as Visited:
  After considering all neighbors of the current node, mark the current
node as visited.
 A visited node will not be checked again.
4. Select Next Node:
 Select the unvisited node with the smallest tentative distance as the
next "current node" and go back to step 2.
5. Finish:
 Repeat steps 2-4 until the destination node is visited or there are no
more unvisited nodes.
6. Shortest Path:
 Once the destination node is visited, the shortest path is the sequence
of nodes with the smallest tentative distances.

Please provide the details of the distance network (nodes, edges, and
distances) if you want a more specific application of these steps to your
problem.