CIS QA LEVEL 2 WEEK 5 TOPIC: LINEAR PROGRAMMING OBJECTIVE AND SHORT ANSWER QUESTIONS

Transcription

1 CIS QA LEVEL 2 WEEK 5 TOPIC: LINEAR PROGRAMMING OBJECTIVE AND SHORT ANSWER QUESTIONS 1. In the graphical method of solving a Linear Programming problem, the feasible region is the region containing A. The optimal solution only B. All the constraints C. The objective function D. The corner points for solutions E. All possible solutions 2. If the dual problem of a Linear Programming is maximization, then the primal problem is Generally, the main aim of Linear Programming model is to allocate A. All resources B. Resources to competing activities C. Resources reasonably D. Resources optimally E. Resources generously

2 4. Which of the following best explains the concept of shadow price in linear programming? A. The opportunity cost of a resource. B. The marginal cost of a resource. C.The marginal benefit of a resource. D. The excess benefit of a resource. 5. A graphical solution to the Linear Programming model is only feasible for problems involving: A. Two variables only. B. Two constraints only. C. More than two variables and constraints. D. All of the above. 7. If the contributions of product X and product Y to the profit made by a company are 400 and 350 respectively, then the objective function is given by 8. The shadow cost of a binding constraint is the amount by which the objective function. for one unit in the scarce resource. 9. For a solution to exist for a linear programming problem, the number of constraints must be

3 A. Less than the number of decision variables B. Greater than the number of decision variables C. Equal to the number of the decision variables and the objective function D. Equal to the number of the decision variables E. Greater than the number of the decision variables and the objective function 10. The objective function for a linear programming problem formulated from the contributions to profit by the decision variables is given by 980x 650y. If the corner points of the feasible region are (0,900), (200,500), (0,400), (300,400) then the optimal solution is A. 585,000 B. 260,000 C. (300,400) D. (0,900) E. 554, Which of the following represents the correct order of some steps required to solve a linear programming problem? A. Define variables>establish constraints>establish objectives function> Determine optimal product mix. B. Define variables>establish objective function>establish constraints> Determine optimal product mix.

4 C. Establish constraints>define variables>establish objective function> Determine optimal product mix. D. Establish objective function>define variables>establish constraints> Determine optimal product mix. 12. A portion of the graph that satisfies all the constraints in a Linear Programming problem is known as In Linear programming, a marginal value that indicates the amount by which the value of the objective function would change, if there was one unit change on the right hand side value of that constraints is called? A. Non negatively assumption value B. Feasible region value C. Shadow price D. Objective function. 14. Which of the following statements about linear programming (LP) is not true? A. Every LP problem has a primal and a dual formulation. B. The LP technique can be used to solve only maximization problems.

5 C. To use LP technique, all factors involved must have a linear relationship. D. The shadow price of a binding constraint in an LP problem indicates the extra contribution that would be gained from increasing the amount of scarce resources by one unit. 15. For a problem to be amenable to solution by the Linear Programming method, all factors concerned must have...relationships. 16. Problems to be solved by Linear Programming must conform with the following EXCEPT that A. All variables involved must have linear relationship B. A choice of alternative actions must be possible C. There must be one or more restrictions on available resources D. The problem must be expressible numerically E. Decision variables must not be more than two

6 17. The RIM condition in Transportation problem A. Is the addition of dummy to destination of source B. Means that the total demand equals total supply C. Means that the shipment to a dummy source represents surplus D. Dummy must be introduced all the time E. Means absence of dummy 18. A way of improving the initial basic feasible solution of a transportation problem is known as A. Feasible test B. Optimality test C. Initial test D. Basic test E. Duality test 19. Which of the following is NOT a method of obtaining initial basic feasible solution of a transportation problem? A. Stepping stone method B. Least cost method C. Vogel s Approximation method D. North west corner method E. Simplex method

7 20. The initial tableau of a Simplex method assumes that each of all the decision variables has a value and each of all the slack variables has a value. 21. The amount by which the objective function changes as a result of an extra unit of the scarce resource is A. Market price B. Shadow price C. Dummy price D. Slack price E. Surplus price 22. If the primal problem of a linear programming problem is a maximizing one, the dual problem will be a...one. A. Quadratic B. Minimizing C. Maximizing D. Exponential E. Logarithmic 23. Another name for shadow price in linear programming is

8 24. The two major assumptions in linear programming are.and... THEORY 1. What is linear programming? 2. Discuss the basic assumptions of linear programming. 3. Differentiate clearly between the methods of solving linear programming problems. 4. ADESCO Limited makes two different brands of golf gloves. One is a full-fingered glove and the other is half-fingered model. ADESCO Limited ordered more gloves than it can produce in terms of upcoming glove session. The scarce resource in the manufacture of these gloves is labour department, 250 hours in the finishing department and 150 hours in the packaging and shipping department. The department time requirements and the profit per box are given below; Cutting & Finishing Shipping& Profit Sewing Packaging

9 Full 3hours 1hour 1hour 30 Half 1hour 2hours 1hour 25 i. Find the optimum product mix for ADESCO Limited assuming the company wants to maximize profit. ii. What is the maximum amount of profit of ADESCO Limited can earn?