The ______ variable is chosen by examining the cost coefficents in the objective function.
- Aentering
- Bleaving
- Cpositive slack
- 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)
- ATrue
- 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?
- Aa new decision variable to be entered and other decision variable to leave the basis
- Ba new slack variable to be entered and other slack to leave the basis
- Ca new non-degenerate variable to be entered and other non-generate to leave the basis
- 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)
- A3x1 + 2x2 + S1 + R = 18
- B3x1 + 2x2 + S1 - R = 18
- C3x1 + 2x2 - S1 + R = 18
- D3x1 + 2x2 + S1 = 18
A <= constraint only needs a slack variable added; no artificial variable is required.