MTH601 Final Term Past Papers by Rizwan

Muhammad Rizwan Ashraf · BS(CS) · Virtual University of Pakistan · MTH 601 Final term Data

Note:- Please confirm the answers by your own too I made it with a lot of hard work as there was not much data on web for this subject Please duaon main yad rakhiay ga

While solving an LP problem by the Simplex method, in the standard table, the element at the intersection of key column and key row is called ------------- element. Entering Leaving Slack

Pivot

In the initial table of Simplex method, the objective function should not contain the terms involving-----------variables

Degenerate

Basic

Non basic

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

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 ).

Which of the following type of Elementary matrix operations are performed while solving an Assignment problem by Hungarian’s method?

Row operations

Column operations

Both of the above

None of the above

Check Not sure

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

Which of the following is a characteristic of critical path scheduling techniques?

The jobs or tasks are dependent on each other Interruptions may be permitted if they are documented

The jobs or tasks must be well defined, and their completion marks the end of the project

The jobs or tasks do not necessarily have to be in a predetermined sequence

Search and cutting methods are used to solve following types of problems Transportation Assignment

Integer Programming

Queuing problems

A feasible solution is called a _______________ solution if the number of non negative allocation is equal to “m + n – 1” (Here m is the number of rows, n is the number of columns in transportation problem)

basic feasible

non basic feasible basic infeasible optimal

Consider the following cost table

Destinations · Source · D1 · D2 · D3 · Supply · S1 · S2 · S3 · Demand

Using Vogel’s Approximation Method, which one is the starting cell?

S1 à D1

S3 à D1 S2 à D2 S2 à D1

Using Vogel’s Approximation method:

These below are the three cells which can be next cell:

Which one is the correct option?

Transportation problem is a special class of linear programming problem in which transport a commodity from the source to a destination in such a way that the total transportation cost is

Zero Maximum

Minimum

Average

We solve a assignment problem by subtracting least number in each row and we get the table below: