- Consider the following linear programming problem:Max Z = 4x1 + 2x2Subject to: x1 less or equal than 4 x2 less or equal than 2 x1, x2 ≥ 0The Z obtained from the best combination of x2 and x1 is:
- The linear programming problem below is unbounded.Max Z = 5x1 + 3x2s.t. 4x1 + 3x2 ≥ 8 x1 ≥ 4 x2 ≥ 6 x1, x2 ≥ 0T/F?
- The following linear programming problem has _________________Max Z = $40x1 + $10x2Subject to: 8x1 + 5x2 ≤ 80 2x1 + 1x2 ≥ 100 x1, x2 ≥ 0
- The break-even point is the volume that the profit is positive (greater than zero).
- If by processing the same amount of inputs used in the past a company is now capable to produce a(n) ________ amount of outputs, it means that an improvement of productivity was achieved.Please choose the option that best fits the empty space above.
- ___________________ refers to the ability of an organization to sell products in a market.
- Answer the following statement with TRUE or FALSE:The linear programming problem below is unbounded.Min Z = 5x1 + 3x2s.t. 4x1 + 3x2 less or equal than 8 x1 less or equal than 4 x2 less or equal than 6
- Which of the following combinations of constraints has no feasible region?x1 + x2 greater or equal than 15 and x1 - x2 less or equal than 10x1 + x2 greater or equal than 5 and x1 greater or equal than 10x1 + x2 greater or equal than 100 and x1 + x2 greater or equal than 50x1 + x2 greater or equal than 10 and x1 greater or equal than 5
- Consider the following linear programming problem:Max Z = $200x1 + $100x2Subject to: 8x1 + 5x2 ≤ 80 2x1 + x2 ≤ 100 x1, x2 ≥ 0What is maximum Z and the value of x1 and x2 at the optimal solution?
- Fixed cost includes:Answers: raw materials and resourcesstaff and management salariesmaterial handling and freightdirect labor and packagingnone of the above
- Consider the following linear programming problem:Max Z = $15x + $20ySubject to: 8x + 5y ≤ 40 0.4x + y ≥ 4 x, y ≥ 0Considering that the values for x and y that will maximize revenue are respectively x = 0 and y = 8, what is the amount of slack/surplus associated with the first constraint - in the optimal point?
- Answer the following statement with TRUE or FALSE: Sensitivity analysis is a way to deal with uncertainty in linear programming models.
- Assignment problems solved previously by linear programming techniques are also examples of
- If the objective function slope is exactly the same as one of the constraints and this specific constraint is redundant, we have a case of multiple optimal solutions.
- Answer the following statement with TRUE or FALSE: Sensitivity ranges can be computed only for the coefficients of the objective function.
- A decision variable in the media selection problem of maximizing audience exposure looks at?
- In linear programming, a statement such as "maximize contribution" becomes a(n)a. constraintb. slack variablec. objective functiond. violation of linearity e. decision variable
- A type of LP requiring that one or more of the decision variables take on an integer value in the final solution is
- The sensitivity range for an objective function coefficient is the range of values over which the current __________________ remains the same.
- Answer the following statement with TRUE or FALSE: the correct way to implement a sensitivity analysis for the second coefficient of the objective function is to vary not only the second coefficient but also the first one (at the same time).