• Cyberian's Gold

    If a balanced Transportation problem with ‘7’ sources and ‘6’sinks then its non-degenerate basic feasible solution will have---------- independent allocations. MTH601
    10

  • Cyberian's Gold

    For North West Corner method, in the first row and first column, resource and sink contain ‘5’ and ‘7’ units respectively; then after allocating the appropriate amount ‘x11’ in the cell (1,1), we will move towards which of the following cell? MTH601
    (2,2)

  • Cyberian's Gold

    For the project of a firm, if ‘5’ sales persons are assigned ‘5’ different sales territories, then in how many ways a single territory can be assigned to a single sale person? MTH601

    120

  • Cyberian's Gold

    zareen
    zareen Cyberian’s Gold 11 minutes ago

    The objective of a transportation problem is to develop an ----------- transportation schedule that meets all demand from given stock at a ------- total shipping cost. MTH601
    (integral, maximum)

  • Cyberian's Gold

    The North – West Corner Rule MTH601

    Is based on the concept of minimizing opportunity cost.
    
  • Cyberian's Gold

    The assignment problem is unbalanced if the cost matrix is not a ------------matrix. MTH601
    square
    rectangle
    not square

  • Cyberian's Gold

    If a balanced Transportation problem with ‘7’ sources and ‘6’sinks then its non-degenerate basic feasible solution will have---------- independent allocations. MTH601

  • Cyberian's Gold

    If a balanced Transportation problem with ‘m’ sources and ‘n’ sinks then degeneracy will arise only if there are less than ---------- independent allocations in the solution. MTH601
    m+n–1

  • Cyberian's Gold

    For an unbalanced Transportation problem, if the total demand is LESS than total supply then which of the following is true in order to balance the problem? MTH601

    A dummy sink would have to include with demand equal to the surplus
    
  • Cyberian's Gold

    In the Vogel’s approximation Method for solving a Transportation problem, Penalty measure for any row or column, is given by which of the following? MTH601
    Difference between the largest unit cost to the next largest cost in the same row(column)

  • Cyberian's Gold

    In the assignment problem, the cost matrix is ------------. MTH601
    rectangular

  • Cyberian's Gold

    2019-08-10.png 2019-08-10 (8).png 2019-08-10 (7).png 2019-08-10 (6).png 2019-08-10 (5).png 2019-08-10 (4).png 2019-08-10 (3).png 2019-08-10 (2).png 2019-08-10 (1)nn.png 2019-08-10 (1).png

  • Cyberian's Gold

    1_ If a balanced Transportation problem with ‘m’ sources and ‘n’ sinks then degeneracy will arise only if there are less than ---------- independent allocations in the solution.

    m–n–1
    (In this question all options are in (-) negative range like m–n–1 , m–n–2 m–n–3, m–n–4 )
    and there was no one true. correct was m+n–1 .however i select m–n–1 ).

    2_In a Transportation Problem, the objective function ’Z’ gives ----------.
    Total Cost of transportation

    3_Which of the following type of Elementary matrix operations are performed while solving an Assignment problem by Hungarian’s method?
    Column operations (not sure)

    4_For North West Corner method, in the first row and first column, resource and sink contain ‘5’ and ‘7’ units respectively; then after allocating the appropriate amount ‘x11’ in the cell (1,1), we will move towards which of the following cell?
    missed

    5_To convert an Assignment problem into a maximization problem, which of the following operations would have to apply?
    Deduct all elements of the row from highest element in that row

    6_In the assignment problem, the decision variable ‘xij’ can attain which of the following value?
    Only ‘1’
    Ref:
    Pg 97
    Optimization for Decision Making: Linear and Quadratic Models
    By Katta G Murty
    https://books.google.com.pk/books?id=HWZXs1rkVxEC&pg=PA97&l
    7_In

    Hungarian method of solving assignment problem, the cost matrix is obtained by----------.
    subtracting the smallest element from all other elements of the row.

    8_If the total demand is equal to total supply as per requirement of a balanced transportation problem i-e “a1+a2±–+an = b1+b2±–+bn” then which of the following is true?
    “a1=b1, a2=b2,—, an=bn” is necessarily implied (not sure)

    9_In case the cost elements of one or two cells are not given in the problem, it means that ---------
    the routes connected by those cells are not available

    10_ If the cost matrix in an Assignment problem is not square then which the following modification will be made to balance the given problem?
    Add a dummy row(column) with negative cost elements (not sure)

  • Cyberian's Gold

    When the total allocations in a transportation model of m*n size is not equals to “m + n – 1”, the situation is known as:

    Unbalanced situation

    In North West Corner method, the first step after choosing the appropriate cell in 1st row, we allocate -------------so that the capacity of first row or first column is exhausted.
    as much as possible

    For an unbalanced Transportation problem, if the total demand is MORE than total supply then which of the following is true in order to balance the problem?
    a dummy sink…

    In the assignment problem, the decision variable ‘xij’ can attain which of the following value?
    Only ‘1’

    The row, which is introduced in the matrix to balance an unbalnced Transportation problem, is known as ----------.
    dummy row (confirm)

    The solution of a transportation problem with m rows (supplies) and n (destinations) is feasible if numbers of positive allocations are
    m+n-1 (confirm)

    While solving an Assignment problem by Hungarian’s method, in the modified cost matrix if the minimum number of horizontal and vertical lines to cover zeros are not equal to the number of rows (or columns), then which of the following operation is done?
    Subtract smallest element of uncovered rows from all other elements of uncovered cells

    The amounts shipped from a dummy source represent shortages at the receiving destinations
    True (confirm)

    In the Vogel’s approximation Method for solving a Transportation problem, Penalty measure for any row or column, is given by which of the following?
    Difference between the smallest unit cost to the next smallest cost in the same row(column)

  • Cyberian's Gold

    The column, which is introduced in the matrix to balance an unbalanced Transportation problem, is known as-------

    dummy column

  • Cyberian's Gold

    The Transportation Problem is one of the sub-class of -------------.

Insaf Sehat Card Live Cricket Streaming
Quiz 100% Result Quiz 100% Result
| |