A

Name: ID No.: Sec. No. Instr.

BIRLA INSTITUTE OF TECHNOLOGY & SCIENCE, PILANI First Semester, 2007-2008

Course No. AAOC C222 Course Title: Optimization Quiz Date: 21.09.2007 M.M. 40 Time: 30 mts

Note: There are ten questions. Each correct answer carries 4 marks and wrong answer carries -1 marks. Write the most appropriate answer in the box provided below and nowhere else. Overwriting/cutting will be treated as wrong answer. Q. No. 1 2 3 4 5 6 7 8 9 10 Ans.

B C A B D C B D A

Q1 Consider the system 2x1 x2 + 4x3 2x4 + x5 = 6, x1 + x2 + 2x3 x4 + x6 = 3 The solution x2 = x4 = x5 = x6 = 0, x1 = x3 = 1 is (A) a basic solution (B) a basic feasible solution (C) a basic solution but not feasible (D) not a basic solution Q2. Consider the following LPP: Maximize subject to z = c1 x1 + c2 x2 + c3 x3 x1 x2 + 2x3 20 2x1 + x2 x3 10 x1 0, x2 0, x3 0

The optimal solution yields the following objective equation z + 8x1 + 3x4 + 4x5 = A where x4 , x5 denote slack variables for the respective functional constraints. Then A is (A) 190 (B) 100 (C) 120 (D) 160 Q3. Which statement is not true if a maximization problem has an unbounded solution? (A) A data entry error has been made or a limiting constraint has been omitted. (B) The objective function value goes to +. (C) The values of all decision variables go to +. (D) The feasible region is unbounded Q4. If the points (5, 5, 5) and (7, 9, 5) are both optimal solutions to a linear programming problem, what other point is also optimal? (A) (6, 7, 5) (B) (6, 7, 8) (C) (7, 5, 5) [D] (5, 9, 5)

Q5. A non-binding constraint is: (A) satised with an equality at the optimal solution (B) not satised with an equality at the optimal solution (C) never a non-negativity variable constraint (D) none of the above Q6 The functional constraints of a linear model with nonnegative variables are 3x1 + 5x2 16 and 4x1 + x2 10. Which of the following points could not be an optimal solution for the model? (A) x1 = 2.5, x2 = 0 (B) x1 = 0, x2 = 3.2 (C) x1 = 2, x2 = 2 (D) x1 = 1, x2 = 2.25 Q7 Consider the following general form of a LPP Maximize Prot Subject to Amount of resource I used 50 Amount of resource II used 260 Amount of resource III used 150 All decision variables (x1 , x2 ) are non-negative. The Z -row of the nal table is Z + 25s1 + 40s3 = A (si are the slack variables). If the right hand side of constraint III is changed from 150 to 151, what would happen to maximum possible prot? (A) It would be decreased by 25 (B) It would be decreased by 40 (C) It would be increased by 40 (D) It would be increased by 25 Q8. If, in solving a linear programming minimization problem using the simplex method, a slack variable is given a positive coecient in the objective function, this implies (A) there is a cost for using an amount of the resource greater than that which is available. (B) there is a cost for failing to use the entire amount of the resource. (C)there is no cost for using the resource. (D) the resource can be substituted for another resource Q9. Which property of linear programming models indicates that the decision variables cannot be restricted to integer value and can take on any fractional value? (A) linearity (B) additivity (C) certainty (D)divisibility Q10. Hong securities has $ 300,000 to invest in four stocks and three bonds. X1 , X2 , X3 , X4 denote the amounts invested in each stocks and Y1 , Y2 , Y3 equal the amounts invested in each of the three bonds. Which of the following shows that at least 40% of the investment in stocks must be in stock 1? (A) 0.6X1 .4(X2 + X3 + X4 ) 0 (B)X1 .4(X2 + X3 + X4 ) 0 (C)) X1 > 120000 (D) X1 0.4(X2 + X3 + X4 + Y2 + Y3 + Y4 )