# Optimization and Linear Programming

1499 Words Jun 9th, 2012 6 Pages
DQ 17

A common form of the product-mix linear programming seeks to find the quantities of items in the product mix that maximizes profit in the presence of limited resources.
-True

Linear programming helps operations managers make decisions necessary to allocate resources.
-True

In linear programming, the unit profit or unit contribution associated with one decision variable can be affected by the quantity made of that variable or of any other variable in the problem.
-False

What combination of x and y will yield the optimum for this problem?
Minimize \$3x + \$15y, subject to
(1) 2x + 4y 12 and
(2) 5x + 2y 10.
-x = 0, y = 0

In linear programming, a statement such as "maximize contribution" becomes a(n)
-objective
-False

The optimal solution of a linear programming problem that consists of two variables and six constraints will probably not have all six constraints binding.
-True

What combination of a and b will yield the optimum for this problem?
Maximize \$6a + \$15b, subject to
(1) 4a + 2b 12 and
(2) 5a + 2b 20
-a= 0, b=6

What combination of x and y will yield the optimum for this problem?
Minimize \$3x + \$15y, subject to
(1) 2x + 4y 12 and
(2) 5x + 2y 10.
-Wrong x=1, Y=15

evaluating on or more alternatives described by probailistic data is referred to as
-Wrong Linear Regression

The amount that an objective function coefficient can change before the optimum values of the variables must change is given by
-both 1 and 2

DQ 21

If the amounts of two binding resources change simulatneously, the impact on the objective function can be obtained form the shadow prices
-False

reduced cost is associated with variables
-True

reduced cost is associated with constraints
-False

A feasible solution in transportation models is one in which all of the supply and demand constraints are satisfied.
-True

A transportation problem with a total supply