Ready to test your Knowledge?
Try out our new practice tests completely free!
exam preparation banner icon

Business Analytics Data Study Set 1

Statistics

Quiz 14 :

Optimization Models

Quiz 14 :

Optimization Models

search
arrow
The LP relaxation of an integer programming (IP)problem is the same model as the IP model except that some integer constraints are omitted.
Free
True False
Answer:

Answer:

False

arrow
If all the supplies and demands for a transportation model are integers,then the optimal Solver solution may or may not have integer-valued shipments.
Free
True False
Answer:

Answer:

False

arrow
The optimal solution to an LP problem was img 3.69 and img 1.21.If img and img were restricted to be integers,then img 4 and img 1 will be a feasible solution,but not necessarily an optimal solution to the IP problem.
Free
True False
Answer:

Answer:

False

arrow
Multiple optimal solutions are quite common in linear programming models.
True False
Answer:
arrow
The transportation model is a special case of the minimum cost network flow model (MCNFM).
True False
Answer:
arrow
In blending problems,if a quality constraint involves a quotient,then the problem will be nonlinear.
True False
Answer:
arrow
If an LP problem is not correctly formulated,Solver will automatically indicate that it is infeasible when trying to solve it.
True False
Answer:
arrow
Solver may be unable to solve some integer programming problems,even when they have an optimal solution.
True False
Answer:
arrow
In network models of transportation problems,arcs represent the routes for getting a product from one node to another.
True False
Answer:
arrow
In a transportation problem,if it costs $4 per item to ship up to 200 items between cities,and $2 per item for each additional item,the proportionality assumption of LP is satisfied.
True False
Answer:
arrow
Integer programming (IP)models are optimization models in which all of the variables must be integers.
True False
Answer:
arrow
Transportation costs for a given route are nearly always linear and smooth,with the main cost differences occurring between routes.
True False
Answer:
arrow
Many of the most successful applications of optimization in the real world have been in the areas of scheduling,blending,logistics,and aggregate planning.
True False
Answer:
arrow
Logistics problems are problems of finding the least expensive way to transport products from their origin to their destination.
True False
Answer:
arrow
In transportation problems,the three sets of input numbers that are required are capacities,demands,and flows.
True False
Answer:
arrow
In transportation problems,shipments between supply points or between demand points are possible.
True False
Answer:
arrow
Transshipment points are locations where goods neither originate nor end up,but goods are allowed to enter such points to be shipped out to their eventual destinations.
True False
Answer:
arrow
In transportation problem,shipping costs are often nonlinear due to quantity discounts.
True False
Answer:
arrow
If Solver fails to find an optimal solution to an integer programming problem,we might be able to find a near optimal solution by increasing the Integer Optimality setting.
True False
Answer:
arrow
When we solve a linear programming problem with Solver,we cannot guarantee that the solution obtained is an optimal solution.
True False
Answer:
Showing 1 - 20 of 87