Industrial Optimization Techniques (KOE086) - AKTU Question Paper 2023-24
B.Tech · Semester 8 · Free PDF Download
This is the official AKTU Industrial Optimization Techniques Previous Year Question Paper for B.Tech Semester 8, academic session 2023-24. Published by Dr. A.P.J. Abdul Kalam Technical University (AKTU/UPTU), Lucknow. Free PDF download — no login required.
Rate this paper
Questions Asked in 2023-24
Industrial Optimization Techniques (KOE086) — complete question paper · 100 marks · 3 Hours
- aDifferentiate between CPM and PERT. 02 2
- bDifferentiate between individual and group replacement policy. 0 2 5
- cDefine saddle point and optimal strategy. 02 3
- dDefine slack and surplus variables. 02 1
- eWhat are various customer behaviors in a queue? 02 3
- fDiscuss the application of Monte Carlo Simulation in engineeri ng. 02 4
- gDiscuss the principle of dominance. 02 3
- hDefine optimistic time, pessimist ic time, and most likely time. 02 2 i. Write the dual of the following primal: Minimize Z= 3x+2y Subjected to: 8x+y ≥ 8, 2x+y ≥ 6, x+3y ≥ 6, x+6y ≥ 8, x, y ≥ 0 j. How degeneracy can be determined in a transportation problem? 02 1
- aSolve the following LPP using simplex method. Maximize: z = 50x + 60y Subjected to
- bConsider a construction project to build a residential compl ex. The project consists of the following activities: Activity Description Predecessors Duration A Site Preparation - 5 B Foundation Work A 10 C Framing A 15 D Plumbing and Electrical B, C 12 E Roofing B 8 F Exterior Finishing (Siding, C 10 G Interior Finishing D, E, F 15 H Final Inspection and G 5 Using the information provided, construct the project network diagram, determine the earliest start time (ES), earliest finish time (EF), latest start time (LS), latest finish time (LF), and the total float for each activity. Identi fy the critical path(s) and calculate the total duration of the project. Also, analyse the implications if there is a delay in any activity along the critical path
- cConsider a two-person zero-s um game given in the following payoff matrix: Strategy 1 Strategy 2 Strategy 3 Player 1 3 5 2 Player 2 1 4 6 Player 3 2 3 5 Determine if the game has a saddle point. If so, identify the s addle point and the optimal strategy for both players. If the game does not have a saddle point, apply the Maximin and Minimax principl es to find the optimal strategi es for both players
- dIllustrate the application of Dynamic Programming through examples such as the Capital Budgeting Problem and the Cargo-loading Problem. Explai n how DP techniques are used to optimize resource allocation and decision-making in these scenarios
- eCalculate the economical lot size and the minimum total cos t in the given problem. A company requires 50000 units per year which costs Rs .10 per unit. Ordering cost is estimated to be Rs.100 per order, and carrying costs are 15% per annum of average inventory. The supplier is prepared to give 2% discount in the price of the original value if the company purchases 10000 units or more but less than 20000 lot size. A further discount of 1% in the price of t he original value is available on the order of 20000 or more units
- aa) Describe the various costs associated with inventory, inc luding holding costs, ordering costs, and shortage costs
- bDifferentiate between deterministic and probabilistic (non-d eterministic) inventory models
- bThe purchase price of a machine is Rs. 52,000. The installation charges amount to Rs. 14400 and its scrap value is Rs. 6400. The maintenance c ost in various years is given below: Year Maintenance Cost (₹) After how many years should the machine be replaced? Assume that the machine replacement can be done only at the year ends
- aa) Explain the concept of a single-server queuing model and its components. Discuss the parameters involved in analyzing a single-server qu euing system, including arrival rate, service rate, queue length, and waiting time
- bDefine two-person zero-sum games and explain how they are represented using payoff matrices. Explain the principle of dominance
- bA self-service store employs one cashier at its counter. Nine customers arrive on an average every 5 minutes while the cashier can serve 10 customers in 5 minutes. Assuming Poisson distribution for arrival rate and exponential distribution for the service time, find: i) Average number of customers in the syste m. ii) Ave ra ge number of customers in the queue or average queue length. iii) Average time a customer spends in the system. iv) Average time a customer wait s before being served
- aExplain the steps involved in Monte Carlo simulation. Discus s the application of Monte Carlo Simulation in engineering
- bConsider a capital budgeting problem where a company needs to d ecide on the allocation of funds to different investment projects. The company has a budget of $100,000 and five investment options with the following initial investments and expected returns: Investmen Initial Investment ($) Expected Return ($) Using Dynamic Programming, determine the optimal investment str ategy that maximizes the company's expected return within the budget constraint
- aExplain the fundamentals of network analysis, including the con struction of network diagrams and the rules for drawing them. Illustrate wit h a practical engineering scenario where network analysis can be applied to p lan and manage project activities effectively
- bConsider a manufacturing facility with three machines: M1, M 2, and M3. There are four jobs, labelled as Job 1, Job 2, Job 3, and Job 4, that need to be processed on these machines. The processing times (in hours) for each job on each machine are given in the table below: Job M1 M2 M3 Job 1 2 3 1 Job 2 4 2 3 Job 3 3 1 2 Job 4 2 3 4 Assuming that each job must be processed sequentially on the ma chines in the given order (M1, M2, M3), find the optimal sequence of jobs and calculate the total processing time required
- aA distribution company has three warehouses (W1, W2, W3) and four retail stores (S1, S2, S3, S4). The transportation costs in rupees per unit are given in the table below: Each warehouse has a limited supply of goods: W1 can supply 100 units, W2 can supply 150 units, and W3 can supply 200 units. Each store has a demand requirement: S1 requires 100 units, S2 requires 130 units, S3 r equires 120 units, and S4 requires 100 units. Use transportation model to determin e the optimal allocation of goods from the warehouses to the stores which min imizes the total transportation cost
- bA manufacturing company produces two types of products: Product A and Product B. Each unit of Product A requires 2 hours of labour an d 1 hour of machine time, while each unit of Product B requires 1 hour of labour and 3 hours of machine time. The company has 100 hours of labour and 120 hours of machine time available per-week. Product A sells for $50 per unit and P roduct B sells for $40 per unit. The company wants to maximize its weekly profit. Formulate this problem as a linear programming model and find the optimal prod uction quantities for Products A and B to maximize the weekly profit u sing the graphical method
Question text is extracted from the official AKTU question paper PDF above. Hindi translations are omitted — every question is printed in English in the original paper. Last verified: 2026-08-23.
Repeated Questions — KOE086
Questions that appeared in more than one session, found by comparing 4 years of Industrial Optimization Techniques papers (2021-22, 2022-23, 2023-24, 2024-25)
Differentiate between CPM and PERT. 02 2
Appeared in: 2022-23 · 2023-24
Explain the steps involved in Monte Carlo simulation. Discus s the application of Monte Carlo Simulation in engineering
Appeared in: 2022-23 · 2023-24
Industrial Optimization Techniques — Other Year Papers
AKTU Industrial Optimization Techniques PYQs from other sessions
More B.Tech Semester 8 (2023-24) Papers
Other subjects from same semester and session
Syllabus & More PYQs
Paper solve karne se pehle unit-wise syllabus dekh lo