INDUSTRIAL OPTIMIZATION TECHNIQUES (KOE-086)
B.Tech Semester VIII – Theory Answers
SECTION A
(a) Key row, key column and limiting ratio
In the simplex method of linear programming, the key column is identified as the column having the most negative value in the objective function row for a maximization problem. This column indicates the entering variable. The key row is determined by calculating the limiting ratios, which are obtained by dividing the right-hand-side values by the corresponding positive elements of the key column. The smallest non-negative ratio determines the key row, and the intersection of the key row and key column gives the pivot element. The limiting ratio ensures feasibility of the solution while moving towards optimality.
(b) Optimization
Optimization is the process of finding the best possible solution to a problem from a set of feasible alternatives, subject to given constraints. In industrial optimization, the objective may be to minimize cost, time, or resource usage, or to maximize profit, efficiency, or productivity. Optimization techniques help management make rational and scientific decisions.
(c) Difference between CPM and PERT
CPM (Critical Path Method) is a deterministic project management technique where activity durations are known with certainty. PERT (Program Evaluation and Review Technique) is probabilistic in nature and uses three time estimates for activities. CPM is mainly used in construction and industrial projects, while PERT is preferred for research and development projects where uncertainty exists.
(d) Transshipment problem
The transshipment problem is an extension of the transportation problem in which goods may be shipped from sources to intermediate points and then to destinations. These intermediate points can act as both supply and demand nodes. The objective is to minimize the total transportation cost while satisfying all supply and demand constraints.
(e) Game Theory
Game theory is a mathematical approach to analyze situations involving conflict or competition between two or more rational decision-makers. It helps determine optimal strategies when the outcome depends on the actions of all players. Game theory is widely used in economics, business strategy, military planning, and industrial decision-making.
(f) Queuing Theory
Queuing theory is the study of waiting lines or queues. It analyzes system performance in terms of waiting time, queue length, and service efficiency. In industries, queuing theory is applied to optimize service systems such as machine repair, customer service centers, traffic flow, and production lines.
(g) Advantages and disadvantages of simulation
Simulation allows the study of complex systems without disturbing real operations. It helps analyze risk, test alternative strategies, and understand system behavior. However, simulation models can be time-consuming, expensive to develop, and do not guarantee optimal solutions. Results also depend heavily on the accuracy of input data.
(h) Dynamic programming with example
Dynamic programming is an optimization technique that solves complex problems by breaking them into smaller overlapping sub-problems. Each sub-problem is solved once and stored for future use. For example, in shortest path problems, dynamic programming determines the minimum distance by evaluating stage-wise decisions.
(i) Replacement model in industrial optimization
The replacement model determines the optimal time to replace equipment or components that deteriorate over time. The objective is to minimize total cost considering maintenance, operating cost, and replacement cost. It helps industries decide whether to repair or replace assets.
(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 initiated, including administrative and preparation expenses. Holding cost is the cost of storing inventory, including warehousing, insurance, and deterioration. Inventory models balance these two costs to determine optimal order quantity.
SECTION B
2(a) Transportation problem – least cost schedule
The transportation problem aims to determine the most economical way of transporting goods from multiple warehouses to multiple demand points while satisfying supply and demand constraints. By applying methods such as the least cost method or Vogel’s approximation method, an initial feasible solution is obtained, which is then tested for optimality. The objective is to minimize the total transportation cost while efficiently utilizing available supply.
2(b) Optimistic, pessimistic and most likely time in PERT
In PERT, optimistic time is the shortest possible time required to complete an activity under ideal conditions. Pessimistic time is the longest possible time under unfavorable conditions, while most likely time is the normal expected duration. The expected time is calculated using a weighted average of these three estimates. PERT is widely used in industries for project planning, scheduling, and risk analysis.
2(c) Game problem with coin selection
This problem represents a two-person zero-sum game where players select coins strategically. By constructing a payoff matrix and analyzing strategies, optimal mixed strategies for both players are determined. The value of the game indicates expected gain or loss when both players use optimal strategies.
2(d) Monte Carlo simulation
Monte Carlo simulation is a probabilistic technique that uses random numbers to simulate real-life systems. The steps include defining the problem, generating random variables, simulating system behavior, and analyzing results. In engineering, it is used for reliability analysis, risk assessment, inventory control, and project management.
2(e) Deterministic and probabilistic inventory models
Deterministic inventory models assume known and constant demand, while probabilistic models consider demand uncertainty. Deterministic models are used where demand is stable, whereas probabilistic models are applied in real-world situations involving randomness. Both models help optimize inventory levels and reduce costs.
SECTION C
3(a) Graphical solution of linear programming problem and its limitations
The graphical method solves linear programming problems by plotting constraints on a graph and identifying the feasible region. The optimal solution lies at one of the corner points of the feasible region. While this method is simple and intuitive, it is limited to problems with only two decision variables and is not suitable for large-scale industrial problems.
3(b) Dual simplex method
The dual simplex method is used when the initial solution is infeasible but optimality conditions are satisfied. The method iteratively improves feasibility while maintaining optimality. It is useful in post-optimality analysis and problems involving changes in constraints.
4(a) Sequencing of n jobs on three machines
Sequencing determines the order of processing jobs to minimize total elapsed time. For three-machine problems, Johnson’s rule is extended by reducing it to a two-machine problem under specific conditions. Proper sequencing improves machine utilization and reduces idle time.
4(b) Critical Path Method (CPM)
CPM is a project scheduling technique used to identify the longest path of activities in a project. This critical path determines the minimum project completion time. CPM involves defining activities, estimating durations, constructing the network, identifying the critical path, and monitoring progress.
5(a) Queuing system comparison
By analyzing single-channel and multi-channel queuing systems using M/M/S models, performance measures such as average waiting time and queue length are compared. Such analysis helps determine the most efficient service configuration.
5(b) Game theory terminology
Game theory concepts such as pure strategy, mixed strategy, saddle point, dominance, and value of the game help analyze competitive situations. These concepts guide optimal decision-making in conflict scenarios.
6(a) Simulation model
Simulation is the imitation of real-world systems using mathematical or logical models. Its elements include input variables, system logic, random number generation, and output analysis. Simulation is useful when analytical solutions are difficult.
6(b) Dynamic programming algorithm
Dynamic programming algorithms solve multistage decision problems by breaking them into stages and states. Each stage’s decision affects the next stage. This approach ensures optimal decisions at every stage.
