Skip to main content

Optimization Theory Sample paper



  1. What is operations research? Explain the scope of OR.                                    [3]
  2. List the phases of OR and explain them.                                                           [3]
  3. Discuss the guideline of formulation of Linear Programming model and for 
       converting it into standard form?                                                                          [3]     

  1. Define the following:                                                                                         [3]

            a.  Optimal solution.
                   b. Unbounded solution.
c.   Artificial variable.

      5. A paper mill produces 2 grades of paper namely X and Y. Because of raw  material restrictions, it cannot produce more than 400 tonnes of grade X and 300            tonnes of grade Y in a week. There are 160 production hours in a week. It requires 0.2 and 0.4 hours to produce a ton of products X and Y respectively with corresponding profits of Rs.200 and Rs. 500 per ton. Formulate the above as a LPP to maximize profit and find the optimum product mix.                                     [3]

6. What conditions must exist in a simplex table to establish the existence of an alternative solution? Unbounded solution?  Degeneracy?                                     [3]

7.  Solve following LP problem using Big M method:

Maximize Z=3x1 + 5x2

subject to constraints
                        x1-2x2 ≤6
                               x1≤10
                               x2≥1
                          x1, x2 ≥0                                                                                    [3]


8. What are artificial variables? Why do we need them? Describe two- phase
     method of solving LP problem with artificial variables.                                   [3]


9.  XYZ company produces automobile spare part. The contract that it has signed
     with a large truck manufacturer calls for the following 4-month shipping   
     schedule:
        
Month
Number of parts to be shipped
January
3000
Feburary
4000
March
5000
April
5000

           The company can manufacture 3000 parts per month on a regular time basis             
           and  2000 parts per month on overtime basis. Its production cost is Rs 15000 for
           a part  produced in regular time and 25000 for part produced in overtime.            
           Formulate   problem as LP model to minimize overall cost.                            [3]


     10.  What are unrestricted variables? How can we solve a Linear Programming
          problem having unrestricted variable using simple method? Explain with 
          example.                                                                                                             [3]







Comments

Popular posts from this blog

Advantages and Disadvantages of EIS Advantages of EIS Easy for upper-level executives to use, extensive computer experience is not required in operations Provides timely delivery of company summary information Information that is provided is better understood Filters data for management Improves to tracking information Offers efficiency to decision makers Disadvantages of EIS System dependent Limited functionality, by design Information overload for some managers Benefits hard to quantify High implementation costs System may become slow, large, and hard to manage Need good internal processes for data management May lead to less reliable and less secure data

Inter-Organizational Value Chain

The value chain of   a company is part of over all value chain. The over all competitive advantage of an organization is not just dependent on the quality and efficiency of the company and quality of products but also upon the that of its suppliers and wholesalers and retailers it may use. The analysis of overall supply chain is called the value system. Different parts of the value chain 1.  Supplier     2.  Firm       3.   Channel 4 .   Buyer

Big-M Method and Two-Phase Method

Big-M Method The Big-M method of handling instances with artificial  variables is the “commonsense approach”. Essentially, the notion is to make the artificial variables, through their coefficients in the objective function, so costly or unprofitable that any feasible solution to the real problem would be preferred, unless the original instance possessed no feasible solutions at all. But this means that we need to assign, in the objective function, coefficients to the artificial variables that are either very small (maximization problem) or very large (minimization problem); whatever this value,let us call it Big M . In fact, this notion is an old trick in optimization in general; we  simply associate a penalty value with variables that we do not want to be part of an ultimate solution(unless such an outcome is unavoidable). Indeed, the penalty is so costly that unless any of the  respective variables' inclusion is warranted algorithmically, such variables will never be p