Question 1

____ variables are given coefficients of zero in the objective function of a minimization linear programming problem.

Accepted Answer

A)  Primal 
B)  Dual 
C)  Surplus 
D)  Dummy 
E)  none of the above 
A)  Primal 
B)  Dual 
C)  Surplus 
D)  Dummy 
E)  none of the above C

Question 2

In a minimization linear programming problem, the ____ variables are subtracted from the greater than or equal to ($\ge$ ) inequality constraints in order to convert these constraints to equalities.

Accepted Answer

A)  dual 
B)  primal 
C)  surplus 
D)  both a and b 
E)  both a and c 
A)  dual 
B)  primal 
C)  surplus 
D)  both a and b 
E)  both a and c C

Question 3

A dual variable equal to zero in the optimal solution to a profit-maximization linear programming problem indicates that the objective function will not increase if an additional unit of the given resources is made available.

Accepted Answer

A) True 
 B)False  True

Question 4

Which of the following statements concerning dual variables is (are) true?

Accepted Answer

A)  Dual variables are obtained automatically in an algebraic solution of a linear programming problem. 
B)  Dual variables are similar to the artificial variables used in the LaGrange Multiplier technique. 
C)  A dual variable indicates how much the objective function will change if one additional unit of a given resource is made available, provided that the increase in the resource does not shift the optimal solution to another corner of the feasible solution space. 
D)  a and c 
E)  a, b, and c 
A)  Dual variables are obtained automatically in an algebraic solution of a linear programming problem. 
B)  Dual variables are similar to the artificial variables used in the LaGrange Multiplier technique. 
C)  A dual variable indicates how much the objective function will change if one additional unit of a given resource is made available, provided that the increase in the resource does not shift the optimal solution to another corner of the feasible solution space. 
D)  a and c 
E)  a, b, and c

Question 5

An optimal solution of a linear programming problem always lies on the boundary of the feasible solution space.

Accepted Answer

A) True 
 B)False

Question 6

A computer solution of large-scale linear programming problems typically employs a procedure (or variation of the procedure) known as the ____ method.

Accepted Answer

A)  least squares 
B)  analysis of variance 
C)  simplex 
D)  primal/dual 
E)  none of the above 
A)  least squares 
B)  analysis of variance 
C)  simplex 
D)  primal/dual 
E)  none of the above

Question 7

If the primal linear programming problem has two variables and four constraints (excluding the non-negativity constraints), the corresponding dual linear programming problem will have ____.

Accepted Answer

A)  two variables and four constraints 
B)  four variables and two constraints 
C)  two variables and two constraints 
D)  four variables and four constraints 
E)  none of the above 
A)  two variables and four constraints 
B)  four variables and two constraints 
C)  two variables and two constraints 
D)  four variables and four constraints 
E)  none of the above

Question 8

A primal linear programming problem has multiple optimal solutions if it contains two or more variables.

Accepted Answer

A) True 
 B)False

Question 9

In a maximization linear programming problem, the ____ variables represent the difference between the right-hand sides and left-hand sides of less than or equal to ($\le$ ) inequality constraints.

Accepted Answer

A)  dual 
B)  slack 
C)  primal 
D)  both a and b 
E)  none of the above 
A)  dual 
B)  slack 
C)  primal 
D)  both a and b 
E)  none of the above

Question 10

The fixed per-unit profit contribution coefficients of the objective function in a linear programming problem imply the following economic assumptions except:

Accepted Answer

A)  selling prices per unit of the products (outputs) are constant 
B)  constant returns to scale in the production process 
C)  buying prices per unit of the resources (inputs) are proportional to the amount purchased 
D)  both b and c 
E)  both a and c 
A)  selling prices per unit of the products (outputs) are constant 
B)  constant returns to scale in the production process 
C)  buying prices per unit of the resources (inputs) are proportional to the amount purchased 
D)  both b and c 
E)  both a and c

Question 11

The Value-Pack Canning Company buys fresh fruits and vegetables from farmers, processes and cans them, and sells the output to various supermarket chains. The company is trying to determine the optimal mix of peas and green beans to process during the forthcoming period at its Fresno plant. Output is limited by the capacity of the plant and the firm's financial resources. The plant can process 4,000,000 pounds of peas or green beans (or any linear combination thereof) during the forthcoming period. The company buys peas and green beans for $.10 and $.20 per pound respectively. Purchases must be paid for at the time of delivery and the firm's current cash balance limits purchases to $600,000 during the forthcoming period. As part of long-term contracts with several supermarket chains, the firm is required to process at least 800,000 pounds of peas and 1,200,000 pounds of green beans during the period. The profit contribution of peas and green beans are $.015 and $.025 respectively. The firm desires to find the mix of peas and green beans to produce in order to maximize the total profit contribution of the plant during the forthcoming period. Let X1 be the number of pounds of peas processed and X2 be the number of pounds of green beans processed.
(a)Formulate the problem algebraically in the linear programming framework.
(b)Using graphical methods, determine the optimal mix of vegetables to process.

Accepted Answer

(a) @#IMG-DLM& (b)
 @#IMG-DLM& The optimal solution occurs a

Question 12

Slack variables are given coefficients of ____ in the objective function.

Accepted Answer

A)  +1 
B)  0 
C)  -1 
D)  +.00001 
E)  none of the above 
A)  +1 
B)  0 
C)  -1 
D)  +.00001 
E)  none of the above

____ variables are given coefficients of zero in the objective function of a minimization linear programming problem.

In a minimization linear programming problem, the ____ variables are subtracted from the greater than or equal to ( $\ge$ ) inequality constraints in order to convert these constraints to equalities.

A dual variable equal to zero in the optimal solution to a profit-maximization linear programming problem indicates that the objective function will not increase if an additional unit of the given resources is made available.

Which of the following statements concerning dual variables is (are) true?

An optimal solution of a linear programming problem always lies on the boundary of the feasible solution space.

A computer solution of large-scale linear programming problems typically employs a procedure (or variation of the procedure) known as the ____ method.

If the primal linear programming problem has two variables and four constraints (excluding the non-negativity constraints), the corresponding dual linear programming problem will have ____.

A primal linear programming problem has multiple optimal solutions if it contains two or more variables.

In a maximization linear programming problem, the ____ variables represent the difference between the right-hand sides and left-hand sides of less than or equal to ( $\le$ ) inequality constraints.

The fixed per-unit profit contribution coefficients of the objective function in a linear programming problem imply the following economic assumptions except:

Slack variables are given coefficients of ____ in the objective function.

Fundamental Economic Concepts

Demand Analysis and Estimating Demand

Managing in the Global Economy , Business and Economic Forecasting

Production Economics,applications of Cost Theory and Cost Analysis

Pricing Techniques and Analysis

Differential Calculus Techniques in Management and Long-Term Investment Analysis

Pricing of Joint Products and Transfer Pricing

Decisions Under Risk and Uncertainty

Filters

Exam 7: Linear Programming Applications

____ variables are given coefficients of zero in the objective function of a minimization linear programming problem.

In a minimization linear programming problem, the ____ variables are subtracted from the greater than or equal to ( ≥\ge≥ ) inequality constraints in order to convert these constraints to equalities.

A dual variable equal to zero in the optimal solution to a profit-maximization linear programming problem indicates that the objective function will not increase if an additional unit of the given resources is made available.

Which of the following statements concerning dual variables is (are) true?

An optimal solution of a linear programming problem always lies on the boundary of the feasible solution space.

A computer solution of large-scale linear programming problems typically employs a procedure (or variation of the procedure) known as the ____ method.

If the primal linear programming problem has two variables and four constraints (excluding the non-negativity constraints), the corresponding dual linear programming problem will have ____.

A primal linear programming problem has multiple optimal solutions if it contains two or more variables.

In a maximization linear programming problem, the ____ variables represent the difference between the right-hand sides and left-hand sides of less than or equal to ( ≤\le≤ ) inequality constraints.

The fixed per-unit profit contribution coefficients of the objective function in a linear programming problem imply the following economic assumptions except:

Slack variables are given coefficients of ____ in the objective function.

Fundamental Economic Concepts

Demand Analysis and Estimating Demand

Managing in the Global Economy , Business and Economic Forecasting

Production Economics,applications of Cost Theory and Cost Analysis

Pricing Techniques and Analysis

Differential Calculus Techniques in Management and Long-Term Investment Analysis

Pricing of Joint Products and Transfer Pricing

Decisions Under Risk and Uncertainty

Filters

In a minimization linear programming problem, the ____ variables are subtracted from the greater than or equal to ( $\ge$ ) inequality constraints in order to convert these constraints to equalities.

In a maximization linear programming problem, the ____ variables represent the difference between the right-hand sides and left-hand sides of less than or equal to ( $\le$ ) inequality constraints.