(SEM VIII) THEORY EXAMINATION 2024-25 INDUSTRIAL OPTIMIZATION TECHNIQUE

INDUSTRIAL OPTIMIZATION TECHNIQUES (KOE086)

B.Tech – Semester VIII | Theory Examination (2024–25)

SECTION A

(Attempt all questions – brief but descriptive)

a) Need for Optimization

Optimization is required to achieve the best possible outcome under given constraints using limited resources. In industrial and engineering problems, resources such as time, cost, manpower, and materials are always limited. Optimization helps in selecting the most efficient alternative that minimizes cost, maximizes profit, reduces waste, or improves system performance. Without optimization, decision-making becomes inefficient and may lead to unnecessary losses or poor utilization of resources.

b) Mathematical Formulation of a Problem

Mathematical formulation of a problem refers to expressing a real-life decision-making situation in the form of mathematical equations and inequalities. It involves defining decision variables, an objective function to be maximized or minimized, and a set of constraints that represent system limitations. This formulation converts a practical problem into a structured mathematical model that can be solved using optimization techniques.

c) Critical Path Method (CPM)

Critical Path Method is a network-based project planning and scheduling technique used to determine the minimum project completion time. CPM identifies the sequence of activities that have zero slack and directly influence project duration. Any delay in critical activities results in project delay. CPM is widely used in construction, manufacturing, and maintenance planning to control time and resources effectively.

d) Dynamic Programming

Dynamic programming is an optimization technique used to solve complex problems by breaking them into simpler subproblems. Each subproblem is solved only once, and its solution is stored for future use. The method works on the principle of optimality, which states that an optimal solution of a problem contains optimal solutions of its subproblems. It is particularly useful in multistage decision problems.

e) Queueing Model

A queueing model is a mathematical representation of waiting line systems where customers arrive, wait for service, and then leave after being served. It helps analyze congestion, waiting time, system capacity, and service efficiency. Queueing models are widely used in engineering applications such as traffic systems, communication networks, and production lines.

f) Simulation

Simulation is a technique used to study the behavior of complex systems by creating a computer-based model that imitates real-life operations. Instead of solving mathematical equations, simulation experiments are conducted to observe system performance under different conditions. Simulation is especially useful when analytical solutions are difficult or impossible.

g) Network Logic

Network logic refers to the logical relationship and dependency among activities in a project network. It defines the sequence in which activities must be performed and ensures proper coordination. Network logic is essential for constructing PERT and CPM networks and for identifying critical activities.

h) Dynamic Programming with Example

Dynamic programming involves dividing a decision problem into stages, with each stage representing a decision point. For example, in a resource allocation problem, decisions are made stage by stage to distribute limited resources among competing activities. By solving each stage optimally, the overall optimal solution is obtained.

i) Replacement Model in Industrial Optimization

A replacement model determines the optimal time for replacing equipment or components to minimize total cost. It considers factors such as maintenance cost, replacement cost, failure rate, and operating efficiency. Replacement models help industries decide whether to repair existing equipment or replace it with new ones.

j) Set-up Cost and Holding Cost in Inventory Model

Set-up cost refers to the cost incurred each time an order is placed or production is started, including administrative and preparation costs. Holding cost is the cost of storing inventory over time, including warehousing, insurance, and deterioration costs. Both costs are critical in determining optimal inventory levels.

SECTION B

(Attempt any three – long descriptive answers)

a) Simplex Method and Dual Simplex Method

The Simplex method is an algorithm used to solve linear programming problems by iteratively moving from one feasible solution to another until the optimal solution is reached. It is widely applied in engineering for resource allocation and production planning. The Dual Simplex method works in reverse, starting with an infeasible solution and moving toward feasibility while maintaining optimality. Both methods are powerful tools for solving optimization problems efficiently.

b) Transportation Model

The transportation model is a special type of linear programming problem used to determine the most cost-effective way of transporting goods from multiple sources to multiple destinations. It involves minimizing total transportation cost while satisfying supply and demand constraints. Methods such as the North-West Corner rule and Vogel’s Approximation Method are used to find initial solutions, which are then optimized using the MODI method.

c) Forward and Backward Computation in PERT

Forward computation in PERT determines the earliest start and finish times of project activities, while backward computation determines the latest allowable start and finish times without delaying the project. By comparing these values, slack time is calculated and critical activities are identified. This analysis helps in effective project scheduling and control.

d) Monte Carlo Simulation

Monte Carlo simulation is a probabilistic simulation technique that uses random numbers to model uncertainty in system parameters. It is used to evaluate risk and variability in engineering problems such as reliability analysis, inventory control, and financial planning. By performing repeated simulations, probable outcomes and system behavior can be predicted.

e) Individual and Group Replacement Policies

Individual replacement policy replaces items as and when they fail, whereas group replacement policy replaces all items at fixed intervals regardless of their condition. Group replacement is economical when failure rates increase with time. These policies are applied in industries dealing with bulbs, tools, and machine parts.

SECTION C

Mathematical Programming Formulation of Design Problems

Design problems can be formulated as mathematical programming problems by defining design variables, performance objectives, and constraints. For example, minimizing the weight of a structural component subject to strength and safety constraints can be expressed mathematically and solved using optimization techniques.

Historical Development of Optimization

Optimization has evolved from classical calculus-based methods to modern computational algorithms. Early developments focused on analytical solutions, while modern optimization uses linear programming, nonlinear programming, dynamic programming, and metaheuristic algorithms to solve complex industrial problems.

Sequencing and Its Relevance in Engineering

Sequencing is the process of determining the order in which jobs are processed on machines. In engineering, proper sequencing reduces total processing time and idle time. In the case of two jobs through multiple machines, optimal sequencing ensures efficient utilization of resources and timely job completion.

Travelling Salesman Problem

The Travelling Salesman Problem involves finding the shortest possible route that visits each location exactly once and returns to the starting point. It has applications in logistics, routing, circuit design, and scheduling. Solving this problem helps minimize travel distance and operational cost.

Principle of Dominance

The principle of dominance is used in sequencing problems to eliminate inferior solutions. If one sequence is better than another in all conditions, the inferior sequence is discarded. This reduces problem complexity and helps find optimal solutions efficiently.

Single Server Queue Model

The single server queue model represents systems with one service facility and random arrivals. It is applied in engineering systems such as machine repair shops and communication channels to analyze waiting time and service efficiency.

Capital Budgeting and Cargo Loading Problems

Capital budgeting involves selecting investment projects that maximize returns under budget constraints. The cargo loading problem focuses on loading goods optimally to maximize profit or minimize weight. Both problems are solved using optimization techniques.

Types of Simulation

Simulation can be classified into deterministic and stochastic simulation. Deterministic simulation uses fixed inputs, while stochastic simulation incorporates randomness. These methods are widely used in production planning and system analysis.

Inventory Models and Equipment Renewal

Deterministic inventory models assume known demand, while probabilistic models account for uncertainty. Equipment renewal problems focus on determining the best time to replace machines to minimize long-term cost and maintain efficiency.