- In a model, x1 ≥ 0 and integer, x2 ≥ 0, and x3 = 0, 1. Which solution would not be feasible?
- In a typical LP transportation model, the objective function value represents total shipping costs.
- In LP transportation problems, number of origins and number of destinations are not always equal.
- A marketing research firm must determine how many daytime interviews (D) and evening interviews (E) to conduct. At least 40% of the interviews must be in the evening. A correct modeling of this constraint is:
- A transshipment problem is a generalization of the transportation problem in which certain nodes are neither supply modes nor destination nodes
- When the number of agents exceeds the number of tasks in an assignment problem, one or more dummy tasks must be introduced in the LP formulation or else the LP will not have a feasible solution.
- A basic transportation problem with 3 sources and 4 destinations will have ________ decision variables.
- It is improper to combine manufacturing costs and overtime costs in the same objective function
- The assignment problem constraint x31 + x32 + x33 + x34 <= 3 means
- Linear programming is appropriate for financial problem situations such as
- When a route in a transportation problem is unacceptable, the corresponding variable can be removed from the LP formulation.
- If a basic transportation problem has 4 origins and 5 destinations, the LP formulation of the problem will have ________ regular constraints.
- Let Pij = the production of product i in period j. To specify that production of product 1 in period 3 and in period 4 differs by no more than 100 units,
- The number of units shipped from origin i to destination j is represented by
- In LP transportation models, some decision variables can be negative.
- The problem which deals with the distribution of goods from several sources to several destinations is the
- Rounded solutions to linear programs must be evaluated for
- Converting a transportation problem LP from cost minimization to profit maximization requires only changing the objective function; the conversion does not affect the constraints.
- An important part of the LP process is to take the time to ensure the linear programming model accurately reflects the real problem.
- A company makes two products, A and B. A sells for $100 and B sells for $90. Let x1 = the number of product A produced and x2 = the number of product B produced. The variable production costs are $30 per unit for A and $25 for B. The company's objective could be written as: