Scribd Logo
Upload

Welcome to Scribd!

  • 33 views

    Bem C701

    Uploaded by

    Gouri Shanker
    This document contains an exam for an Optimization Techniques class, including 8 short answer questions and 5 long answer questions. The short answer questions cover topics like graphical and simplex methods for linear programming problems, dynamic programming, transportation problems, and game theory. The long answer questions require solving linear, integer, and transportation problems using various techniques like the simplex method, Gomory cuts, and testing for optimality. The document provides context for an exam testing optimization methods taught in a college-level engineering course.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Bem C701

    Uploaded by

    Gouri Shanker
    33 views3 pages
    This document contains an exam for an Optimization Techniques class, including 8 short answer questions and 5 long answer questions. The short answer questions cover topics like graphical and simplex methods for linear programming problems, dynamic programming, transportation problems, and game theory. The long answer questions require solving linear, integer, and transportation problems using various techniques like the simplex method, Gomory cuts, and testing for optimality. The document provides context for an exam testing optimization methods taught in a college-level engineering course.

    Original Description:

    Question paper Optimization Technique

    Original Title

    BEM-C701 (1)

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains an exam for an Optimization Techniques class, including 8 short answer questions and 5 long answer questions. The short answer questions cover topics like graphical and simplex methods for linear programming problems, dynamic programming, transportation problems, and game theory. The long answer questions require solving linear, integer, and transportation problems using various techniques like the simplex method, Gomory cuts, and testing for optimality. The document provides context for an exam testing optimization methods taught in a college-level engineering course.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    33 views3 pages

    Bem C701

    Uploaded by

    Gouri Shanker
    This document contains an exam for an Optimization Techniques class, including 8 short answer questions and 5 long answer questions. The short answer questions cover topics like graphical and simplex methods for linear programming problems, dynamic programming, transportation problems, and game theory. The long answer questions require solving linear, integer, and transportation problems using various techniques like the simplex method, Gomory cuts, and testing for optimality. The document provides context for an exam testing optimization methods taught in a college-level engineering course.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 3

    GURUKULA KANGRI (DEEMED TO BE UNIVERSITY), HARIDWAR

    END SEMESTER EXAMINATION-2021

    CLASS – B.Tech

    SEMESTER -7th

    SUBJECT NAME –Optimization Technique

    SUBJECT CODE-BEM-701

    TIME: 3 HOUR MAX. MARKS: 70

    MIN. PASS: 40%

    NOTE: QUESTION PAPER IS DIVIDED INTO TWO SECTIONS A AND B. ATTEMPT

    BOTH SECTIONS AS PER GIVEN INSTRUCTIONS.

    SECTION-A (SHORT ANSWER TYPE QUESTIONS)

    INSTRUCTIONS: ANSWER ANY FIVE QUESTIONS IN ABOUT 150 WORDS .EACH QUESTION CARRIES
    SIX MARKS. (5 X 6 = 30 marks)

    Q1. Use graphical method maxZ=2x1+4x2

    x1+2x2≤5, x1+x2≤4 x1,x2≥0

    Q2. . Write the basic solution for the eqn 2x1+3x2+4x3=5 and 3x1+4x2+5x3=6

    Q3. .Prove ,dual of the dual is the primal.

    Q4. Write the solution of dual of this LPP maxz=40x1+50x2

    2x1+3x2 ≤ 3,8x1+4x2 ≤ 5 and x1,x2 ≥ 0

    Q5. Use dynamic programming to solve the following LPP: Max z=3x1+5x2

    x1≤ 4, x2≤6 3x1+2x2 ≤ 18 and x1,x2 ≥0

    Q6.Solve travelling sales man problem


    CITY A B C D E
    A - 103 188 136 38
    B 103 - 262 176 52
    C 188 262 - 85 275
    D 136 176 85 - 162
    E 38 52 275 162 -
    Q7.Solve transportation problem using VAM

    D1 D2 D3 D4 SUPPLY
    S1 20 25 28 31 200
    S2 32 28 32 41 180
    S3 18 35 24 32 110
    DEMAND 150 40 180 170
    Q8.Solve the game

    Player B
    1 7 2
    Player A (6 2 7)
    5 2 6
    Q9.Solve the game whose payoff matrix is (by graph)

    I II III IV
    I 1 3 -3 7
    II 2 5 4 -6

    Q10.Dicuss about Pure Birth Model?

    SECTION –B (LONG ANSWER TYPE QUESTION)

    INSTRUCTIONS:ANSWER ANY FOUR QUESTIONS IN DETAIL.EACH QUESTION CARRIES TEN MARKS.

    4x10=40
    Q1. Solve by Big M, maxZ = 4x1+5x2-3x3+50

    x1+x2+x3=10, x1-x2>1, 2x1+3x2+x3<4 ,x1,x2,x3>0

    Q2. Solve the primial LPP and its dual by simplex method

    Max z=30x1+23x2+29x3

    6x1+5x2+3x3 ≤ 26,4x1+2x2+5x3 ≤7 and x1,x2,x3 ≥0

    Q3 Use dual simplex method maxz=-2x1-x2 subject to

    3x1+x2 ≥3, 4x1+3x2 ≥6, x1+2x2 ≥3, x1,x2 ≥0

    Q4. Solve the following IPP by Gomory Technique Maxz=x1+4x2

    2x1+4x2 ≤ 7, 5x1+3x2 ≤ 15 and x1,x2 ≥0 and are integer

    Q5. A vessel is to be loaded the stocks of 3 items. Each unit of item i has a weight wi and value ri .The
    maximum cargo weight the vessel can take is 5 and the details of the three items are as follow:

    i wi ri

    1 1 30

    2 3 80

    3 2 65

    Q6. Solve transportation problem and test optimality

    D1 D2 D3 D4 SUPPLY
    S1 19 14 23 11 11
    S2 15 16 12 21 13
    S3 30 25 16 39 19
    DEMAND 6 10 12 15
    Q7. .Solve the following game graphically

    I II
    I 2 7
    II 3 5
    III 11 2

    Q8.Discribe Model (M/M/1:∞/FIFO)?

    You might also like