Scribd
Upload
7 views6 pages

answer sheet

Uploaded by

hanose
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
7 views6 pages

answer sheet

Uploaded by

hanose
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

**Question 1: Electronic Company Radio Production**

#### **Problem Statement**

An electronics company manufactures two radio models:

- Model 1: Daily capacity = 60 units, uses 10 components/unit, profit = $30/unit

- Model 2: Daily capacity = 75 units, uses 8 components/unit, profit = $20/unit

Maximum daily component availability = 800 units.

#### **LP Formulation**

**Decision Variables:**

- Let x₁ = Number of Model 1 radios produced daily

- Let x₂ = Number of Model 2 radios produced daily

**Objective Function:**

Maximize Z = 30x₁ + 20x₂

**Constraints:**

1. x₁ ≤ 60 (Model 1 capacity)

2. x₂ ≤ 75 (Model 2 capacity)

3. 10x₁ + 8x₂ ≤ 800 (Component constraint)

4. x₁, x₂ ≥ 0 (Non-negativity)

#### **Graphical Solution**

**Corner Point Analysis:**


| Point (x₁,x₂) | Profit Calculation | Total Profit |

|---------------|--------------------|--------------|

| (0,0) | 30(0) + 20(0) | $0 |

| (0,75) | 30(0) + 20(75) | $1,500 |

| (20,75) | 30(20) + 20(75) | $2,100 |

| (60,25) | 30(60) + 20(25) | $2,300 |

| (60,0) | 30(60) + 20(0) | $1,800 |

**Optimal Solution:**

Produce 60 Model 1 and 25 Model 2 radios daily for maximum profit of $2,300.

---

### **Question 2: Radio Assembly Plant**

#### **Problem Statement**

Assembly times (minutes) and daily capacities:

| Station | Hifi-1 | Hifi-2 | Available Time (after maintenance) |

|---------|--------|--------|------------------------------------|

|1 |6 |4 | 432 min (480 - 10%) |

|2 |5 |5 | 460.8 min (480 - 4%) |

|3 |4 |6 | 422.4 min (480 - 12%) |

Profit: 30 birr (Hifi-1), 26 birr (Hifi-2)


#### **LP Formulation**

**Decision Variables:**

- Let x₁ = Units of Hifi-1 produced daily

- Let x₂ = Units of Hifi-2 produced daily

**Objective Function:**

Maximize Z = 30x₁ + 26x₂

**Constraints:**

1. 6x₁ + 4x₂ ≤ 432 (Station 1)

2. 5x₁ + 5x₂ ≤ 460.8 (Station 2)

3. 4x₁ + 6x₂ ≤ 422.4 (Station 3)

4. x₁, x₂ ≥ 0

---

### **Question 3: Graphical LP Analysis**

#### **Problem Statement**

Maximize Z = 3x₁ + 2x₂

Subject to:

1. 2x₁ + x₂ ≤ 2

2. 3x₁ + 4x₂ ≥ 12

3. x₁, x₂ ≥ 0

#### **Analysis**
1. **Constraint Intersections:**

- C1: (1,0) and (0,2)

- C2: (4,0) and (0,3)

2. **Feasibility Check:**

- No intersection in non-negative quadrant

- System is infeasible (no solution satisfies all constraints)

---

### **Question 4: Product Mix Problem**

#### **Problem Statement**

Three products with processing times (minutes):

| Operation | Product 1 | Product 2 | Product 3 | Daily Limit |

|-----------|-----------|-----------|-----------|-------------|

|1 |1 |2 |1 | 430 |

|2 |3 |0 |2 | 460 |

|3 |1 |2 |0 | 420 |

Profit: 3, 2, 5 birr per unit respectively

#### **LP Formulation**

**Decision Variables:**

- Let x₁ = Units of Product 1


- Let x₂ = Units of Product 2

- Let x₃ = Units of Product 3

**Objective Function:**

Maximize Z = 3x₁ + 2x₂ + 5x₃

**Constraints:**

1. x₁ + 2x₂ + x₃ ≤ 430

2. 3x₁ + 2x₃ ≤ 460

3. x₁ + 2x₂ ≤ 420

4. x₁, x₂, x₃ ≥ 0

#### **Initial Simplex Tableau**

[Insert formatted tableau here]

---

**Group Certification:**

We confirm that this is our original work and all contributions have been properly
acknowledged.

**Signatures:**

1. _________________________

2. _________________________

3. _________________________
---

**To format this properly in Word:**

1. Use Times New Roman 12pt or Arial 11pt

2. Add your university header

3. Use consistent heading styles (Heading 1, Heading 2)

4. Insert tables for the numerical solutions

5. Add page numbers

6. Include a cover page with group members' details

Would you like me to provide this as an actual .docx file that you can download? I can generate
one for you if needed.

You might also like