DEPARTMENT : INFORMATION TECHNOLOGY

COURSE CODE : OIE352

COURSE NAME : RESOURCE MANAGEMENT TECHNIQUES

QUESTION BANK

2 MARKS

1. Define Linear Programming Problem.

• A Linear Programming Problem (LPP) is a mathematical optimization technique used
to allocate limited resources to meet specific demands or objectives.
• It involves maximizing or minimizing a linear objective function, subject to a set of
linear constraints.
2. Define optimum basic feasible solution.
An Optimum Basic Feasible Solution (OBFS) is a solution to a Linear Programming Problem
(LPP) that:

1. Satisfies all constraints: Meets all the given constraints and non-negativity conditions.
2. Is basic: Has the maximum number of zero variables (non-basic variables).
3. Is feasible: Has a non-negative objective function value.
4. Is optimal: Maximizes or minimizes the objective function value among all feasible solutions.
3. What is the difference between feasible solution and basic feasible solution?

feasible solution basic feasible solution

Satisfies all constraints (including non- Has the maximum number of zero variables
negativity conditions) (non-basic variables)
Has a non-negative objective function value Has a basic variable corresponding to each
constraint
4. What is Restricted Assignment?
A Restricted Assignment is a type of assignment problem where certain assignments are not
allowed or are restricted due to specific constraints or rules.

Key Characteristics

1. Constraints: Certain assignments are restricted due to constraints such as resource limitations,
compatibility issues, or regulatory requirements.
2. Assignment restrictions: Specific assignments are not allowed, and the solution must find
alternative assignments that satisfy the constraints.
5. Define Slack Variable.
• A Slack Variable is a variable added to a linear programming constraint to convert an
inequality constraint into an equality constraint.
 • The slack variable represents the amount of unused resources or the difference between
the left-hand side and right-hand side of an inequality constraint.
6. Differentiate balanced transportation problem & Unbalanced Transportation Problem.

balanced transportation problem Unbalanced Transportation Problem

The total supply from all sources equals the The total supply does not equal the total
total demand at all destinations. demand.
All supply is utilized, and all demand is met. There is either excess supply (slack) or
unmet demand (surplus).
Can be solved using the transportation Requires adjustments, such as adding dummy
simplex method or other specialized sources or destinations, to balance the
algorithms. problem before solving.
7. Why are Lagrange multipliers used in nonlinear optimization?
Lagrange multipliers are used in nonlinear optimization to:

1. Handle Constraints: Lagrange multipliers provide a way to incorporate constraints into the
optimization problem. They allow us to find the optimal solution that satisfies the constraints.
2. Convert Constrained Problem to Unconstrained Problem: By introducing Lagrange
multipliers, we can convert a constrained optimization problem into an unconstrained problem.
This makes it easier to find the optimal solution.
8. List out the assumptions and requirements of LPP.
Assumptions:

1. Linearity: The objective function and all constraints are linear.

2. Divisibility: The decision variables can take on any fractional value.
3. Certainty: All coefficients and constants are known with certainty.
4. Non-Negativity: Decision variables are non-negative.

Requirements:

1. Clear Objective: A well-defined objective function to be maximized or minimized.

2. Constraints: A set of constraints that limit the values of the decision variables.
3. Decision Variables: A set of variables that are adjusted to achieve the optimal solution.
4. Coefficients and Constants: Numerical values for the coefficients and constants in the
objective function and constraints.
9. State the applications of Linear programming problem.
Applications of Linear Programming Problems (LPP)

Linear Programming Problems have numerous applications in various fields, including:

1. Resource Allocation: Allocating resources such as labor, materials, and equipment to

maximize efficiency.
2. Production Planning: Determining the optimal production levels, inventory levels, and
resource allocation.
3. Supply Chain Management: Optimizing the flow of goods, services, and information from
raw materials to end customers.
4. Financial Planning: Creating optimal investment portfolios, managing risk, and maximizing
returns.
10. Identify the advantages of duality.
Advantages of Duality
 1. Alternative Solution Method: Duality provides an alternative method to solve linear
programming problems, which can be useful when the primal problem is difficult to solve.
2. Insight into Primal Problem: The dual problem provides valuable insights into the primal
problem, such as the sensitivity of the optimal solution to changes in the coefficients.
11. Classify the types of Integer Programming Problems.
Integer Programming Problems (IPPs) can be classified into several types based on their
characteristics and applications.

1. Zero-One Integer Programming

- Decision variables are binary (0 or 1)

2. General Integer Programming

- Decision variables are integers

3. Mixed-Integer Programming (MIP)

- Combination of integer and continuous variables

4. Binary Integer Programming (BIP)

- Special case of zero-one integer programming

5. Nonlinear Integer Programming (NLIP)

- Objective function or constraints are nonlinear

12. Outline the phases of transportation model.
Phases of Transportation Model

1. Formulation Phase: Define the transportation problem, identify the sources, destinations, and
transportation costs.

2. Finding an Initial Basic Feasible Solution (IBFS) Phase: Determine an initial solution that
satisfies all the constraints, using methods like North-West Corner, Least Cost, or Vogel's
Approximation.

3. Testing for Optimality Phase: Check if the current solution is optimal by evaluating the
opportunity cost of each non-basic variable.
13. Briefly discuss duality in linear programming
Duality is a fundamental concept in linear programming that establishes a relationship between
two related linear programming problems: the primal problem and its dual problem.

Key Points

1. Primal Problem: The original linear programming problem that seeks to optimize an objective
function subject to constraints.
2. Dual Problem: A related linear programming problem derived from the primal problem,
which has its own objective function and constraints.
14. State the objectives of Lagrangian method.
Objectives of Lagrangian Method
 The Lagrangian method is used to solve constrained optimization problems. The primary
objectives of the Lagrangian method are:

1. Convert Constrained Problem to Unconstrained Problem: The Lagrangian method transforms

a constrained optimization problem into an unconstrained problem by introducing Lagrange
multipliers.

2. Find the Optimal Solution: The method aims to find the optimal solution that satisfies the
constraints and optimizes the objective function.
15. Define Stage in dynamic programming.
• In Dynamic Programming, a Stage refers to a specific point or step in the decision-
making process.
• It represents a particular phase or period in which a decision is made, and its outcome
affects the subsequent stages.
16. Outline the benefits of CPM.
1. Improved Project Planning: CPM helps create a detailed project schedule, identifying all
tasks, dependencies, and timelines.

2. Enhanced Resource Allocation: By identifying the critical path, resources can be allocated
more efficiently, ensuring that critical tasks receive the necessary resources.
17. Define Integer Programming.
• Integer Programming (IP) is a type of mathematical optimization technique used to
solve problems where some or all of the decision variables are restricted to integer
values.
• Integer Programming is a powerful tool for solving complex optimization problems
with integer decision variables. Its applications are diverse, and its solution methods
continue to evolve.
18. List out the common applications of Integer Programming.
Common Applications of Integer Programming

1. Scheduling: Scheduling jobs, tasks, or projects to optimize resource utilization and minimize
delays.

2. Resource Allocation: Allocating limited resources, such as personnel, equipment, or budget,

to optimize performance and efficiency.

3. Network Optimization: Optimizing network flows, routing, and design to minimize costs and
maximize efficiency.
19. List out the applications of Multistage Dynamic Programming.
Applications of Multistage Dynamic Programming

1. Resource Allocation: Allocating resources over multiple stages to maximize efficiency and
minimize costs.

2. Production Planning: Determining optimal production levels, inventory, and resource

allocation over multiple stages.

3. Inventory Control: Managing inventory levels over multiple stages to minimize costs and
maximize service levels.
20. Define Dummy activity.
 • A dummy activity is a fictional or artificial activity used in network diagrams,
particularly in Critical Path Method (CPM) and Program Evaluation and Review
Technique (PERT).
• By using dummy activities, project managers can create a more accurate and logical
network diagram, which helps in planning, scheduling, and controlling the project.
21. Recall the significance of Tucker conditions.
Tucker conditions, also known as the Kuhn-Tucker conditions or the Karush-Kuhn-Tucker
(KKT) conditions, are necessary conditions for a solution to be optimal in a nonlinear
programming problem.

Key Significance:

1. Optimality Conditions: Tucker conditions provide a set of mathematical conditions that must
be satisfied at an optimal solution.
2. Necessary but not Sufficient: Tucker conditions are necessary conditions for optimality, but
they are not sufficient conditions.
22. How would you compare CPM and PERT?

CPM PERT
Focuses on determining the critical path and Focuses on managing uncertainty and risk by
minimizing project duration. estimating activity durations
probabilistically.
Uses deterministic duration estimates. Uses probabilistic duration estimates
(optimistic, most likely, pessimistic).
Suitable for projects with well-defined Suitable for projects with uncertain activity
activities and dependencies. durations and dependencies.
23. Interpret the four conditions of Tucker.
The four conditions are used to determine the optimal solution of a constrained optimization
problem.

Condition 1: Primal Feasibility

The first condition states that the solution must satisfy all the constraints of the problem,
including equality and inequality constraints.

Condition 2: Dual Feasibility

The second condition states that the Lagrange multipliers (dual variables) associated with the
inequality constraints must be non-negative.

Condition 3: Complementary Slackness

The third condition states that for each inequality constraint, either the constraint is satisfied as
an equality (i.e., the constraint is binding), or the corresponding Lagrange multiplier is zero.

Condition 4: Stationarity

The fourth condition states that the gradient of the Lagrangian function with respect to the
decision variables must be zero at the optimal solution.

24. What inference can you make of Zero Total Float?

 Zero Total Float indicates that an activity is on the critical path of a project. This means that:

1. No Slack: The activity has no buffer time or slack, and any delay will directly impact the
project completion date.
2. Critical to Project Timeline: The activity is crucial to the project timeline, and its completion
is essential to meet the project deadline.
3. High Priority: Activities with zero total float should be given high priority, as any delays or
issues will have a direct impact on the project timeline.
25. Define an unbalanced transportation problem.

An unbalanced transportation problem is a type of transportation problem where:

1. Supply does not equal Demand: The total supply available at the sources (origins) does not
equal the total demand required at the destinations (sinks).
2. Excess Supply or Demand: There is either excess supply at the sources or excess demand at
the destinations, which needs to be balanced to solve the problem.
26. State Newton’s method.
• Newton's method is an iterative technique used to find the roots (or zeros) of a real-
valued function.
• It's a powerful method for solving nonlinear equations. Newton's method converges
rapidly, often in just a few iterations.

27. What is integer linear programming?

• Integer Linear Programming (ILP) is a type of mathematical optimization technique

used to solve problems.
• ILP models are solved using specialized algorithms and software, such as branch and
bound, cutting plane methods, and integer programming solvers.
28. Recall the main idea of Slack.

•Slack refers to the amount of time an activity can be delayed without affecting the
overall project timeline.
• By understanding slack, project managers can identify areas where delays can be
accommodated without impacting the project timeline.
29. What are the Karush-Kuhn-Tucker (KKT) conditions in optimization?

• The Karush-Kuhn-Tucker (KKT) conditions are a set of necessary conditions for a

solution to be optimal in a nonlinear programming problem.

• The KKT conditions are widely used in optimization algorithms and are a fundamental
tool in nonlinear programming.
30. Define Total float.
• Total float, also known as slack, is the amount of time an activity can be delayed
without affecting the overall project timeline.
• Total float is calculated as the difference between the late start and early start dates of
an activity, or as the difference between the late finish and early finish dates.

13 MARKS

1. Explain the graphical method in Linear programming with a suitable example.

Graphical Method in Linear Programming

The graphical method is a visual technique used to solve linear programming problems with two
variables. It involves graphing the constraints and the objective function on a coordinate plane to find
the feasible region and the optimal solution.

Steps to Solve a Linear Programming Problem Using the Graphical Method

1. Define the variables: Identify the decision variables and their units.
2. Write the objective function: Define the objective function to be maximized or minimized.
3. Write the constraints: Define the constraints that limit the values of the decision variables.
4. Graph the constraints: Plot the constraints on a coordinate plane.
5. Identify the feasible region: Determine the area that satisfies all the constraints.
6. Graph the objective function: Plot the objective function on the same coordinate plane.
7. Find the optimal solution: Identify the point in the feasible region that maximizes or minimizes the
objective function.

Example

Suppose a company produces two products, A and B, using two machines, X and Y. The production
process is limited by the availability of machine time. The company wants to maximize its profit.

Data

| Product | Machine X (hours) | Machine Y (hours) | Profit ($/unit) |

| --- | --- | --- | --- |
| A | 2 | 1 | 10 |
| B | 1 | 2 | 15 |

Constraints

1. Machine X: 2A + B ≤ 12
2. Machine Y: A + 2B ≤ 12
3. Non-negativity: A ≥ 0, B ≥ 0

Graphical Solution

1. Graph the constraints on a coordinate plane.

2. Identify the feasible region, which is the area bounded by the constraints.
3. Graph the objective function: Profit = 10A + 15B.
4. Find the optimal solution by identifying the point in the feasible region that maximizes the
objective function.

Optimal Solution

The optimal solution is found at the intersection of the constraints Machine X and Machine Y.

A = 4, B = 4

The maximum profit is:

 Profit = 10(4) + 15(4) = 40 + 60 = 100

Therefore, the company should produce 4 units of Product A and 4 units of Product B to maximize its
profit.

Advantages and Limitations of the Graphical Method

Advantages

1. Visual representation: The graphical method provides a visual representation of the problem,
making it easier to understand.
2. Easy to solve: The graphical method is easy to apply for small problems with two variables.

Limitations

1. Limited to two variables: The graphical method is limited to problems with two variables.
2. Difficult to solve large problems: The graphical method becomes impractical for large problems
with many variables and constraints.
2. Maximize: 𝑍 = 3𝑥 + 4𝑦
Subject to
2𝑥 + 5𝑦 ≤ 60,
4𝑥 + 2𝑦 ≤ 40,
𝑥, 𝑦 > 0.
Solve by Graphical Method:
(i) Plot the graph
(ii) Obtain the optimal solution

Solution:
Graph Plot and Calculations
To generate the graph and calculate the corner points and optimal solution.

The graph above shows the constraint lines and the feasible region (shaded in gray).
3. Solve the following LPP by graphical method.
Maximize Z= 3𝑥1 + 5𝑥2
Subject to
−3𝑥1 + 4𝑥2 ≤ 12
𝑥1 ≤ 4
2𝑥1 − 𝑥2 ≤ −2
2𝑥1 + 3𝑥2 ≥ 12
𝑥1, 𝑥2 ≥ 0

Solution:
4. Solve the given problem by Simplex method.
Minimize Z = 5X1+3X2
Subject to
2X1+4X2 ≤ 12
2X1+2X2 = 10
5X1 + 2X2 ≥ 10
and
X1 , X2 ≥ 0

Solution:
5. Apply simple algorithm to solve the following LPP using Simplex method:
𝑀𝑎𝑥𝑖𝑚𝑖𝑧𝑒 𝑍 = 10𝑥1 + 15𝑥2 + 20𝑥3
Subject to
2𝑥1 + 4𝑥2 + 6𝑥3 ≤ 24
3𝑥1 + 9𝑥2 + 6𝑥3 ≤ 30
𝑥1, 𝑥2, 𝑥3 ≥ 0

Solution:
Given that,
Maximize Z = 10x1 + 15x2 + 20x3
Subject to,
2x1 + 4x2 + 6x3 ≤24
3x1 + 9x2 + 6x3 ≤ 30
x1, x2 and x3 ≥0

Standardization
Maximize = 10x1 + 15x2 + 20x3 + 0s1 + 0s2
Subject to,
2x1 + 4x2 + 6x3 + s1 = 24
3x1 + 9x2 + 6x3 + s2 = 30
x1, x2, x3, s1, s2 ≥ 0
Initial Solution
Let, x1 = 0 x2 = 0, x3 = 0,
we get,
s1 = 24, s2 = 30
Develop initial simplex table
Basic variables : S1, S2
Calculation of Zj : ΣC B Xij
Index row : Cj – Zj

Since, Cj – Zj value is highest for ‘x3’, thus enter the

basis through x3 and leaves through ‘s1’ as it has lowest
minimum ratio of ‘4’.
Iteration - I
 Since ‘Cj – Zj’ value is highest for ‘x1’, thus enter
the basis for ‘x1’ and leaves through ‘s2’ as it has lowest
minimum ratio of ‘6’.

Since, all ‘Cj – Zj’ values are ≤ 0, thus the

optimality reached with,
x1 = 6, x2 = 0, x3 = 2
Substituting the values of x1 and x2, x3, in the objective
function.
Max Z = 10X1 + 15 X2 + 20 X3
= 10 (6) + 15 (0) + 20 (2)
= 60 + 0 + 40
= 100

6. How does dual simplex method differ from the simplex method? Explain.

The dual simplex method and the simplex method are two closely related approaches for solving linear
programming (LP) problems, but they differ in their starting conditions, mechanics, and areas of application.
Here's an explanation of how they differ:
1. Starting Feasibility
• Simplex Method:
o Begins with a feasible solution to the primal problem (i.e., all constraints are satisfied, and all
basic variables are non-negative).
o Iteratively improves the objective function by moving along the edges of the feasible region.
• Dual Simplex Method:
o Begins with an infeasible solution to the primal problem but a feasible dual solution.
o Iteratively works to restore primal feasibility while maintaining dual feasibility.

2. Main Idea
• Simplex Method:
o Focuses on improving the objective function by selecting an entering variable (most negative
coefficient in the objective row) and adjusting the basis to maintain feasibility.
• Dual Simplex Method:
o Focuses on restoring feasibility in the primal problem by selecting a leaving variable (most
negative value in the RHS column) while ensuring the dual constraints remain satisfied.

3. When to Use
• Simplex Method:
o Used when a feasible initial basic solution is available.
o Ideal for primal problems where constraints are already satisfied.
• Dual Simplex Method:
o Used when an initial feasible solution is difficult to find or when a feasible dual solution is
already available.
o Particularly useful when solving problems where constraints are updated or a solution is
perturbed slightly (e.g., in sensitivity analysis).

4. Iteration Criteria
• Simplex Method:
o At each step, the entering variable is chosen based on the most negative reduced cost (objective
coefficient), and the leaving variable is chosen to maintain feasibility (minimum ratio test).
• Dual Simplex Method:
o At each step, the leaving variable is chosen based on the most negative value in the RHS
column (indicating infeasibility), and the entering variable is chosen to maintain dual
feasibility.

5. Computational Application
• Simplex Method:
o More commonly used for solving standard LP problems.
• Dual Simplex Method:
o Commonly used in cases where the constraints or the solution space have been perturbed (e.g.,
adding new constraints or removing old ones). It is efficient for re-optimization problems.

6. Geometric Interpretation
• Simplex Method:
o Moves along the edges of the feasible region of the primal problem, improving the objective
function at each vertex.
• Dual Simplex Method:
o Moves along the edges of the dual feasible region while working to restore primal feasibility.
7. Consider the linear programming model given below and solve it using the simplex method.
Maximize 𝑍 = 3𝑥1 + 2𝑥2 + 5𝑥3
Subject to
𝑥1 + 2𝑥2 + 𝑥3 ≤ 430
3𝑥1 + 2𝑥3 ≤ 260
𝑥1 + 4𝑥2 ≤ 420
𝑥1, 𝑥2, 𝑥3 ≥ 0
(i) Evaluate the simplex table
(ii) Obtain the optimal solution

Solution:
8. Analyze and find the Transportation Problem by suitable method that you will select to Minimize Cost?
Destination
Source 1 2 3 4 Supply
I 21 16 25 13 11
II 17 18 14 23 13
III 32 27 18 41 19
Demand 6 10 12 15

Solution:

Step 1: Select a suitable method to solve the transportation problem.

To minimize the cost, we I will use the Northwest Corner Method to find an initial basic feasible solution,
followed by the Stepping Stone Method to find the optimal solution.

Step 2: Create a transportation table.

Create a table with the given data:

| Destination | Source 1 | Source 2 | Source 3 | Supply |

| --- | --- | --- | --- | --- |
| 1 | 21 | 16 | 25 | 6 |
| 2 | 17 | 18 | 14 | 10 |
| 3 | 32 | 27 | 18 | 12 |
| 4 | 13 | 23 | 41 | 15 |
| Demand | 6 | 10 | 12 | 15 |

Step 3: Apply the Northwest Corner Method.

Allocate the supply to the demand as follows:

| Destination | Source 1 | Source 2 | Source 3 | Supply |

| --- | --- | --- | --- | --- |
|1|6|0|0|6|
| 2 | 0 | 10 | 0 | 10 |
| 3 | 0 | 0 | 12 | 12 |
| 4 | 5 | 0 | 10 | 15 |
| Demand | 6 | 10 | 12 | 15 |

Step 4: Calculate the total cost of the initial basic feasible solution.
The total cost is:

21(6) + 18(10) + 18(12) + 13(5) + 41(10) = 126 + 180 + 216 + 65 + 410 = 997

Step 5: Apply the Stepping Stone Method to find the optimal solution.
After applying the Stepping Stone Method, we get the optimal solution as follows:

| Destination | Source 1 | Source 2 | Source 3 | Supply |

| --- | --- | --- | --- | --- |
|1|6|0|0|6|
| 2 | 0 | 0 | 10 | 10 |
| 3 | 5 | 7 | 0 | 12 |
| 4 | 0 | 3 | 12 | 15 |
| Demand | 6 | 10 | 12 | 15 |

Step 6: Calculate the total cost of the optimal solution.

The total cost is:

21(6) + 14(10) + 27(7) + 18(5) + 13(3) + 41(12) = 126 + 140 + 189 + 90 + 39 + 492 = 1076

However, this solution is still not optimal.

Step 7: Re-examine the transportation table to find the final optimal solution.
After re-examining the transportation table, we get the final optimal solution as follows:

| Destination | Source 1 | Source 2 | Source 3 | Supply |

| --- | --- | --- | --- | --- |
|1|6|0|0|6|
| 2 | 0 | 0 | 10 | 10 |
| 3 | 0 | 12 | 0 | 12 |
| 4 | 5 | 0 | 10 | 15 |
| Demand | 6 | 10 | 12 | 15 |
 Step 8: Calculate the total cost of the final optimal solution.
The total cost is:

21(6) + 14(10) + 27(12) + 13(5) + 41(10) = 126 + 140 + 324 + 65 + 410 = 1065.

9. Analyze the solution of the following LPP by using dual simplex method:
Maximize Z= 3𝑥1 − 𝑥2
Subject to
𝑥1 + 𝑥2 ≥ 1
2𝑥1 + 3𝑥2 ≥ 2
𝑥1, 𝑥2 ≥ 0

Solution:
10. Solve the given transportation problem using VAM.
D1 D2 D3 D4 Supply

O1 11 13 17 14 250

O2 16 18 14 10 300

O3 21 24 13 10 400

Demand 200 225 275 250

Solution:

Step 1: Applying VAM

1. Step 1: Calculate Penalties
The penalty is calculated as the difference between the smallest and the second smallest values in each
row and column.
11. The assignment cost of assigning any one operator to any one machine is given in the following table.
Operations
A B C D
10 5 13 15
Machine 3 9 18 3
10 7 3 2
5 11 9 7
Find the optimal assignment by Hungarian method

Solution:

Let's solve the assignment problem using the Hungarian Method step by step.
Assignment Cost Matrix:
Step 1: Subtract Row Minimums
1. Row 1:
o 10,5,13,15→ Minimum = 5
o Subtract from each element:
▪ 10−5=5
▪ 5−5=0
▪ 13−5=8
▪ 15−5=10
2. Row 2:
o 3,9,18,3→ Minimum = 3
o Subtract from each element:
▪ 3−3=0
▪ 9−3=6
▪ 18−3=15
▪ 3−3=0
3. Row 3:
o 10,7,3,2→ Minimum = 2
o Subtract from each element:
▪ 10−2=8
▪ 7−2=5
▪ 3−2=1
▪ 2−2=0
4. Row 4:
o 5,11,9,7→ Minimum = 5
o Subtract from each element:
▪ 5−5=0
▪ 11−5=6
▪ 9−5=4
▪ 7−5=2

Step 2: Subtract Column Minimums

1. Column 1:
o 5,0,8,0 → Minimum = 0
o Already subtracted, no further subtraction needed.
2. Column 2:
o 0,6,5,6 → Minimum = 0
o Already subtracted, no further subtraction needed.
3. Column 3:
 8,15,1,4 → Minimum = 1
o
o
Subtract from each element:
▪ 8−1=7
▪ 15−1=14
▪ 1−1=0
▪ 4−1=3
4. Column 4:
o 10,0,0,2 → Minimum = 0
o Already subtracted, no further subtraction needed.

Step 3: Check for Optimal Assignment

Now, the reduced matrix looks like this:

Step 4: Assignment
• Assign (1, B): 0
• Assign (2, D): 3
• Assign (3, C): 0
• Assign (4, D): 2
Thus, the optimal assignments are:
• Machine B is assigned to Operator 1
• Machine D is assigned to Operator 2
• Machine C is assigned to Operator 3
• Machine D is assigned to Operator 4
Step 5: Total Minimum Cost
The total minimum cost is:
0+3+0+2=5
Thus, the optimal assignment with the minimum cost is:
• Machine B to Operator 1 with cost 0
• Machine D to Operator 2 with cost 3
• Machine C to Operator 3 with cost 0
• Machine D to Operator 4 with cost 2
Total cost = 5

12. Write the steps of Cutting Plane algorithm in detail.

Steps of the Cutting Plane Algorithm

The Cutting Plane Algorithm is an iterative method used to solve Integer Linear Programming (ILP) problems. The
method involves solving a linear programming relaxation of the problem and then refining the solution by adding valid
inequalities (cutting planes) until an integer solution is found.
Steps of the Cutting Plane Algorithm:
13. Analyze & solve the following transportation problem to maximize profit.
Source A B C D Supply
1 15 51 42 33 23
2 80 42 26 81 44
3 90 40 66 60 33
Demand 23 31 16 30 100
(i) Examine Initial solution using VAM
(ii) Analyze and find out the final Solution by using MODI Method.

Solution:
14. Discuss the advantages and disadvantages of the Branch and Bound method.
 Branch and Bound is a popular algorithm used for solving combinatorial optimization problems, such as Integer
Linear Programming (ILP) and other discrete optimization problems. Below are its advantages and
disadvantages:
Advantages of Branch and Bound Method:
1. Guaranteed Optimal Solution:
o Branch and Bound guarantees the global optimal solution by exploring all feasible regions and bounding
infeasible ones.
2. Flexibility:
o It can handle various types of problems, including integer programming, combinatorial optimization, and
knapsack problems.
3. Systematic Approach:
o The method systematically narrows down the feasible region by branching and applying bounds,
ensuring no potential solution is overlooked.
4. Effective in Reducing Search Space:
o By eliminating branches where the objective function exceeds the best known solution, it reduces the
search space, making the method efficient.
5. Useful for Complex Problems:
o Suitable for large and complex optimization problems where direct solution methods may be infeasible
due to high-dimensional solution spaces.
6. Ease of Implementation:
o The method is intuitive to understand, especially for problems structured in a hierarchical manner, such
as decision trees.

Disadvantages of Branch and Bound Method:

1. High Computational Complexity:
o As the size of the problem grows, the computational effort increases exponentially. This can lead to very
long processing times for large-scale problems.
2. Memory Intensive:
o The method requires significant amounts of memory to store intermediate solutions and to manage the
search tree, which may not be feasible for large problems.
3. Recursive Nature:
o The recursive nature of branching can lead to inefficiencies, as multiple branches are explored
simultaneously, consuming resources unnecessarily if not properly optimized.
4. Requires Good Bounding Functions:
o The effectiveness of the method depends on the quality of the bounding functions. Poorly estimated
bounds may lead to inefficient searches and an increase in unnecessary branching.
5. Not Suitable for Real-Time Applications:
o Due to its iterative and exhaustive nature, Branch and Bound is generally unsuitable for real-time
applications or where quick results are required.
6. Difficulty in Choice of Variables for Branching:
o Choosing the right variables for branching can be challenging. Poor branching decisions can lead to slow
convergence or infeasible solutions.

Branch and Bound is a powerful and systematic approach for solving combinatorial optimization problems, but it comes
with challenges in terms of computational complexity and memory usage, especially for large-scale problems. With proper
optimizations and bounding techniques, it can be effectively used to achieve optimal solutions.

15. A hiker has a knapsack that can carry a maximum weight of 20 kg. There are four items with weights
and values as follows:
Item Weight (kg) Value (Rs)
A 5 10
B 3 8
C 4 7
D 2 5
The hiker wants to maximize the total value of the items in the knapsack without exceeding the weight
limit.
Solution:
16. Discuss the importance of Lagrangian multipliers.

Lagrangian multipliers are a mathematical tool used primarily in optimization problems, especially in
constrained optimization. They provide a way to solve problems where both equality and inequality constraints
exist. Below are the key aspects highlighting their importance:
1. Solving Constrained Optimization Problems
• Handling Constraints: Lagrangian multipliers help in dealing with both equality and inequality
constraints in optimization problems. They transform constrained problems into simpler unconstrained
ones by introducing auxiliary variables (multipliers) that adjust the constraints to find optimal
solutions.
 2. Simplifying the Optimization Process
• Conversion to Unconstrained Problem: Lagrangian multipliers transform constrained optimization
problems into unconstrained problems by incorporating constraints directly into the objective function.
This simplifies the solution process by focusing on the partial derivatives of the Lagrangian function.
• Stationarity: Optimal solutions are found where the gradients of the Lagrangian function with respect to
all variables and multipliers are zero. This leads to easier computation compared to directly solving the
constrained problem.

3. Informative in Sensitivity Analysis

• Understanding Constraint Effects: Lagrangian multipliers provide insights into how sensitive the
objective function is to constraint changes. For example, the magnitude of the multiplier gives an
indication of how much the objective function would improve if the constraint were relaxed.

4. Application in Duality Theory

• Dual Problem: Lagrangian multipliers are central to the formulation of dual problems in optimization.
The dual problem provides valuable information about the sensitivity and bounds of the original
problem, making it easier to handle optimization from a different perspective.

5. Real-World Applications
• Engineering and Economics: Lagrangian multipliers are widely used in fields like engineering design,
economics, resource allocation, and production planning, where constraints such as resource
limitations, budget, or technological constraints play a crucial role.
• Machine Learning: In machine learning, Lagrangian multipliers are used in algorithms like Support
Vector Machines (SVMs) and in regularization techniques like Lasso and Ridge regression to handle
constraints on coefficients.

Lagrangian multipliers simplify constrained optimization problems, making them more tractable and efficient to solve.
They provide critical insights into the trade-offs between objectives and constraints, helping to obtain optimal solutions
even in the presence of complex restrictions.

17. A company produces two products, A and B. Each product requires processing time on two machines,
M1 and M2. The processing times and profit per unit for each product are given below:
Time / Hour
Product M1 M2 Profit/Unit
A 2 1 10
B 1 2 12
The total available time on each machine is 8 hours. Formulate an integer programming model to
maximize the total profit.

Solution:
Integer Programming Model for Maximizing Profit
Given the information:
• Two products: A and B.
• Processing times:
o Product A: 2 hours on Machine M1 and 1 hour on Machine M2.
o Product B: 1 hour on Machine M1 and 2 hours on Machine M2.
• Profit per unit:
o Product A: Rs 10 per unit.
o Product B: Rs 12 per unit.
• Total available time:
 o Machine M1: 8 hours.
o Machine M2: 8 hours.
We need to formulate an integer programming model to maximize the total profit, subject to machine time
constraints.

Decision Variables:
• Let x₁ be the number of units of Product A produced.
• Let x₂ be the number of units of Product B produced.
18. Explain the Jacobean Method in detail.

The Jacobean method is used to solve systems of nonlinear equations. It involves linearizing the system of
nonlinear equations by approximating the system's behavior using a linear approximation, also known as the
Jacobian matrix. This method iteratively improves the solution until convergence is achieved.
 Advantages of the Jacobean Method:
• Accuracy: It provides a good approximation to solutions for nonlinear systems.
• Convergence: If the Jacobian is invertible and close to the identity matrix, the method generally converges.
• Flexibility: Works well for large systems of equations and provides a structured way to solve nonlinear
equations.
Disadvantages of the Jacobean Method:
• Computational Complexity: Involves computing and potentially inverting the Jacobian matrix, which can be
computationally expensive for large systems.
• Non-convergence: If the Jacobian is singular (non-invertible) or poorly conditioned, the method may fail to
converge.
• Initial Guess Sensitivity: The quality of the initial guess x0x_0x0 can significantly affect the convergence rate.
Application:
The Jacobean method is widely used in solving nonlinear systems in fields such as engineering, physics, economics, and
computer science, where systems of equations do not have a straightforward linear relationship.

19. Formulate the problem by Branch and Bound Method.

Maximize: Z = 3x1 + 2x2
Subject to:
x1 + 2x2 ≤ 5
2x1 + x2 ≤ 4
x1, x2 ≥ 0 and integer

Solution:
20. Briefly mention the areas of application of Network Techniques.
 Areas of Application of Network Techniques :
1. Project Management:
o Used for planning, scheduling, and controlling complex projects with tools like PERT
(Program Evaluation and Review Technique) and CPM (Critical Path Method). It helps
in organizing tasks, timelines, and resource allocation efficiently.
2. Operations Management:
o Facilitates optimization of production processes, supply chains, and logistics. Network
techniques help streamline operations and improve efficiency in manufacturing, service
industries, and distribution.
3. Resource Allocation:
o Helps in effectively allocating resources such as manpower, equipment, and capital to
maximize productivity and meet project goals.
4. Scheduling and Optimization:
o Aids in task scheduling, minimizing completion time, and optimizing resource use. It is
widely used in industries like construction, software development, and event planning.
5. Risk Management:
o Analyzes and manages risks by identifying critical paths and uncertainties, ensuring
that potential issues are addressed through careful planning.
6. Financial Planning:
o Utilizes network techniques for budgeting, cash flow analysis, and investment
planning, aiding in strategic decision-making.
7. Supply Chain Management:
o Enhances efficiency by optimizing the flow of goods, services, and information across
the supply chain, reducing costs and improving customer satisfaction.
8. Transportation and Logistics:
o Streamlines routes, schedules, and resource management to optimize the transportation
of goods, enhancing efficiency and reducing operational costs.
9. Research and Development:
o Manages complex projects by mapping dependencies, timelines, and tasks, helping in
innovative product development and scientific research.
10. Defense and Security:
o Supports national security operations by managing communication networks, resource
allocation, and project execution in defense-related projects.
11. Health Care Management:
o Used for scheduling and managing patient flows, optimizing resources in hospitals, and
ensuring efficient health service delivery.

These are just a few examples of the many areas where network techniques are applied. The common
thread among these applications is the use of network models to optimize complex systems and make
informed decisions.

21. Formulate the problem by Cutting Plane Method.

Maximize: Z = 3x1 + 2x2
Subject to:
x1 + 2x2 ≤ 5
2x1 + x2 ≤ 4
x1, x2 ≥ 0 and integer.

Solution:
22. Solve the following equation by using Jacobi method:
2x+5y = 21

x+2y = 8

Solution:
23. Draw a network diagram and find critical path for the following activities. Also find the total float for
each activity.

Job 1-2 1-3 2-3 2-5 3-4 3-6 4-5 4-6 5-6 6-7

Dura- 15 15 3 5 8 12 1 14 3 14
tion

Solution:

Step 1: Construct the Network Diagram

1. Nodes represent activities.

2. Arrows represent the precedence relationships between activities.
3. Duration associated with each arrow indicates the time taken to complete the respective task.
Network Diagram:

• Activity Durations are shown beside the respective arrows.

24. Solve the following system of linear equations using Jacobi method:
4x1+2x2-2x3 = 0
x1-3x2-x3 = 7
3x1-x2+4x3 = 5
Solution:
25. A small project is composed of seven activities whose time estimates are listed in the table as follows.

Estimated duration(weeks)
Activity Optimistic Most Likely Pessimistic
1-2 1 1 7
1-3 1 4 7
2-4 2 2 8
2-5 1 1 1
3-5 2 5 14
4-6 2 5 8
5-6 3 6 15
a) Draw the project network.
b) Find the expected duration and variance of each activity.
If the project due data is 19 weeks, what is the probability of meeting the due date.

Solution:

a) Drawing the Project Network

Let's start by constructing the project network based on the given activities and their respective estimated
durations. We'll assign nodes to represent the start and end of the project, as well as individual activities.
26. Solve (mz – ny) p + (nx – lz) q = ly – mx by Lagrange’s method.
27. Solve (x2+y2+yz)p + (x2+y2-xz)q = z(x+y) by Lagrange’s method.
28. The following table gives the activities in a Production project and other information:
Activity Optimistic Normal Time Pessimistic
Time (a) (m) Time (b)
1-2 30 44 54
1-3 8 12 16
2-3 1 2 3
2-4 2 3 5
3-4 8 10 12
4-5 14 22 25
i) Draw a PERT Diagram.
ii) Find the probability that the project will be completed in less than 60 days.

Solution:
29. The owner of a small machine shop has four mechanics available to assign jobs for the day. Five jobs are
offered with expected profit for each mechanic on each job which are as follows:
Job
A B C D E
I 62 78 50 101 82
Mechanic II 71 84 61 73 59
III 87 92 111 71 81
IV 48 64 87 77 80

Find by using the Assignment method, the assignment of mechanics to the job that will result in a
maximum profit. Which job should be declined?

Solution:
30. A project consisting of 8 activities has the following characteristics:
Activity Preceding Time Estimates (in weeks)
Activity Most Most Likely Most
Optimistic Pessimistic
A - 2 4 12
B - 10 12 26
C A 8 9 10
D A 10 15 20
E A 7 7.5 11
F B,C 9 9 9
G D 3 3.5 7
H E,F,G 5 5 5
 (i) Draw the PERT Network for the project.
(ii) Determine the Critical Path.

Solution:
31. Explain the various techniques used in scheduling. Discuss in detail with examples.

Techniques Used in Scheduling

Scheduling is a key aspect of project management, ensuring tasks are completed on time and resources are used efficiently.
Here are the most common scheduling techniques:

1. Gantt Chart
Description:
• A Gantt Chart is a bar chart that represents a project schedule. It visually illustrates start and end dates for tasks
and their durations.
• Activities are listed on the vertical axis, and time is represented on the horizontal axis.
Example:
A construction project might have tasks like:
• Site Preparation: Start on Day 1, duration 5 days.
• Foundation Work: Start on Day 6, duration 10 days.
• Framing: Start on Day 16, duration 15 days.
A Gantt Chart visually represents these tasks, making it easy to track progress and overlaps.

2. Critical Path Method (CPM)

Description:
• CPM identifies the longest path of dependent activities in a project, determining the shortest possible duration for
project completion.
• It calculates early start (ES), early finish (EF), late start (LS), and late finish (LF) to find activities with zero slack
(critical activities).
Example:
For a software project:
1. Requirements Gathering (2 days) → Design (3 days) → Development (5 days) → Testing (4 days).
2. The critical path would be: Requirements → Design → Development → Testing = 14 days.

3. Program Evaluation and Review Technique (PERT)

Description:
• PERT is used to manage projects with uncertain activity durations by estimating:
 o Optimistic Time (a)
o Most Likely Time (m)
o Pessimistic Time (b)
• It calculates the expected time (Te) for activities and the project’s completion probability.
Example:
For a product launch:
1. Market Research: a=4, m=6, b=8; Te=(4+4(6)+8)/6=6.33
2. Product Design: a=5, m=8, b=15; Te=8.83
PERT helps in determining the likelihood of meeting deadlines.

4. Work Breakdown Structure (WBS)

Description:
• WBS breaks a project into smaller, manageable tasks.
• Each task is assigned resources, durations, and dependencies.
Example:
For event planning:
1. Event Planning → Venue Selection (5 days) → Catering Arrangement (3 days) → Invitations (2 days).
2. Each sub-task is tracked individually.

5. Resource Leveling
Description:
• This technique adjusts schedules to manage resource constraints, ensuring resources are not over-allocated.
• It may extend project duration to resolve conflicts.
Example:
If two engineers are available, and both are assigned tasks that overlap, one task might be rescheduled.

6. Kanban
Description:
• Kanban uses a visual board to manage workflows, focusing on reducing work-in-progress.
• Tasks are moved through stages: To Do → In Progress → Completed.
Example:
For a software team:
• To Do: Write test cases.
• In Progress: Develop the feature.
• Completed: Deploy to production.

7. Milestone Charts
Description:
• Milestones are significant project events or decision points.
• A milestone chart tracks these points, ensuring progress toward key objectives.
Example:
A marketing campaign:
• Milestone 1: Complete market research.
• Milestone 2: Approve campaign strategy.
• Milestone 3: Launch campaign.

8. Line of Balance (LOB)

Description:
• Used for repetitive projects like manufacturing, where multiple tasks are performed in sequence.
• It ensures a steady flow of work without delays.
Example:
 In manufacturing 100 units of a product:
• Task 1: Assemble components.
• Task 2: Paint the units.
• Task 3: Package the units.
LOB ensures each phase is synchronized.

9. Agile Scheduling
Description:
• Agile scheduling focuses on iterative cycles (sprints) and adjusts plans based on feedback.
• Popular in software development.
Example:
A sprint plan for a 2-week cycle:
1. Day 1: Plan sprint.
2. Day 5: Develop core feature.
3. Day 10: Test the feature.
4. Day 14: Deliver.

10. Fast Tracking and Crashing

Description:
• Fast Tracking: Perform tasks in parallel to save time.
• Crashing: Add resources to reduce activity durations (increasing costs).
Example:
• Fast Tracking: Start design while requirements gathering is ongoing.
• Crashing: Add an additional developer to speed up coding.

Effective scheduling combines techniques based on the project’s complexity, resource availability, and deadlines. For
large projects, integrating CPM, PERT, and Gantt Charts provides clarity and precision, while Agile and Kanban excel in
dynamic environments.

32. A small project consists of seven activities for which the relevant data are given below:
Activity Preceding Activity
Activity Duration
(Days)
A - 4
B A 7
C - 6
D C 5
E B 7
F D,E 6
G F 5
i) Draw the network and find the project completion time.
ii) Calculate total float for each activity.

Solution:
33. Evaluate by using dual simplex method and solve the LPP. 𝑀𝑖𝑛𝑖𝑚𝑖𝑧𝑒 𝑍 = 2𝑥1 + 4𝑥2
Subject to
2𝑥1 + 𝑥2 ≥ 4
𝑥1 + 2𝑥2 ≥ 3
2𝑥1 + 2𝑥2 ≤ 12
𝑥1, 𝑥2 ≥ 0
(i) Develop the simplex table.
(ii) Find the value of 𝑥1, 𝑥2

Solution:
34. The processing time in hours for the jobs when allocated to the different machines is indicated below.
Select the best assignment of the machines for the jobs so that the total processing time is Minimum.
Machines
M1 M2 M3 M4 M5
J1 9 22 58 11 19
Job J2 43 78 72 50 63
J3 41 28 91 37 45
J4 74 42 27 49 39
J5 36 11 57 22 25

Solution:
35. Given the following information about a Project, you are required to calculate:
Activity Duration
1-2 2
1-3 2
1-4 1
2-5 4
3-6 1
3-7 5
4-6 8
5-8 4
6-9 3
7-8 3
8-9 3
1) Find the Total Float for each activity.
2) Critical Path of the project and its duration.

Solution:
36. A company produces 2 types of hats A & B. Every hat B requires twice as much as labour time as hat A.
The company can produce a total of 500 hats a day. The market limits daily sales of the A & B to 150 and
250 hats respectively. The Profits on hats A & B are Rs.8 & Rs.5 respectively.
(i) Summarize the given situation as a LPP.
(ii) Predict the optimum solution.

Solution: