Question

1- An unbounded problem is one for which ________. remains feasible A. the objective is maximized...

1- An unbounded problem is one for which ________. remains feasible
A. the objective is maximized or minimized by more than one combination of decision variables
B. there is no solution that simultaneously satisfies all the constraints
C. the objective can be increased or decreased to infinity or negative infinity while the solution
D. there is exactly one solution that will result in the maximum or minimum objective


2- If a model has alternative optimal solutions, ________.

A. the objective is maximized or minimized by more than one combination of decision variables
B. there is no solution that simultaneously satisfies all the constraints
C. the objective can be increased or decreased to infinity or negative infinity
D. there is exactly one solution that will result in the maximum or minimum objective

3- The ________ indicates how much the value of the objective function will change as the right-hand side of a constraint is increased by 1.
A. objective coefficient
B. shadow price
C. binding constraint
D. reduced cost

Homework Answers

Answer #1

1. Option C. the objective can be increased or decreased to infinity or negative infinity while the solution

2. Option A. the objective is maximized or minimized by more than one combination of decision variables

3. Option B. Shadow price

Shadow price is that change which takes place in the difference between the actual value and optimized value of a objective function. Which occurs when RHS of the constraint is increased by One. For every marginal change in RHS, there's a change in value of objective function which is indicated by this concept.

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
If a problem is referred to as a linear programming problem, what must be true? A)...
If a problem is referred to as a linear programming problem, what must be true? A) the objective function must be linear B) both the objective function and the constraints must be linear C) the constraints must be linear D) the decision variables must be linear Three essential elements of a linear programming formulation are the: A) decision variables, feasibility, constraints B) constraints, objective function, non-negativity C) decision variables, objective function, constraints D) objective function, constraints, solution When constraints identify...
When an LP objective function is to maximize profits: Select one: a. resource constraints must be...
When an LP objective function is to maximize profits: Select one: a. resource constraints must be of the £ variety. b. resource constraints must be of the ³ variety. c. all input costs must be variable. d. the total revenue function must not be linear. When some capacity constraints are binding, although others are nonbinding: Select one: a. the shadow price for new capacity is positive. b. the shadow price for output is positive. c. the marginal revenue product for...
The feasible region for a two-variable LP problem can be: A) a polygon B) a single...
The feasible region for a two-variable LP problem can be: A) a polygon B) a single point C) nonexistent D) any of the above In a media selection problem, which of the following might be maximized? A) reach B) frequency C) quality of exposure D) any of the above Among other things, the sensitivity report shows us: A) the impact of one additional unit of a binding constraint B) the impact of multiple decision variables C) the impact of an...
1.If you see 'Model Type - NLP Convex' in the Model Diagnosis area of the Task...
1.If you see 'Model Type - NLP Convex' in the Model Diagnosis area of the Task Pane Model tab of the Analytic Solver Platform (ASP) after you conducted a convexity test, you may conclude that: a. The problem does not have a feasible solution. b. The algorithm cannot find a local optimal solution. c. A local optimal solution found is also a global optimal solution. d. You minimized the number of decision variables. When solving an NLP problem, Solver displayed...
A negative value for a given slack variable implies: Select one: a. no excess capacity. b....
A negative value for a given slack variable implies: Select one: a. no excess capacity. b. use of more resources than are available. c. none of the above. d. excess capacity. For costs to be a linear function of output: Select one: a. returns to each factor input must be constant. b. input prices must change at a constant rate. c. product prices must be constant. d. returns to scale must be constant. For managerial decision problems analyzed using the...
Answer Questions 2 and 3 based on the following LP problem. Let     P1 = number of...
Answer Questions 2 and 3 based on the following LP problem. Let     P1 = number of Product 1 to be produced           P2 = number of Product 2 to be produced           P3 = number of Product 3 to be produced Maximize 100P1 + 120P2 + 90P3         Total profit Subject to         8P1 + 12P2 + 10P3 ≤ 7280       Production budget constraint             4P1 + 3P2 + 2P3 ≤ 1920       Labor hours constraint                                    P1 > 200         Minimum quantity needed...
Question text Which of the following best describes constrained optimization problem? Select one: a. A constrained...
Question text Which of the following best describes constrained optimization problem? Select one: a. A constrained optimization problem is an optimization problem that maintains a priority queue of variables, where the weight of a variable is the number of conflicts in which it participates. b. A constrained optimization problem is an optimization problem that also has hard constraints specifying which variable assignments are possible. The aim is to find an optimal assignment that satisfies the hard constraints. c. A constrained...
1) All of the following are methods or procedures for solving problems with multiple criteria except:...
1) All of the following are methods or procedures for solving problems with multiple criteria except: A. Weighted Scoring B. Goal Programming C. Trend Analysis D. Analytical Hierarchy Process 2) All of the following are true concerning multicriteria decision making except: A. multicriteria problems can have more than one goal or objective when making a decision B. All of the answers are true concerning multicriteria decision making C. all criteria will always be met (i.e. all objectives will be satisfied)...
1) Consider the following Java program, which one of the following best describes "setFlavor"? public class...
1) Consider the following Java program, which one of the following best describes "setFlavor"? public class Food {     static int count;     private String flavor = "sweet";     Food() { count++; }     void setFlavor(String s) { flavor = s; }     String getFlavor() { return flavor; }     static public void main(String[] args) {         Food pepper = new Food();         System.out.println(pepper.getFlavor());     } } a. a class variable b. a constructor c. a local object variable d....
MATHEMATICS 1. The measure of location which is the most likely to be influenced by extreme...
MATHEMATICS 1. The measure of location which is the most likely to be influenced by extreme values in the data set is the a. range b. median c. mode d. mean 2. If two events are independent, then a. they must be mutually exclusive b. the sum of their probabilities must be equal to one c. their intersection must be zero d. None of these alternatives is correct. any value between 0 to 1 3. Two events, A and B,...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT