The distinguishing feature of an LP model is

Which method is used for solving linear models?

Acquiring input data is part of:

A decision model has the following input variables: Historical sales data and historical advertising budget. The model is considered to be probabilistic.

In dealing with business models, managers need to consider only quantitative data while making decisions in practice.

Consider the following linear programming model.Min 2X1 + 3X2 Subject to: X1 + X2 ≥ 4, X1 ≥ 2, X1, X2 ≥ 0. This linear programming model has:

A linear programming model has the following two constraints: X1 ≥ 3 and X1 ≥ 4. This model has a redundant constraint.

A linear programming problem has the following two constraints: X1 ≤ 20 and X1 ≥ 25. This problem is infeasible.

When using Solver, the parameter Changing Cells is typically associated with the objective function.

Surplus is typically associated with which type of constraints?

Corresponding to each dual there exists a primal

The number of constraints in dual is equal to number of variables in primal.

For converting a problem in to dual, minimization primal should have

Solution of primal cannot be read from dual.

For converting a problem in to dual, all RHS of constraints should be

If all the values of the input variables in a decision model are random in nature, then the model is considered to be probabilistic.

In the linear programming formulation of the transportation problem, cost of transporting one unit of the material from a supply point to a demand point appears in

A baker uses organic flour from a local farmer in all of his baked goods. For each batch of bread (x1), he uses 4 pounds of flour. For a batch of cookies (x2), he uses 3 pounds, and for a batch of muffins (x3) he uses 2 pounds. The local farmer can supply him with no more than 24 pounds per week. The constraint that represents this condition is:

It's time to buy pet food again and Lisa heads to the grocery store with $40 in her purse, leaving her seven hungry cats and four hungry dogs at home. Dog food costs $1 per can and cat food costs $0.50 per can. Dogs eat two full cans of food each day but cats eat only one can. Lisa would like to buy enough food to last through her three-day weekend. What is one appropriate constraint for this scenario?

Larry's Fish Market buys salmon (S) for $5 per pound and a local whitefish (W) for $3.50 per pound. Larry wants to minimize his cost, but he cannot spend more than $160. The objective function that minimizes these costs for Larry is:

Which of the following statements about infeasible problems is best?

The production manager for the Coory soft drink company is considering the production of two kinds of soft drinks: regular and diet. Two of her limited resources are production time (8 hours = 480 minutes per day) and syrup (1 of the ingredients), limited to 675 gallons per day. To produce a regular case requires 2 minutes and 5 gallons of syrup, while a diet case needs 4 minutes and 3 gallons of syrup. Profits for regular soft drink are $3.00 per case and profits for diet soft drink are $2.00 per case. Which of the following is not a feasible production combination?

Converting a transportation problem LP from cost minimization to profit maximization requires only changing the objective function; the conversion does not affect the constraints.

A transportation problem with three sources and four destinations will have seven decision variables.

and four destinations will have seven decision variables.

The assignment problem is a special case of the transportation problem in which one agent is assigned to one, and only one, task.

In a transportation problem with total supply equal to total demand, if there are four origins and seven destinations, and there is a unique optimal solution, the optimal solution will utilize 11 shipping routes.

The objective of the transportation problem is to

Impact of changes in RHS values of constraints is typically measured by the:

A constraint has a slack of 5 units. This implies that:

Assume that the shadow price of a non-binding "≤" constraint is 5. This implies that:

A section of output from The Management Scientist is shown: Variable1, Lower Limit=60, Current Value=100, Upper Limit=120. What will happen to the solution if the objective function coefficient for variable 1 decreases by 20?

A section of output from The Management Scientist is shown: Constraint2, Lower Limit=240, Current Value=300, Upper Limit=420. What will happen if the right-hand-side for constraint 2 increases by 200?

Which of the following is not a question answered by standard sensitivity analysis information?

With reference to the attached Spreadsheet screenshot, What is the cell formula for B17?

Using this snippet of the sensitivity report for constraints, which of these conclusions is best?

Using this snippet of the sensitivity report for variable cells, which of these conclusions is best?

If the optimal solution to the LP Relaxation problem is an integer, it is the optimal solution to the integer linear program.

The constraint x1 + x2 + x3 + x4 ≤ 2 means that two out of the first four projects must be selected.

The constraint x1 − x2 = 0 implies that if project 1 is selected, project 2 cannot be.

If a problem has only less-than-or-equal-to constraints with positive coefficients for the variables, rounding down will always provide a feasible integer solution.