Paper Tayyari

Lecture 21: Simplex Method

MCQs, short and long questions from lecture 21.Lecture 21 ki MCQs, short aur long sawal.

4 MCQs · 4 MCQs from past papers4 MCQs · 4 MCQs past papers se

Start mock testMock test shuru karein
DoneHal kiye 0/4
– correctsahi
1.
★ Final term 2012

The ______ variable is chosen by examining the cost coefficents in the objective function.

  1. Aentering
  2. Bleaving
  3. Cpositive slack
  4. Dnegative slack

The entering variable is picked from the objective-row (cost) coefficients; the leaving variable comes from the ratio test.

2.
★ Final term paper (screens, paper 2)

It is a property of simplex method that there always exist infinite numbers of basic feasible solutions. (True/False)

  1. ATrue
  2. BFalse

An LP has only a finite number of basic feasible solutions (at most C(n,m)).

3.
★ Final term paper (screens, paper 2)

If the objective function of a linear programming problem needs further improvement then which of the following will have to proceed?

  1. Aa new decision variable to be entered and other decision variable to leave the basis
  2. Ba new slack variable to be entered and other slack to leave the basis
  3. Ca new non-degenerate variable to be entered and other non-generate to leave the basis
  4. Da new basic variable to be included and other basic variable to leave the basis

Each simplex iteration brings an entering variable into the basis and removes a leaving basic variable.

4.
★ Final term paper (screens, paper 2)

The constrained 3x1 + 2x2 <= 18 in standard form can be written as: (Where R is artificial variable and S1 is Slack variable)

  1. A3x1 + 2x2 + S1 + R = 18
  2. B3x1 + 2x2 + S1 - R = 18
  3. C3x1 + 2x2 - S1 + R = 18
  4. D3x1 + 2x2 + S1 = 18

A <= constraint only needs a slack variable added; no artificial variable is required.