Scribd
Upload
7 views

Ass

Uploaded by

Assefa Abera
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
7 views

Ass

Uploaded by

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

Question 1: Linear Programming Model for Product A, B, and C

Objective: Maximize profit from products A, B, and C.

Define Variables:

Let xA = units of product A produced.

Let xB= units of product B produced.

Let xC= units of product C produced.

Profit Contributions:

Let the profit per unit of A be pA

Let the profit per unit of B be pB

Let the profit per unit of C be pC

Constraints:

Production limits:

xA≤50

xB≤25

xC≤30

Man-hours constraint:

aAxA+aBxB+aCxC≤100

(Assume aA,aB,aC represent hours needed per unit for A, B, and C


respectively.)

xA≥20

xB+xC≥15

Objective Function:

Maximize Z=pAxA+pBxB+pCxC

Formulate the LP Model:

Maximize Z=pAxA+pBxB+pCxC
Subject to:

xA≤50xA≤50

xB≤25xB≤25

xC≤30xC≤30

aAxA+aBxB+aCxC≤100aAxA+aBxB+aCxC≤100

xA≥20xA≥20

xB+xC≥15xB+xC≥15

xA,xB,xC≥0xA,xB,xC≥0

Question 2: Transportation Problem Using VAM

Setup:

Supply:

P1=70,P2=80,P3=180P1=70,P2=80,P3=180

Demand:

W1=50,W2=60,W3=70,W4=150W1=50,W2=60,W3=70,W4=150

Costs (Birr):

W1 W2 W3 W4

P1 19 3 50 10

P2 7 3 4 60

P3 40 8 70 20

Apply VAM:

Calculate penalties for each row and column.


Allocate based on the highest penalty until all demands and supplies
are met.

Final Allocation:

Follow the iterative steps as previously outlined to find the optimal


distribution.

Question 3: Assignment Problem Using Hungarian Method

Cost Matrix:

Define the cost matrix for each job and worker.

Steps:

Subtract the row minima from each row.

Subtract the column minima from each column.

Cover all zeros with the minimum number of lines.

Adjust costs until an optimal assignment is found.

Output:

Least cost allocation and total assignment cost.

Question 4: Quality Control Inspection LP Model

Define Variables:

Let x1x1 = number of grade 1 inspectors.

Let x2x2 = number of grade 2 inspectors.


Objective Function:

Minimize total cost:

Z=5x1+4x2+3(error cost)Z=5x1+4x2+3(error cost)

Constraints:

Inspection requirement: 40x1+30x2≥200040x1+30x2≥2000

Availability: x1≤9x1≤9, x2≤11x2≤11

Non-negativity: x1,x2≥0x1,x2≥0

Formulate the Model:

Minimize Z=5x1+4x2+3(error cost)Z=5x1+4x2+3(error cost)

Subject to:

40x1+30x2≥200040x1+30x2≥2000

x1≤9x1≤9

x2≤11x2≤11

x1,x2≥0x1,x2≥0

Question 5: Production LP Model for Components C1 and C2

Define Variables:

Let x1x1 = units of C1 produced.

Let x2x2 = units of C2 produced.

Objective Function:
Maximize profit:

Z=30x1+70x2Z=30x1+70x2

Constraints:

Cash constraints: 5x1+5x2≤40005x1+5x2≤4000

Machine time: 3x1+2x2≤20003x1+2x2≤2000

Assembly time: 2x1+3x2≤14002x1+3x2≤1400

Non-negativity: x1,x2≥0x1,x2≥0

Formulate the Model:

Maximize Z=30x1+70x2Z=30x1+70x2

Subject to:

5x1+5x2≤40005x1+5x2≤4000

3x1+2x2≤20003x1+2x2≤2000

2x1+3x2≤14002x1+3x2≤1400

x1,x2≥0x1,x2≥0

Question 6: Pharmaceutical Products LP Model

Define Variables:

Let yAyA = units of product A produced.

Let yByB = units of product B produced.

Objective Function:

Maximize profit:
Z=3yA+8yB+2(sales from C)−1(destruction cost)Z=3yA+8yB
+2(sales from C)−1(destruction cost)

Constraints:

Process I: 2yA+4yB≤182yA+4yB≤18

Process II: 3yA+5yB≤213yA+5yB≤21

By-product constraint: 3yB≤53yB≤5 (from the sales of C)

Non-negativity: yA,yB≥0yA,yB≥0

Formulate the Model:

Maximize Z=3yA+8yB+2(min⁡(3yB,5))−1(max⁡(0,3yB−5))Z=3yA+8yB
+2(min(3yB,5))−1(max(0,3yB−5))

Subject to:

2yA+4yB≤182yA+4yB≤18

3yA+5yB≤213yA+5yB≤21

3yB≤53yB≤5

yA,yB≥0yA,yB≥0

Question 7: Media Mix LP Model

Define Variables:

Let zTzT = number of TV programs.

Let zRzR = number of radio programs.

Objective Function:

Maximize reach:
Z=450000zT+20000zRZ=450000zT+20000zR

Constraints:

Budget: 50000zT+20000zR≤20000050000zT+20000zR≤200000

Program limits: zT≥3zT≥3, zR≤5zR≤5

Non-negativity: zT,zR≥0zT,zR≥0

Formulate the Model:

Maximize Z=450000zT+20000zRZ=450000zT+20000zR

Subject to:

50000zT+20000zR≤20000050000zT+20000zR≤200000

zT≥3zT≥3

zR≤5zR≤5

zT,zR≥0zT,zR≥0

Conclusion

This provides a step-by-step framework for each of the problems listed in


your assignment. For further details on solving each LP model or utilizing
methods like the Hungarian method or VAM, please let me know!

You might also like