Question

8. Given the following 2 constraints, which solution is a feasible solution for a maximization problem?...

8. Given the following 2 constraints, which solution is a feasible solution for a maximization problem?

(i) 8x1 + 3x2 ≤ 22; (ii) x1 – x2 ≤ 5

A) (x1, x2 ) = (1, 5)

B) (x1, x2 ) = (5, 1)

C) (x1, x2) = (2, 1)

D) (x1, x2) = (4, 4)

Homework Answers

Answer #1

Given 2 constraints:

(i) 8x1 + 3x2 ≤ 22

(ii) x1 – x2 ≤ 5

Using options to find feasible solution

A), (x1, x2) = (1, 5)

equation i = 8*1 + 3* 5 = 23 which is not less than 22, so option is not correct.

B). (x1, x2 ) = (5, 1)

equation i = 8*5 + 3*1 = 43 which is not less than 22, so option is not correct.

C) (x1, x2) = (2, 1)

equation i = 8*2 + 3*1 = 19 which is less than 22

equation ii is 2 - 1 = 1 which is less than 5, Since both the equation are satisfying, this option is correct answer.

D) (x1, x2) = (4, 4)

equation i = 8*4 + 3*4 = 44 which is not less than 22, so option is not correct.

So, Option C is correct answer.

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
(a) Determine the feasible region graphically for the following inequalities. x1 + x2 ≤ 4 4x1...
(a) Determine the feasible region graphically for the following inequalities. x1 + x2 ≤ 4 4x1 + 3x2 ≤ 12 −x1 + x2 ≥ 1 x1 + x2 ≤ 6 x1, x2 ≥ 0 (b) Which constraints are redundant? Reduce the system to the smallest number of constraints defining the feasible region. (c) For each extreme point of the feasible region, state an example of an objective function which is maximised at that point.
determine the maximum number of basic feasible solution in the linear program with the following constraints...
determine the maximum number of basic feasible solution in the linear program with the following constraints : x1+x2<=6 x2<=3 x1,x2>=0 note that you will have to introduce two slack variables to the above constraints
a. Solve the following linear programming model by using the graphical method: graph the constraints and...
a. Solve the following linear programming model by using the graphical method: graph the constraints and identify the feasible region then determine the optimal solution (s) (show your work). Minimize Z = 3x1 + 7x2 Subject to 9x1 + 3x2 ≥ 36 4x1 + 5x2 ≥ 40 x1 – x2 ≤ 0 2x1 ≤ 13 x1, x2 ≥ 0 b. Are any constraints binding? If so, which one (s)?
5.8 Explain how the following conditions can be represented as linear constraints using binary variables. (a)...
5.8 Explain how the following conditions can be represented as linear constraints using binary variables. (a) Either x1 + x2 ? 3 or 3x1 + 4x2 ? 10 (b) Variable x2 can assume values 0, 4, 7, 10, and 12 only (c) If x2 ? 3, then x3 ? 6; Otherwise x3 ? 4 (assume x2 and x3 are integers) (d) At least 2 out of the following 5 constraints must be satisfied: x1 + x2 <=7 x1 ? x2...
Consider the following LP problem:           Max   3X1 + 2X2           s.t. 5X1 + 4X2 £...
Consider the following LP problem:           Max   3X1 + 2X2           s.t. 5X1 + 4X2 £ 40                 3X1 + 5X2 £ 30                 3X1 + 3X2 £ 30                        2X2 £ 10                 X1 ³ 0, X2 ³ 0 (1)   Show each constraint and the feasible region by graphs. Indicate the feasible region clearly.   (5 points) (2)   Are there any redundant constraints? If so, what constraint(s) is redundant? (2 points) (3)   Identify the optimal point on your graph. What...
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.
Solve the following linear programming model by using the graphical method: graph the constraints and identify...
Solve the following linear programming model by using the graphical method: graph the constraints and identify the feasible region. Using the corner points method, determine the optimal solution (s) (show your work). Maximize Z = 6.5x1 + 10x2 Subject to x1 + x2 ≤ 15 2x1 + 4x2 ≤ 40 x1 ≥ 8 x1, x2 ≥ 0 b. If the constraint x1 ≥ 8 is changed to x1 ≤ 8, what effect does this have on the optimal solution? Are...
Consider the problem max 4x1 + 2x2 s.t. x1 + 3x2 ≤ 5 (K) 2x1 +...
Consider the problem max 4x1 + 2x2 s.t. x1 + 3x2 ≤ 5 (K) 2x1 + 8x2 ≤ 12 (N) x1 ≥ 0, x2 ≥ 0 and the following possible market equilibria: i) x1 = 0, x2 = 3/2, pK = 0, pN = 1/4, ii) x1 = 1, x2 = 2, pK = 2, pN = 1, iii) x1 = 1, x2 = 2, pK = 4, pN = 0, iv) x1 = 5, x2 = 0, pK =...
Which of the following statements is true? A feasible solution point lie on the boundary of...
Which of the following statements is true? A feasible solution point lie on the boundary of the feasible region. A feasible solution satisfies one or more constraints. An infeasible solution violates one or more constraints. An optimal solution satisfies at least one constraints.
Please answer with complete solution A simplex matrix for a standard maximization problem is given. Indicate...
Please answer with complete solution A simplex matrix for a standard maximization problem is given. Indicate whether or not the solution shown is complete (optimal). If the solution is not complete, find the next pivot or indicate that no solution exists. 2 1 1 1 0 0 0 − 2 0 − 1 − 2 0 1 0 4 0 2 − 1 1 0 0 − 3 0 5 7 0 0 1 ∣ ∣ ∣ ∣ ∣ ∣...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT