Math Problem Statement
formulate the lpp
Solution
To formulate the Linear Programming Problem (LPP) for this problem, let's proceed step by step.
Step 1: Define the Decision Variables
Let:
- : Number of skilled labourers employed per day
- : Number of semi-skilled labourers employed per day
Step 2: Objective Function
The goal is to minimize the total daily cost for wages and rejection losses.
-
Daily wage cost per labourer:
Skilled labour:
Semi-skilled labour: -
Daily rejection loss per labourer:
Rejection rate for skilled labour = 5% (0.05)
Rejection rate for semi-skilled labour = 10% (0.10)
Cost of rejecting an assembly =
-
Assemblies rejected by skilled labour per day = assemblies
- Cost of rejection per skilled labour =
-
Assemblies rejected by semi-skilled labour per day = assemblies
- Cost of rejection per semi-skilled labour =
Thus, the total daily cost (wages + rejection loss) is:
Simplifying:
Step 3: Constraints
-
Production Constraint
Each skilled labour produces 80 assemblies, and each semi-skilled labour produces 60 assemblies.
The required weekly production = .
Daily production requirement = .
Thus:
-
Semi-Skilled Labour Limit Constraint
The company wants to limit the number of semi-skilled labourers to utmost 400 per day:
-
Non-Negativity Constraint
Labourers cannot be negative:
Final LPP Formulation
Subject to:
Let me know if you need me to solve the LPP or explain any steps further!
Related Questions
- How is the rejection rate incorporated into the objective function?
- How can this LPP be solved using the graphical method?
- What changes in the formulation if there is no limit on semi-skilled labourers?
- How do we interpret the optimal solution of this LPP?
- What happens if the weekly production target increases to 2,00,000 assemblies?
Tip
In LPPs, clearly defining decision variables and interpreting constraints is critical to correct formulation.
Ask a new question for Free
By Image
Drop file here or Click Here to upload
Math Problem Analysis
Mathematical Concepts
Linear Programming
Optimization
Constraints
Formulas
Objective function: Minimize Z = c1*x + c2*y
Production constraint: ax + by >= Total production
Non-negativity constraint: x >= 0, y >= 0
Theorems
Linear Programming Fundamental Theorem
Suitable Grade Level
Undergraduate Level
Related Recommendation
Linear Programming Problem: Maximize Profit for Product Models Using Simplex Algorithm
Linear Programming for Profit Maximization - Product Mix Optimization
Linear Programming Formulation for Reddy Mikks Paint Optimization Problem
Use Linear Programming to Optimize Production Costs
Linear Programming Problem for Maximizing Profit in Automobile Part Production