recategorized by
2,451 views
2 votes
2 votes

Given the following statements with respect to linear programming problem:

S1: The dual of the dual linear programming problem is again the primal problem

S2: If either the primal or the dual problem has an unbounded objective function value, the other problem has no feasible solution

S3: If either the primal or the dual problem has a finite optimal solution, the other one also possess the same, and the optimal value of the objective functions of the two problems are equal.

Which of the following is true?

  1. S1 and S2
  2. S1 and S3
  3. S2 and S3
  4. S1, S2 and S3
recategorized by

1 Answer

1 votes
1 votes
all 3 statements are correct as they all  are properties of dual and primal

hence ans should be D
Answer:

Related questions

11.1k
views
3 answers
3 votes
go_editor asked Aug 2, 2016
11,073 views
Consider the following transportation problem:The initial basic feasible solution of the above transportation problem using Vogel's Approximation ... problem:is degenerate solutionis optimum solutionneeds to improveis infeasible solution
3.7k
views
1 answers
3 votes
go_editor asked Aug 2, 2016
3,714 views
In the Hungarian method for solving assignment problem, an optimal assignment requires that the maximum number of lines that can be drawn through squares with ... number ofrows or columnsrows + columnsrows + columns -1rows + columns +1
14.8k
views
1 answers
1 votes
go_editor asked Aug 11, 2016
14,828 views
A basic feasible solution of a linear programming problem is said to be ______ if at least one of the basic variable is zerogeneratedegenerateinfeasibleunbounded
2.5k
views
1 answers
2 votes
go_editor asked Jul 27, 2016
2,543 views
The following Linear Programming problem has:$\text{Max} \quad Z=x_1+x_2$Subject to $\quad x_1-x_2 \geq 0$\quad \quad \quad 3x_1 - ... Feasible solutionNo feasible solutionUnbounded solutionSingle point as solution