How to practice Linear Programming

Attempt a question, record the concept and assumptions, then check the available answer. Rework mistakes after revising the relevant concepts. Topic tags can overlap; review the question context.

Questions 1–10 of 39. Imported answers require independent review unless marked reviewed.

Topic practice 39 questionsPage 1 of 4

Question 26

Open question
MAMSQ1 markNeeds review
Consider the following assignment problem where

are tasks,

are agents and the cost matrix is given by

Which of the following statements is/are TRUE for an optimal assignment?
Your answerSelect all correct options. You can choose more than one.

Log in to check the answer

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Question 33

Open question
MANAT1 markNeeds review
Consider the following Linear Programming Problem (LP):

The maximum value of

in the above LP is equal to ________. (answer in integer)

Log in to check the answer

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Question 46

Open question
MAMCQ2 marksNeeds review
For a transportation problem, let

denote the unit cost of the cell

. Assume that

,

,

and

. Let

and

,

, represent the simplex multipliers associated with any basis corresponding to the unit cost

. Assume that

,

,

and

. The relative cost coefficient

is the difference between the current solution and the new improved solution. If

,

and

, then which one of the following is TRUE?
Your answerChoose one option.

Log in to check the answer

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Question 63

Open question
MANAT2 marksNeeds review
Let

. If

is an optimal solution of the Linear Programming Problem:

then the maximum value of

is equal to ________. (answer in integer)

Log in to check the answer

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Question 14

Open question
MAMCQ1 markNeeds review
For the linear programming problem:
Maximize

Subject to





consider the following two statements:
S1: If

and

, then

forms an optimal basis.
S2: If

and

, then

forms an optimal basis.
Then, which one of the following is correct?
Your answerChoose one option.

Log in to check the answer

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Question 24

Open question
MAMSQ1 markNeeds review
Consider the balanced transportation problem with three sources

, and four destinations

, for minimizing the total transportation cost whose cost matrix is as follows:





Supply

2
6
20
11


12
7
4
10


8
14
16
11
5
Demand

10



where

. If the associated cost to the starting basic feasible solution obtained by using the North-West corner rule is 290, then which of the following is/are correct?
Your answerSelect all correct options. You can choose more than one.

Log in to check the answer

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Question 25

Open question
MAMSQ1 markNeeds review
Consider the following regions:


Then, which of the following is/are TRUE?
Your answerSelect all correct options. You can choose more than one.

Log in to check the answer

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Question 49

Open question
MAMSQ2 marksNeeds review
Consider the linear programming problem (LPP):
Maximize

Subject to

,

,

,

.
Given that

forms the optimal basis of the LPP with basis matrix

and respective

. If

is the optimal solution of the dual of the LPP, then which of the following is/are TRUE?
Your answerSelect all correct options. You can choose more than one.

Log in to check the answer

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Question 25

Open question
MAMCQ1 markNeeds review
Consider the following Linear Programming Problem



The optimal value of the problem

is equal to
Your answerChoose one option.

Log in to check the answer

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer

Question 58

Open question
MANAT2 marksNeeds review
The maximum value of

subject to the constraints

is equal to

(round off to TWO decimal places)

Log in to check the answer

You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer