Question

When many constraints are present in a linear optimization problem, there is a greater chance that...

When many constraints are present in a linear optimization problem, there is a greater chance that a redundant constraint exists. Assume you are trying to maximize an objective function and you have two decision variables, X1 and X2. If a redundant constraint exists, does the constraint become necessary if you try to minimize (instead of maximize) the same objective function? Why? Do you need an objective function to determine if a constraint is redundant? Explain.

Homework Answers

Answer #1

SOLUTION:-

A redundant constraint is that constraint which does not take participation is forming the feasibility region.

In other words,the boundaries of the feasibility region are not formed using this constraint.

This has got nothing to do with the objective.Whether it is minimisation or maximisation,the feasibility area does not change.

Therefore,the redundancy of constraint,as it depends only on the feasibility region,cannot also change with the change of objective.

We do not need an objective function to determine if a constraint is redundant.

Please give me thumb up...

Thank you in Advance.....

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
Many times, linear optimization is used to maximize an objective function because profit, productivity, or efficiency...
Many times, linear optimization is used to maximize an objective function because profit, productivity, or efficiency is the outcome of interest. Provide two examples where the goal is to optimize a process by minimizing an objective function. In your examples, identify the outcome and any constraints that would need to be met.
For the following linear programming problem:    Maximize 2x1+ 3x2    Such that        x1+ x2...
For the following linear programming problem:    Maximize 2x1+ 3x2    Such that        x1+ x2 ≤ 4      5x1+ 3x2 ≤15       x1,x2 ≥ 0 Graph the region that satisfies the constraints. Find the optimal solution and the value of the objective function at the optimal solution.
Given the following linear optimization problem Maximize 10x + 20y Subject to x + y ≤...
Given the following linear optimization problem Maximize 10x + 20y Subject to x + y ≤ 50 2x + 3y ≤ 120 x ≥ 10 x, y ≥ 0 (a) Graph the constraints and determine the feasible region. (b) Find the coordinates of each corner point of the feasible region. (c) Determine the optimal solution and optimal objective function value.
Solve the LP problem using graphical method. Determine the optimal values of the decision variables and...
Solve the LP problem using graphical method. Determine the optimal values of the decision variables and compute the objective function. Minimize Z = 2x1 + 3x2 Subject to             4x1 + 2x2 ≥ 20             2x1 + 6x2 ≥ 18               x1 + 2x2 ≤ 12 x1, x2  ≥ 0 with solution! thak you so much :D
2. The following linear programming problem has been solved by The Management Scientist. Use the output...
2. The following linear programming problem has been solved by The Management Scientist. Use the output to answer the questions. LINEAR PROGRAMMING PROBLEM MAX 25X1+30X2+15X3 S.T. 1) 4X1+5X2+8X3<1200 2) 9X1+15X2+3X3<1500 OPTIMAL SOLUTION Objective Function Value = 4700.000 Variable Variable Reduced Cost X1 140.000   0.000 X2 0.000 10.000 X3 80.000 0.000 Constraint   Slack/Surplus Dual Price 1   0.000   1.000 2 0.000 2.333 OBJECTIVE COEFFICIENT RANGES Variable   Lower Limit Current Value Upper Limit X1 19.286 25.000 45.000 X2 No Lower Limit 30.000 40.000...
FOR MGMT 205 * I DO NOT WANT AN ANSWER THAT TALKS ABOUT TOBACCO OR BONDS**...
FOR MGMT 205 * I DO NOT WANT AN ANSWER THAT TALKS ABOUT TOBACCO OR BONDS** Your problem will have exactly two variables (an X1 and an X2) and will incorporate a maximization (either profit or revenue) objective. You will include at least four constraints (not including the X1 ? 0 and X2 ? 0 [i.e., the “Non-negativity” or “Duh!”] constraints). At least one of these four must be a “?” constraint, and at least one other must be a...
ABC, Inc. makes three types of computer monitors: Standard, Premium, and Deluxe. The profit per monitor...
ABC, Inc. makes three types of computer monitors: Standard, Premium, and Deluxe. The profit per monitor for each is $150 for Standard, $190 for Premium, and $285 for Deluxe. For the coming month, the combined production of Standard monitors and Premium monitors must be at least 50,000 but must not exceed 70,000. The production of Deluxe monitors must be at least 30,000. Also, the production of Standard monitors must not exceed the production of Deluxe monitors plus 10,000. The company...
I'm trying to graph four constraints to get a feasible region for a linear optimization model....
I'm trying to graph four constraints to get a feasible region for a linear optimization model. I've determined that my constraints are: x + y = 1,000 x >= 250 y >= 250 x >= 2y I think the values of the constraints in my problem are: 1000 = 1000 667 >= 250 333 >= 250 667 >= 666 Using those, how do I graph those values in my scatterplot to get the feasible region?!?! Here's the question I'm working...
Complete the following 3 problems and attach your work. The UMass IIE student chapter is going...
Complete the following 3 problems and attach your work. The UMass IIE student chapter is going to run a fundraising event from 1pm through 5pm. Due to the large scale of the event, student workers will be hired to work for the event and each worker will be assigned to a particular shift. There are three shifts: 1pm-3pm, 2pm-4pm, 3pm-5pm. The pay for each of the three shifts is $20, $24 and $28 per worker respectively. The minimum number of...
. A manufacturing company produces diesel engines in four factories located in Tucson, Seattle, Baltimore, and...
. A manufacturing company produces diesel engines in four factories located in Tucson, Seattle, Baltimore, and Detroit. Three trucking firms purchase these engines for their plants located in Nashville, Miami, and Charleston. The supplies and demands, along with the per engine transportation costs in dollars are given below:                                                                           Plant                                                               Nashville             Miami         Charleston         Supply              __________________________________________________________________                         Tucson                800               1100                400                  35    Factory            Seattle                 550               950                 600                  35                        ...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT