#x1

2 public questions tagged with this topic.

Linear Programming 1

The following LPP problem has Zmin = 1.5x₁ + 4.5x₂ Subject to x₁ + 3x₂ > 3 x₁ + x₂ > 2 x₁, x₂ > 0

We can see that we verify Alternate optimal solution by full calculation: use standard identity, substitute, simplify step by step to reach Alternate optimal solution.

Ref: NCERT Mathematics Class XII — Linear Programming

View Details

Linear Programming 1

The problem of maximizing z = x₁ - x₂ subject to constraints x₁ + x₂ ≤ 10, x₁ ≥ 0, x₂ ≥ 0 and x₂ ≤ 5 has

Simply put, complete solution: write formula, plug data, do arithmetic. Final value matches one solution. Simple and accurate.

Ref: NCERT Mathematics Class XII — Linear Programming

View Details

#x1

No questions with this tag

The following LPP problem has Zmin = 1.5x₁ + 4.5x₂ Subject to x₁ + 3x₂ > 3 x₁ + x₂ > 2 x₁, x₂ > 0

The problem of maximizing z = x₁ - x₂ subject to constraints x₁ + x₂ ≤ 10, x₁ ≥ 0, x₂ ≥ 0 and x₂ ≤ 5 has

Install Examtube

Please allow advertisements on this page