Scribd Logo
Upload

Welcome to Scribd!

  • 21 views

    OR Q pAPER 1ST

    Uploaded by

    Vishal Kumar
    This document contains instructions for a sessional test in operations research. It lists 4 questions for the test worth a total of 50 marks. Question 3 involves formulating a linear program to determine the optimal production amounts of two products given time and technological constraints. Question 3b involves using a graphical method to find the optimal product mix for two grades of paper given raw material and time restrictions. Question 3c involves solving a linear program using the simplex method to maximize an objective function subject to constraints.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd

    OR Q pAPER 1ST

    Uploaded by

    Vishal Kumar
    21 views1 page
    This document contains instructions for a sessional test in operations research. It lists 4 questions for the test worth a total of 50 marks. Question 3 involves formulating a linear program to determine the optimal production amounts of two products given time and technological constraints. Question 3b involves using a graphical method to find the optimal product mix for two grades of paper given raw material and time restrictions. Question 3c involves solving a linear program using the simplex method to maximize an objective function subject to constraints.

    Original Title

    OR q pAPER 1ST

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    DOC, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains instructions for a sessional test in operations research. It lists 4 questions for the test worth a total of 50 marks. Question 3 involves formulating a linear program to determine the optimal production amounts of two products given time and technological constraints. Question 3b involves using a graphical method to find the optimal product mix for two grades of paper given raw material and time restrictions. Question 3c involves solving a linear program using the simplex method to maximize an objective function subject to constraints.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    21 views1 page

    OR Q pAPER 1ST

    Uploaded by

    Vishal Kumar
    This document contains instructions for a sessional test in operations research. It lists 4 questions for the test worth a total of 50 marks. Question 3 involves formulating a linear program to determine the optimal production amounts of two products given time and technological constraints. Question 3b involves using a graphical method to find the optimal product mix for two grades of paper given raw material and time restrictions. Question 3c involves solving a linear program using the simplex method to maximize an objective function subject to constraints.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as DOC, PDF, TXT or read online from Scribd
    Download as doc, pdf, or txt
    You are on page 1of 1

    Sessional Test (I,II,III) Department: ME Semester: 7th Subject: Operations Research Max.

    Marks: 50

    Date: 9th Dec. 2010 Code: ME-7004 Time Allowed: 90 mins.

    Note: Attempt all questions. Q. No. Question Marks

    1. (a)

    3,3

    1. (b) 2. (a) 2. (b) List out the situations where OR techniques will be applicable. 3. (a) A company manufacturers two products (A and B) and the profit per unit sold is Rs. 3 and Rs. 5 respectively. Each product has to be assembled on a particular machine, each unit of product A taking 12 minutes of assembly time and each unit of product B 25 minutes of assembly time. The company estimates that the machine used for assembly has an effective working week of only 30 hours (due to maintainence/breakdown). Technological constraints mean that for every five units of product A produced at least two units of product B must be produced. Formulate the problem of how much of each product to produce as a linear program. 3. (b) Two grades of paper X and Y are produced on a paper machine. Because of raw material restrictions, not more than 400 tonnes of grade X and 300 tonnes of grade Y can be produced in a week. There are 160 production hours in a week. It requires 0.2 and 0.4 hour to produce one tonne of products X and Y respectively with corresponding profits of Rs. 20 and Rs. 50 per tonne. Find the optimum product mix using the graphical method. 3.(c) Maximize Z = 3x1 + 4x2 + x3 + 7x4, subject to constraints 8x1 + 3x2 + 2x3 + 2x4 10, 2x1 + 5x2 + x3 + 4x4 5, x1 + 2x2 + 5x3 + x4 6, x1,x2,x3, x4 0. Solve by Simplex Method.

    6 6 2

    10

    12

    You might also like