Question 11:
Let’s assume the following LP model. Provide the optimal values of the decision variables (X1 and X2) and the optimal value of the objective function. Show your work as much as you can or send a picture of your work if you want to get partial points when your final answers are not correct.
Objective Function: Min X1 + 2X2
Operational Constraints: X1>=30; X2>=15
Non-negativity constraint: X1, X2 > 0
Question 12:
Let’s assume the following LP model. Provide the optimal values of the decision variables (X1 and X2) and the optimal value of the objective function. Show your work as much as you can or send a picture of your work if you want to get partial points when your final answers are not correct.
Objective Function: Max X1 + 3X2
Operational Constraints: x1 + x2<=30; X2<=25
Non-negativity constraints: X1, X2 >=0
11. Using excel ,we find the optimal solution as shown below :
X1=30, X2=15 and Z=60
In excel :
B7=B3
B8=C3
E5=B3+2*C3

12.Using the solver,we get
X1=5,X2=25 and Z=80

Question 11: Let’s assume the following LP model. Provide the optimal values of the decision variables...
Let’s assume the following LP model. Provide the optimal values of the decision variables (X1 and X2) and the optimal value of the objective function. Show your work as much as you can or send a picture of your work if you want to get partial points when your final answers are not correct. objective function: Min 2 X1+X2 operational constraints: X1_>20; X2>_10 non-negativity constraints:X1,X2_>0
Question 11 (20 points) Let's essume the following LP model Provide the optimal values of the decision variables 0X1 and X2) and the optimal value of the objective function. Show your work as much as you can or send a picture of your work if you nane to get partial points when your final answers are not Objective function: Mim x, + X Operational constraints: X1 10: Xi 2.0 NonMgativityconstraints:x,-x, 20 Question 12 (20 paines) Let's assume the following LP...
Solve the following model using linear programming (allow for continuous values and determine the values of the decision variables and objective function. Then, round the decision variables values down to the nearest integer and determine the value of the decision variables and objective function, this is an approximate answer to solving the model using integer programming. Observe if the rounding provides a "feasible solution, all constraints are satisfied. Finally, solve the model using integer programming and determine the values of...
QUESTION 20 In what parts of a linear programming formulation do the decision variables appear? In the objective function only In the RHS of constraints only In the LHS of constraints only Can appear in both RHS and LHS of constraints AND the objective function None are correct QUESTION 21 A constraint that directly affects the optimal solution in a linear program is called A non-binding constraint A null constraint A binding constraint None of the above QUESTION 22 Which...
Figure 1 provides the Excel Sensitivity output for the following LP model. 10x1 + 8x2 Max Z= subject to: 31 +2x2 < 24 2x1 + 4x2 = 12 -2x1 + 2 x2 56 X1, X2 > 0 Variable Cells Cell Name $B$13 Solution x1 $C$13 Solution x2 Final Reduced Objective Allowable Allowable Value Cost Coefficient Increase Decrease 6 0 10 1E+30 0 -12 8 12 1E+30 6 Constraints Cell $D$6 $D$7 $D$8 Name C1 Totals C2 Totals C3 Totals Final...
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 “≥” constraint; do not include any “= only” constraints. You must have a unique Optimal Solution...
A R D F G 8. By using solver, and given the following LP model, please answer. Make sure to provide the sensitivity analysis results: (4 points each) MAX 14X 18Y + s.t. 10X 12Y 1000 40X 1000 20X + 30Y 2000 X,Y 0 a. What is the optimal objective value of the objective function? b. What are the optimal values of the two decision variables? c. What are the ranges optimality? d. Would it be beneficial to increase the...
You are given the following linear programming model in algebraic form, with X1 and X2 as the decision variables: Note: Each part is independent (i.e., any change made in one problem part does not apply to any other parts). Minimize 40X1+50X2 Subject to 2X1+3X2>=30 2 X1+ X2>=20 X1>=0, X2>=0 a) Graph the feasible region and label the corner point. Compute the optimal solution using any method of your choice. Justify your answer and indicate the optimal solution on your graph....
Q3. (a) Solve the following LP model GRAPHICALLY by drawing a specific objective function iso- cost line) and show the feasible area. Minimize Cost $28X + $24Y s.t. (1) 5X + 4Y S 2600 (2)X + Y 2 300 (3) X 2 80 (4) Y 2 100 X,Y 20 (b) Find the optimal solution and calculate the optimal (minimum) value). SHOW YOUR WORK Q4. (Based on the information from Q3 solved above) (a) WRITE below the STANDARD FORM of Q1...
O/ Write an appropriate mathematical model for this problem including Decision Variables and their description, Objective Function, & Constraints. XAMPLE 4.3 AGGREGATE PLANNING AT SURESTEP uring the next four months the SureStep Company must meet (on time) the fol lowing demands for pairs of shoes: 3000 in month 1 5000 in month 2; 2000 in month 3; and 1000 in month 4. At the beginning of month 1, 500 pairs of shoes are on hand, and SureStep has 100 workers....