BE/B Eng Bachelor of Engineering Industrial Engineering 1 — Questions and Answers
Question 1: What is the primary objective of linear programming in industrial engineering?
- To maximize or minimize a linear objective function subject to linear constraints (Correct answer)
- To solve non-linear optimization problems using iterative algorithms
- To model probabilistic systems and their outcomes
- To design production schedules using discrete-event simulation
Correct answer: To maximize or minimize a linear objective function subject to linear constraints
Linear programming optimizes (maximizes or minimizes) a linear objective function subject to a set of linear equality or inequality constraints.
Question 2: In the simplex method for linear programming, the optimal solution always occurs at which location in the feasible region?
- At the centroid (geometric center) of the feasible region
- At a corner point (extreme point/vertex) of the feasible region (Correct answer)
- Along the boundary edge connecting two constraint lines
- At the origin of the coordinate system
Correct answer: At a corner point (extreme point/vertex) of the feasible region
The fundamental theorem of linear programming guarantees that if an optimal solution exists, it occurs at a corner (vertex) of the convex feasible polyhedron.
Question 3: The Economic Order Quantity (EOQ) model determines the optimal order quantity by minimizing the total of which two costs?
- Production cost and transportation cost
- Ordering (setup) cost and inventory holding (carrying) cost (Correct answer)
- Labor cost and overhead cost
- Material purchase cost and quality inspection cost
Correct answer: Ordering (setup) cost and inventory holding (carrying) cost
EOQ balances ordering/setup costs (which decrease with larger orders) against inventory holding costs (which increase with larger orders) to find the cost-minimizing quantity.
Question 4: In PERT/CPM network analysis, the critical path is defined as:
- The shortest path through the project network
- The path with the fewest number of activities
- The longest path through the network, which determines the minimum project duration (Correct answer)
- The path with the highest total resource utilization
Correct answer: The longest path through the network, which determines the minimum project duration
The critical path is the longest sequence of dependent activities from start to finish; any delay on this path directly delays the entire project.
Question 5: Time study, a classical work measurement technique, is primarily used to:
- Assess the psychological stress and fatigue levels of workers
- Establish standard times for performing defined work tasks (Correct answer)
- Calculate total production material costs per unit
- Determine the optimal number of workers required per shift
Correct answer: Establish standard times for performing defined work tasks
Time study involves observing and timing a qualified worker performing a task at a normal pace, then applying rating factors and allowances to establish a standard time.
Question 6: In queuing theory, Little's Law states L = λW. What does 'L' represent?
- The maximum length the queue has ever reached
- The average number of customers in the system (queue + service) (Correct answer)
- The average time a customer spends waiting in the queue only
- The server utilization rate of the system
Correct answer: The average number of customers in the system (queue + service)
Little's Law: L (average number of customers in the system) = λ (average arrival rate) × W (average time each customer spends in the system).
Question 7: Which of the following is NOT one of the seven wastes (Muda) identified in lean/Toyota Production System?
- Overproduction
- Waiting
- Innovation (Correct answer)
- Unnecessary transportation
Correct answer: Innovation
The seven TPS wastes are: overproduction, waiting, transportation, over-processing, excess inventory, unnecessary motion, and defects — innovation is not a waste.
BE/B Eng Bachelor of Engineering Industrial Engineering 1
What is the primary objective of linear programming in industrial engineering?