How to determine all the basic solutions of an optimization problem, and classify them as feasible...

How to determine all the basic solutions of an optimization problem, and classify them as feasible or infeasible?

As an example,

Maximize z= 2x₁ + 3x₂

Subject to:

x₁ + 3x₂ <= 6

3x₁ + 2x₂ <= 6

x₁ + x₂ >= 0

Some solutions are (2,0), (0,2), (0,0), (6/7, 12/7), but are there more solutions? And how do you tell if they are infeasile/feasible? Would you need to graph it?

Solutions

Expert Solution

The basic solutions are the solutions which solve any of the constraints. However, feasible solutions are which satisfy all constraints.
So the basic solutions are all the points that lie on the lines

However out of this the feasible ones are that also satisfy the constraints, so to do that find the intersecting points on the lines

X1 = 6/7

X2 = 22/7

So feasible solutions are the points that lie on either of the line but within the following range

So from our process above we find 4 points of interest. these are actually the extreme points that satisfy our constraints. (This will be a lot more clear in the graph)
We have

(0,0), (0,2), (2,0), (6/7, 12/7)
When we put all these points in the objective function, we find that the maximum value occurs
at X2 = 12/7, X1 = 6/7 then z= 48/7
we will just plot the graph and make things clear now

Colby Messinger answered 1 year ago

Next > < Previous

Related Solutions

You are in the process of solving a basic price optimization problem to determine what price...

You are in the process of solving a basic price optimization problem to determine what price to charge for a product in order to maximize contribution. Your demand is exponential and its function is D(p) = 20000 * p^-2 and the incremental cost is $15. A. what is your objective function? B. you have solved a basic price optimization model and determined that your original contribution is $333.33 and you will sell to 22.22 customers. What is your optimal price?...

Determine whether the following linear optimization problem is infeasible, unbounded, or has multiple optimal solutions. Draw...

Determine whether the following linear optimization problem is infeasible, unbounded, or has multiple optimal solutions. Draw a graph and explain your conclusion. Maximize 20x + 50y Subject to -3x + 4y < 120 2x + 3y > 180 x, y > 0

Determine whether the following linear optimization problem is infeasible, unbounded, or has multiple optimal solutions. Draw...

Distinguish between basic feasible solution, feasible solution and optimal solution of a linear programming problem. Solve...

Distinguish between basic feasible solution, feasible solution and optimal solution of a linear programming problem. Solve the following LPP graphically: Y=q1+4q2 Subject to 2q1+6q2<=36 2q1+2q2<=16 4q1+2q2<=28 q1,q2>=0

Classify the following each of the 0.10 M solutions as either acidic, basic, or neutral. Show...

Classify the following each of the 0.10 M solutions as either acidic, basic, or neutral. Show equations and determine/calculate the pH of each solution. You may need Ka or Kb of original acid or base and Kw value to perform each substance. a) NaCl b) NH4Cl c) KNO2 d) NaF e) KNO3 f) NH4NO3 g) KC2H3O2

Classify all of the units in Z3[i] and Z5[i]. List them all in each case. (ring...

Classify all of the units in Z3[i] and Z5[i]. List them all in each case. (ring theory question)

Problem 8-12 (Algorithmic) Many forecasting models use parameters that are estimated using nonlinear optimization. The basic...

Problem 8-12 (Algorithmic) Many forecasting models use parameters that are estimated using nonlinear optimization. The basic exponential smoothing model for forecasting sales is Ft + 1 = αYt + (1 – α)Ft where Ft + 1 = forecast of sales for period t + 1 Yt = actual value of sales for period t Ft = forecast of sales for period t α = smoothing constant 0 ≤ α ≤ 1 This model is used recursively; the forecast for time...

General question: how do you find constraints in an optimization problem?

General question: how do you find constraints in an optimization problem? For example, in this question:"Find two natural numbers whose sum is 16 and whose product is a maximum." the solution states that the constraint is that x would be between 1 and 15. Why not 0? In another example, where the questions asks "The perimeter of a rectangle is 24 cm. Find the dimensions of the rectangle of maximum area. What is the maximum area?", the constraint is...

To find the optimal solution to a linear optimization problem, do you have to examine all...

To find the optimal solution to a linear optimization problem, do you have to examine all the points in the feasible region? Explain. Can a linear programming problem have no solution? More than one solution? Explain. ---------------------------------------------------------------------------------------------------------------- A beverage can manufacturer makes three sizes of soft drink cans—Small, Medium and Large. Production is limited by machine availability, with a combined maximum of 90 production hours per day, and the daily supply of metal, no more than 120 kg per day....

Determine whether aqueous solutions of the salts below are acidic (a), basic (b) or neutral (n)....

Determine whether aqueous solutions of the salts below are acidic (a), basic (b) or neutral (n). Ka H2CO3 = 4.27 x 10-7 Kb NH3 = 1.8 x 10-5 Ka HCO3 - = 4.8 x 10-11 Ka H2PO4 - = 6.31 x 10-8 Ka HPO4 2- = 4.47 x 10-13 Ka H3PO4 = 7.08 x 10-3 A. K2CO3 B. CaCl2 C. KH2PO4 D. (NH4)2CO3

Subjects