Quiz: Optimization Strategies for Supply Chain Design — 11 Fragen

1. What best describes optimization in mathematical decision making?

A. Choosing any feasible solution that meets the constraints

B. Rewriting a problem so that every variable is binary

C. Searching for the best possible solution under given objectives and constraints

D. Estimating future demand using historical data only

Answer: (C)

Erklärung

Optimization is the search for the best possible solution subject to an objective and constraints. A feasible solution may satisfy the restrictions, but it is not necessarily the best one.

2. What is the primary goal of optimization in supply chain and beyond?

A. To find the most cost-effective solution within given constraints

B. To eliminate all sources of variability

C. To maximize the number of products produced

D. To simplify decision-making processes

Answer: (A)

Erklärung

Optimization aims to find the best solution under a set of objectives and constraints, often seeking cost reduction or profit maximization, rather than just simplifying or increasing production.

3. Which statement best illustrates predictive analytics as used in optimization?

A. An integer variable is relaxed to take only continuous values

B. The objective function is replaced by a set of constraints

C. A weather forecast is used as an input to support decisions under uncertainty

D. A fixed cost is treated as a transportation cost in the model

Answer: (C)

Erklärung

A weather forecast is a predictive analytics input that can feed an optimization model under uncertainty. The other options describe unrelated modeling changes.

4. Which of the following best describes the primary purpose of optimization in various fields like supply chain, sports scheduling, and radiotherapy?

A. To identify the most cost-effective or beneficial solution given objectives and constraints

B. To generate random solutions to test different scenarios

C. To ensure all decisions maximize the number of options

D. To find the worst possible solution within constraints

Answer: (A)

Erklärung

Optimization aims to find the best possible solution that satisfies all constraints and meets the objective, not the worst or a random solution.

5. What is a formal model in the model-based decision-making framework?

A. A mathematical representation using variables, constraints, and an objective

B. A forecast that predicts the future value of a variable

C. A numerical table used only to summarize data

D. A solver setting that changes spreadsheet cells

Answer: (A)

Erklärung

A formal model represents a situation mathematically with variables, constraints, and an objective. It is the core structure used before solving.

6. What is the main role of the linear programming structure in decision-making models?

A. To ensure all decisions are made without constraints

B. To establish a mathematical framework that identifies the best feasible decision according to a linear objective

C. To randomly generate possible solutions without restrictions

D. To find the most complex solution possible

Answer: (B)

Erklärung

The linear programming structure serves as a mathematical framework that helps identify the best feasible decision by maximizing or minimizing a linear objective while satisfying linear constraints. The other options do not accurately describe its role in decision-making.

7. What is the main purpose of model validation in this framework?

A. To convert all variables into binary form

B. To replace constraints with descriptive text

C. To choose the final answer without testing alternatives

D. To check whether the model represents the situation and whether the data are reliable

Answer: (D)

Erklärung

Validation checks both the realism of the model and the reliability of the data. It happens before searching for solutions, unlike choosing the final answer immediately.

8. When outlining the steps to develop a linear programming model, which sequence correctly reflects the chronological order of key issues to address?

A. Define decision variables with appropriate units, determine the objective function with correct units, write all constraints with proper units, and ensure non-negativity restrictions are included.

B. Start with writing all constraints without units, then define decision variables, specify the objective function, and add non-negativity restrictions.

C. Determine the objective function first, then define decision variables, followed by constraints, and finally check units for consistency.

D. Identify decision variables with units, ignore the objective function initially, then formulate constraints, and set non-negativity restrictions at the end.

Answer: (A)

Erklärung

The correct order is to first define decision variables with units, then determine the objective function in the correct units, write constraints with proper units for dimension consistency, and finally include non-negativity restrictions. This sequence ensures the model is dimensionally consistent and well-structured.

9. How does the linear programming solution approach with Excel Solver differ from a manual trial-and-error method in finding an optimal decision?

A. Excel Solver randomly changes decision variables and picks the best solution found, while trial-and-error tries all possible combinations.

B. Excel Solver requires the user to manually alter variables step-by-step, whereas trial-and-error automates this process.

C. Excel Solver only finds feasible solutions, not optimal ones, unlike trial-and-error which identifies the best.

D. Excel Solver systematically adjusts decision variables to satisfy constraints and optimize the objective, whereas trial-and-error relies on repeated guesses and adjustments without guarantee of optimality.

Answer: (D)

Erklärung

Excel Solver automates the process of adjusting decision variables systematically until it finds the optimal solution while satisfying all constraints, unlike manual trial-and-error which is less efficient and does not guarantee optimality.

10. Who is credited with formulating the concept of the knapsack problem as an example of integer programming?

A. George Dantzig

B. Edsger Dijkstra

C. Claude Shannon

D. Richard Bellman

Answer: (A)

Erklärung

George Dantzig is credited with formulating the knapsack problem as an example of integer programming, providing a foundational case for combinatorial optimization.

11. What is a common cause for increasing complexity in multi-supplier constraints in supply chain models?

A. Reducing the number of available suppliers to simplify decision-making.

B. Enforcing single supplier selection to minimize administrative costs.

C. Ignoring multi-supplier constraints to streamline procurement processes.

D. Adding more suppliers to meet diversification and risk management.

Answer: (D)

Erklärung

Increasing the number of suppliers introduces additional decision variables and constraints, making the model more complex. Limiting to a single supplier simplifies the problem but reduces flexibility.