Scribd
Upload
6 views

Module in MGT - Science After Midterm

module in management science

Uploaded by

jekylarimbaogolgota
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
6 views

Module in MGT - Science After Midterm

module in management science

Uploaded by

jekylarimbaogolgota
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Specially-Structured Linear Programming Problems

Specially-structured linear programming problems are a class of optimization problems that have
specific structures, allowing them to be solved more efficiently. Two primary types are
Transportation Problems and Assignment Problems. Each type has unique features and
applications that make them highly useful in operations research, logistics, and resource
allocation.

a. Transportation Problems

Definition:
A transportation problem is a type of linear programming problem that deals with finding the
most cost-effective way to transport goods from multiple origins (e.g., factories) to multiple
destinations (e.g., warehouses) while satisfying supply and demand constraints. The goal is
typically to minimize the total transportation cost or maximize efficiency.

Example Problem and Solution:


Suppose there are two factories (A and B) and three warehouses (1, 2, and 3). The transportation
costs from each factory to each warehouse are as follows:

Warehouse 1 Warehouse 2 Warehouse 3 Supply


Factory A 4 6 8 50
Factory B 5 4 3 60

Demand at each warehouse is as follows:

Warehouse Demand
1 30
2 40
3 40

Solution:
The objective function is to minimize the total cost, which can be set up as:

Minimize Z=4xA1+6xA2+8xA3+5xB1+4xB2+3xB3\{Minimize } Z = 4x_{A1} + 6x_{A2} +


8x_{A3} + 5x_{B1} + 4x_{B2} + 3x_{B3}Minimize Z=4xA1+6xA2+8xA3+5xB1+4xB2
+3xB3

subject to:

1. Supply constraints:
o xA1+xA2+xA3=50x_{A1} + x_{A2} + x_{A3} = 50xA1+xA2+xA3=50
o xB1+xB2+xB3=60x_{B1} + x_{B2} + x_{B3} = 60xB1+xB2+xB3=60
2. Demand constraints:
o xA1+xB1=30x_{A1} + x_{B1} = 30xA1+xB1=30
o xA2+xB2=40x_{A2} + x_{B2} = 40xA2+xB2=40
o xA3+xB3=40x_{A3} + x_{B3} = 40xA3+xB3=40

By solving this using methods such as the Northwest Corner Rule, Least Cost Method, or
Vogel's Approximation Method, we can obtain an optimal transportation plan.

b. Assignment Problems

Definition:
An assignment problem is a special type of linear programming problem where the goal is to
assign a set of tasks to a set of agents (e.g., workers, machines) in such a way that the total cost
or time required is minimized. The problem is often represented as a matrix where each row
corresponds to a task, and each column represents an agent.

Example Problem and Solution:


Suppose we have three tasks (T1, T2, T3) and three workers (W1, W2, W3). The cost matrix,
which shows the cost of assigning each worker to each task, is given below:

W1 W2 W3
T1 10 12 15
T2 8 9 7
T3 14 10 11

The objective is to assign each task to a worker such that the total cost is minimized.

Solution Using the Hungarian Method:

1. Step 1: Subtract the smallest element in each row from all elements of that row.
2. Step 2: Subtract the smallest element in each column from all elements of that column.
3. Step 3: Cover all zeros in the resulting matrix using a minimum number of lines
(horizontal and vertical).
4. Step 4: If the minimum number of lines equals the order of the matrix, an optimal
assignment exists among the zeros. If not, modify the matrix by reducing elements
uncovered by lines and continue until all tasks are assigned.

In this example, using the Hungarian Method, the solution yields the minimum cost assignment.

Individual Activity for Students


Activity:

1. Problem: Assign three tasks (T1, T2, T3) to three workers (W1, W2, W3) with the
following cost matrix:

W1 W2 W3
T1 7 8 6
T2 9 11 12
T3 10 7 8

2. Instructions:
o Apply the Hungarian Method to solve this assignment problem.
o Submit your answer with a step-by-step solution showing your calculations and
the final total cost.

You might also like