A) quantities to be maximized in a linear programming model. B) quantities to be minimized in a linear programming model. C) restrictions that limit the settings of the decision variables. D) input variables that can be controlled during optimization. A) quantities to be maximized in a linear programming model. B) quantities to be minimized in a linear programming model. C) restrictions that limit the settings of the decision variables. D) input variables that can be controlled during optimization.

Exam 12: Linear Optimization Models

In a linear programming model, the __________ assumption plus the nonnegativity constraints mean that decision variables can take on any value greater than or equal to zero.

(Multiple Choice)

4.9/5

(34)

Question 21

Rob is a financial manager with Sharez, an investment advisory company. He must select specific investments-for example, stocks and bonds-from a variety of investment alternatives. Which of the following statements is most likely to be the objective function in this scenario?

(Multiple Choice)

4.8/5

(31)

Question 22

The reduced cost for a decision variable that appears in a Sensitivity Report indicates the change in the optimal objective function value that results from changing the right-hand side of the nonnegativity constraint from

(Multiple Choice)

4.9/5

(39)

Question 23

Suppose that profit for a particular product is calculated using the linear equation: Profit = 20S + 3D. Which of the following combinations of S and D would yield a maximum profit?

(Multiple Choice)

4.9/5

(36)

Question 24

A variable subtracted from the left-hand side of a greater-than-or-equal to constraint to convert the constraint into an equality is known as a(n)

(Multiple Choice)

4.9/5

(31)

Question 25

A(n) __________ refers to a set of points that yield a fixed value of the objective function.

(Multiple Choice)

4.7/5

(43)

Question 26

A controllable input for a linear programming model is known as a

(Multiple Choice)

4.8/5

(31)

Question 27

The reduced cost for a decision variable that appears in a Sensitivity Report refers to the __________ of the nonnegativity constraint for that variable.

(Multiple Choice)

4.8/5

(37)

Question 28

The points where constraints intersect on the boundary of the feasible region are termed as the

(Multiple Choice)

4.9/5

(35)

Question 29

__________ is the situation in which no solution to the linear programming problem satisfies all the constraints.

(Multiple Choice)

4.7/5

(35)

Question 30

The slack value for binding constraints is

(Multiple Choice)

4.9/5

(28)

Question 31

Constraints are

(Multiple Choice)

4.9/5

(33)

Question 32

In problem formulation, the

(Multiple Choice)

4.8/5

(29)

Question 33

Zen, Inc. manufactures two types of products, the G.1 and the T.1 models. The manufacturing process consists of two principal departments: production and assembly. The production department has 58 skilled workers, each of whom works 7 hours per day. The assembly department has 25 workers, who also work a 7-hour shift. On an average, to produce a G.1 model, Zen, Inc. requires 3.5 labor hours for production and 2 labor hours for assembly. The T.1 model requires 4 labor hours for production and 1.5 labor hours in assembly. The company anticipates selling at least 1.5 times as many T.1 models as G.1 models. The company operates five days per week and makes a net profit of $130 on the G.1 model, and $150 on the T.1 model. Zen, Inc. wants to determine how many of each model should be produced on a weekly basis to maximize net profit. Formulate the problem. Let G = the number of G.1 product produced each week. Let T = the number of T.1 product produced each week. Maximize 130G + 150T s.t. production's labor constraint 3.5G + 4T ≤ 2030 assembly's labor constraint 2G + 1.5T ≤ 875

(Essay)

4.7/5

(42)

Question 34

Zen, Inc. manufactures two types of products, the G.1 and the T.1 models. The manufacturing process consists of two principal departments: production and assembly. The production department has 58 skilled workers, each of whom works 7 hours per day. The assembly department has 25 workers, who also work a 7-hour shift. On an average, to produce a G.1 model, Zen, Inc. requires 3.5 labor hours for production and 2 labor hours for assembly. The T.1 model requires 4 labor hours for production and 1.5 labor hours in assembly. The company anticipates selling at least 1.5 times as many T.1 models as G.1 models. The company operates five days per week and makes a net profit of $130 on the G.1 model, and $150 on the T.1 model. Zen, Inc. wants to determine how many of each model should be produced on a weekly basis to maximize net profit. Solve Using the Excel Solver tool.

(Essay)

4.8/5

(37)

Question 35

A canned food manufacturer has its manufacturing plants in three locations across a state. Their product has to be transported to 3 central distribution centers, which in turn disperse the goods to 72 stores across the state. Which of the following visualization tools could help understand this problem better?

(Multiple Choice)

4.7/5

(47)

Question 36

The term __________ refers to the expression that defines the quantity to be maximized or minimized in a linear programming model.

(Multiple Choice)

4.8/5

(29)

Question 37

In linear programming models of real problems, the occurrence of an unbounded solution means that the

(Multiple Choice)

4.9/5

(29)

Question 38

Showing 21 - 38 of 38

In a linear programming model, the __________ assumption plus the nonnegativity constraints mean that decision variables can take on any value greater than or equal to zero.

Rob is a financial manager with Sharez, an investment advisory company. He must select specific investments-for example, stocks and bonds-from a variety of investment alternatives. Which of the following statements is most likely to be the objective function in this scenario?

The reduced cost for a decision variable that appears in a Sensitivity Report indicates the change in the optimal objective function value that results from changing the right-hand side of the nonnegativity constraint from

Suppose that profit for a particular product is calculated using the linear equation: Profit = 20S + 3D. Which of the following combinations of S and D would yield a maximum profit?

A variable subtracted from the left-hand side of a greater-than-or-equal to constraint to convert the constraint into an equality is known as a(n)

A(n) __________ refers to a set of points that yield a fixed value of the objective function.

A controllable input for a linear programming model is known as a

The reduced cost for a decision variable that appears in a Sensitivity Report refers to the __________ of the nonnegativity constraint for that variable.

The points where constraints intersect on the boundary of the feasible region are termed as the

__________ is the situation in which no solution to the linear programming problem satisfies all the constraints.

The slack value for binding constraints is

Constraints are

In problem formulation, the

The term __________ refers to the expression that defines the quantity to be maximized or minimized in a linear programming model.

In linear programming models of real problems, the occurrence of an unbounded solution means that the

Introduction

Descriptive Statistics

Data Visualization

Descriptive Data Mining

Probability: an Introduction to Modeling Uncertainty

Statistical Inference

Linear Regression

Time Series Analysis and Forecasting

Predictive Data Mining

Spreadsheet Models

Monte Carlo Simulation

Integer Linear Optimization Models

Nonlinear Optimization Models

Decision Analysis

Filters

Exam 12: Linear Optimization Models

In a linear programming model, the __________ assumption plus the nonnegativity constraints mean that decision variables can take on any value greater than or equal to zero.

Rob is a financial manager with Sharez, an investment advisory company. He must select specific investments-for example, stocks and bonds-from a variety of investment alternatives. Which of the following statements is most likely to be the objective function in this scenario?

The reduced cost for a decision variable that appears in a Sensitivity Report indicates the change in the optimal objective function value that results from changing the right-hand side of the nonnegativity constraint from

Suppose that profit for a particular product is calculated using the linear equation: Profit = 20S + 3D. Which of the following combinations of S and D would yield a maximum profit? ​

A variable subtracted from the left-hand side of a greater-than-or-equal to constraint to convert the constraint into an equality is known as a(n)

A(n) __________ refers to a set of points that yield a fixed value of the objective function.

A controllable input for a linear programming model is known as a

The reduced cost for a decision variable that appears in a Sensitivity Report refers to the __________ of the nonnegativity constraint for that variable.

The points where constraints intersect on the boundary of the feasible region are termed as the

__________ is the situation in which no solution to the linear programming problem satisfies all the constraints.

The slack value for binding constraints is

Constraints are

In problem formulation, the

The term __________ refers to the expression that defines the quantity to be maximized or minimized in a linear programming model.

In linear programming models of real problems, the occurrence of an unbounded solution means that the

Introduction

Descriptive Statistics

Data Visualization

Descriptive Data Mining

Probability: an Introduction to Modeling Uncertainty

Statistical Inference

Linear Regression

Time Series Analysis and Forecasting

Predictive Data Mining

Spreadsheet Models

Monte Carlo Simulation

Integer Linear Optimization Models

Nonlinear Optimization Models

Decision Analysis

Filters

Suppose that profit for a particular product is calculated using the linear equation: Profit = 20S + 3D. Which of the following combinations of S and D would yield a maximum profit?