Question

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

Math   Statistics-And-Probability   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

using x1 as x and x2 as y :

plotting the constraints :

x+y<=6

y<=3

x>=0

y>=0

the solutions are the corners of the region that has all the regions overalpping :

the 4 corners are :

therefore,

the possible feasible solutions are :

(0,0), (6,0), (0,3), (3,3)

so, the maximum number of basic feasible solution in the linear program with the given constraints = 4

(please UPVOTE)

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

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.
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)
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)?
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...
Exercises Consider a feasible region S defined by a set of linear constraints: S = {x...
Exercises Consider a feasible region S defined by a set of linear constraints: S = {x : Ax ≤ b} Prove that S is convex. Express (2, 2)T as a convex combination of (0, 0)T , (1, 4)T , and (3, 1)T Determine if f (x1 , x2 ) = 2x12 – 3x1x2 + 5x22 - 2x1 + 6x2 is convex, concave, both, or neither for x Є R2
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...
1. It is impossible for a linear program with unbounded feasible region to have a unique...
1. It is impossible for a linear program with unbounded feasible region to have a unique optimal solution. True or False? 2. It is impossible for an integer program to have infinitely many optimal solutions. True or False? 3. When we solve an integer program with a minimization objective using Branch and Bound, we can discard a subproblem for which the optimal objective value of the associated LP is larger than the objective value of the incumbent solution. True or...
Indicate whether the following linear program is an all-integer linear program or a mixed-integer linear program....
Indicate whether the following linear program is an all-integer linear program or a mixed-integer linear program. Max 30x1 + 23x2 s.t. 3x1 + 1.7x2 ≤ 410 1.1x1 + 3x2 ≤ 260 1x1 + 1x2 ≤ 145 x1, x2 ≥ 0 and x2 integer This is a  linear program. Write the LP Relaxation for the problem but do not attempt to solve. If required, round your answers to one decimal place. Its LP Relaxation is: Max x1 + x2 s.t. x1 +...
Problem 11-1 (a) Indicate whether the following linear program is an all-integer linear program or a...
Problem 11-1 (a) Indicate whether the following linear program is an all-integer linear program or a mixed-integer linear program. Max 30x1 + 25x2 s.t. 3x1 + 1.5x2 ≤ 400 1.5x1 + 2x2 ≤ 250 1x1 + 1x2 ≤ 150 x1, x2 ≥ 0 and x2 integer This is a mixed-integer linear program. Write the LP Relaxation for the problem but do not attempt to solve. If required, round your answers to one decimal place. Its LP Relaxation is Max x1...
Solve the following linear program using the simplex method. If the problem is two dimensional, graph...
Solve the following linear program using the simplex method. If the problem is two dimensional, graph the feasible region, and outline the progress of the algorithm. Minimize Z = 3X1 – 2X2 – X3 Subject to 4X1 + 5X2 – 2X3 ≤ 22                     X1 – 2X2 + X3 ≤ 30                     X1, X2, X3 ≥ 0
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT