LESSON 3: MODELING AND SOLVING LINEAR PROGRAMMING PROBLEMS IN A SPREADSHEET Flashcards

1
Q

In a supply chain optimization problem, what is the main goal of linear programming?

A. Maximizing profit
B. Minimizing cost
C. Maximizing revenue
D. Maximizing market share

A

Maximizing revenue

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

A company wants to determine the optimal production quantities for two products. Which type of linear programming model should they use?

A. Integer Linear Programming
B. Sensitivity Analysis
C. Goal Programming
D. Transportation Model

A

Integer Linear Programming

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

In a linear programming problem, what is the purpose of the objective function?

A. To identify constraints
B. To determine decision variables
C. To represent the goal to be optimized
D. To define the decision space

A

To represent the goal to be optimized

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Which of the following is a real-world business application that can be optimized using linear programming?

A. Stock market prediction
B. Employee scheduling
C. Weather forecasting
D. Movie recommendation

A

Employee scheduling

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

A manufacturing company is looking to optimize the mix of products to maximize profit. What is the term for the values that need to be determined to achieve this?

A. Decision variables
B. Objective values
C. Constraints
D. Sensitivity variables

A

Decision variables

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

An advertising agency wants to allocate its budget across various marketing channels to maximize the reach while staying within budget. Which linear programming constraint represents the budget limitation?

A. Greater than or equal to constraint
B. Less than or equal to constraint
C. Equality constraint
D. Slack variable

A

Less than or equal to constraint

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

In a linear programming model, if a constraint is expressed as “≥,” what does this mean?

A. It is a hard constraint that must be met
B. It represents an objective function
C. It is a soft constraint that can be violated to some extent
D. It is an infeasible constraint

A

It is a soft constraint that can be violated to some extent

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

A retail store aims to maximize its profit by allocating shelf space to different product categories. What type of linear programming model should be used?

A. Sensitivity analysis
B. Goal programming
C. Integer linear programming
D. Allocation problem

A

Integer linear programming

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

In a linear programming problem, what is the purpose of the constraint matrix?

A. To represent the coefficients of the decision variables in the objective function.
B. To define the values of the decision variables.
C. To specify the constraints and their coefficients.
D. To calculate sensitivity values

A

To specify the constraints and their coefficients

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Which type of linear programming problem allows for non-integer solutions but is widely used in optimization scenarios involving prescriptive analytics?

A. Transportation Model
B. Integer Linear Programming
C. Goal Programming
D. Linear Programming

A

Linear Programming

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Which of the following is NOT a common application of linear programming in business?

A. Inventory management
B. Production planning
C. Social media marketing
D. Supply chain optimization

A

Social media marketing

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Which type of linear programming problem involves maximizing or minimizing a quantity (e.g., profit or cost) subject to constraints?
A. Maximization problem
B. Minimization problem
C. Equalization problem
D. None of the above

A

None of the above

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What does the objective function in linear programming represent?

A. The constraints of the problem
B. The decision variables
C. The goal or criterion to be optimized
D. The total cost

A

The goal or criterion to be optimized

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

In a linear programming model, what is the feasible solution space?

A. The set of all possible solutions
B. The set of solutions that maximize the objective function
C. The set of solutions that satisfy all constraints
D. The set of solutions that minimize the objective function

A

The set of solutions that satisfy all constraints

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Which of the following is a common method for solving linear programming problems in a spreadsheet?

A. Pivot tables
B. Solver add-in
C. VLOOKUP function
D. IF statements

A

Solver add-in

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What is the purpose of sensitivity analysis in linear programming?

A. To determine the feasible solution space
B. To analyze the impact of changes in problem parameters on the optimal solution
C. To find the initial basic feasible solution
D. To calculate the objective function coefficients

A

To analyze the impact of changes in problem parameters on the optimal solution

17
Q

Which of the following is a key component of a linear programming model in a spreadsheet?

A. Data validation
B. Decision variables
C. Sorting and filtering
D. Conditional formatting

A

Decision variables

18
Q

What type of constraint is represented by an equation that must be satisfied exactly in a linear programming problem?

A. Equality constraint
B. Inequality constraint
C. Less-than-or-equal constraint
D. Greater-than-or-equal constraint

A

Equality constraint

19
Q

In a linear programming problem, if a constraint is not binding, it means that which of the subsequent?

A. The constraint is violated
B. The constraint is not relevant
C. The constraint is not important
D. The constraint is limiting the solution

A

The constraint is not important

20
Q

Which of the following is a characteristic of an optimal solution in linear programming?

A. It violates one or more constraints
B. It maximizes the objective function
C. It is located outside the feasible region
D. It is the best possible solution among all feasible solutions

A

It is the best possible solution among all feasible solutions