Optimization and Mathematical Programming

A Criteria Based Matrix (also called a Decision Matrix or Pugh Matrix) is a decision-making tool used to evaluate multiple solutions against weighted criteria. It helps teams systematically compare alternatives and select the best solution based on objective criteria rather than subjective judgment. The matrix scores each solution against predetermined criteria to identify the optimal choice.

When a model has continuous signals but no continuous states (no differential equations requiring integration), a variable-step discrete solver is most efficient. It handles continuous signal propagation without the computational overhead of ODE solvers. Fixed-step solvers (A, B) are less flexible. Variable-step ODE solvers (D) are unnecessary without continuous states.

Variable-step ODE solvers dynamically adjust step size to maintain accuracy while optimizing efficiency. They take smaller steps during fast-changing dynamics and larger steps during smooth behavior, making them ideal for continuous systems. Fixed-step solvers either waste computation with unnecessarily small steps or lose accuracy with steps that are too large.

Solver is Excel's optimization tool used to find optimal solutions for models with constraints. It can maximize, minimize, or set a target value by adjusting variable cells within specified constraints. Scenario Manager only compares different scenarios but doesn't optimize. 'Target value' is not a tool but rather a parameter used within Goal Seek or Solver.

Dynamic programming optimizes by storing solutions to subproblems to avoid recomputation. Huffman coding optimizes compression by using shorter codes for frequent characters. Greedy algorithms optimize by making locally optimal choices at each step. Cyclic coding is not a standard optimization technique in algorithms.

Boolean solvers can solve sets of constraints using numerical analysis techniques like Gaussian elimination, which systematically eliminates variables to solve systems of linear equations or constraints. This method is fundamental in constraint satisfaction problems. Options A, B, and D describe binary/boolean concepts but are not examples of constraint-solving techniques.

Oracle Inventory Planning includes both Min-Max Planning (maintains stock between minimum and maximum levels) and Reorder Point Planning (triggers reorder when stock falls below a threshold). These are the two primary manual planning methods available in the module. Option C correctly combines both methods.

Primary clustering problem can be almost eliminated if we use quadratic probing scheme.

Profiling is a form of dynamic program analysis that measures, for example, the space or time complexity of a program, the usage of particular instructions, or frequency and duration of function calls. The most common use of profiling information is to aid program optimization.

It takes into account input variables, interrelationships among the variables, problem assumptions and constraints.

Loop jamming combines the multiple loops which perform different calculation for the same loop iteration.

Hill climbing search is a variant of generate and test strategy.

This algorithm is used to simulate complex systems in statistical physics and provides the method for obtaining a sequence of random samples from a probability distribution.

This algorithm of artificial intelligence provides a way to escape local maxima and is complete and optimal to give a long enough cooling schedule.

This algorithm of artificial intelligence avoids the pitfalls of depth first search by imposing a cutoff on the maximum depth of a path.