Exam 3: Linear Programming: Formulation and Applications

A transportation problem will always return integer values for all decision variables.

Having one requirement for each location is a characteristic common to all transportation problems.

A linear programming problem where the objective is to find the best mix of ingredients for a product to meet certain specifications is called:

A resource constraint refers to any functional constraint with a ≥ sign in a linear programming model.

When formulating a linear programming model on a spreadsheet, the decisions to be made are located in the data cells.

Which of the following is not information needed to use the transportation model?

When formulating a linear programming model on a spreadsheet, the constraints are located (in part) in the output cells.

Where is the objective cell located?

Which of the following are categories of linear programming problems?

When studying a resource-allocation problem, it is necessary to determine the contribution per unit of each activity to the overall measure of performance.

It is usually quite simple to obtain estimates of parameters in a linear programming problem.

A firm has 4 plants that produce widgets. Plants A, B, and C can each produce 100 widgets per day. Plant D can produce 50 widgets per day. Each day, the widgets produced in the plants must be shipped to satisfy the demand of 3 customers. Customer 1 requires 75 units per day, customer 2 requires 100 units per day, and customer 3 requires 175 units per day. The shipping costs for each possible route are shown in the table below: Shipping\nobreakspaceCosts Customer per\nobreakspaceunit\nobreakspacePlant 1 2 3 \ 25 \ 35 \ 15 \ 20 \ 30 \ 40 \ 40 \ 35 \ 20 \ 15 \ 20 \ 25 The firm needs to satisfy all demand each day, but would like to minimize the total costs. Which of the following constraints is unnecessary for this problem (xi,j is the number of widgets shipped from factory i to customer j)?

Transportation problems always involve shipping goods from one location to another.

Resource-allocation problems have the following type of constraints:

Transportation problems are concerned with distributing commodities from sources to destinations in such a way as to minimize the total distribution cost.

The capacity row in a distribution-network formulation shows the maximum number of units than can be shipped through the network.

Linear programming does not permit fractional solutions.

A firm has 4 plants that produce widgets. Plants A, B, and C can each produce 100 widgets per day. Plant D can produce 50 widgets per day. Each day, the widgets produced in the plants must be shipped to satisfy the demand of 3 customers. Customer 1 requires 75 units per day, customer 2 requires 100 units per day, and customer 3 requires 175 units per day. The shipping costs for each possible route are shown in the table below: Shipping\nobreakspaceCosts Customer per\nobreakspaceunit\nobreakspacePlant 1 2 3 \ 25 \ 35 \ 15 \ 20 \ 30 \ 40 \ 40 \ 35 \ 20 \ 15 \ 20 \ 25 The firm needs to satisfy all demand each day, but would like to minimize the total costs. The firm's problem falls within which classification?

When formulating a linear programming model on a spreadsheet, the measure of performance is located in the objective cell.

A grocery store manager must decide how to best present a limited supply of milk and cookies to its customers. Milk can be sold by itself for a profit of $1.50 per gallon. Cookies can likewise be sold at a profit of $2.50 per dozen. To increase appeal to customers, one gallon of milk and a dozen cookies can be packaged together and are then sold for a profit of $3.00 per bundle. The manager has 100 gallons of milk and 150 dozen cookies available each day. The manager has decided to stock at least 75 gallons of milk per day and demand for cookies is always 140 dozen per day. To maximize profits, how much of each product should the manager stock. Which of the following is the objective function for the grocer's problem?