Scribd
Upload
28 views3 pages

Progralineal

Uploaded by

juan julca
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
28 views3 pages

Progralineal

Uploaded by

juan julca
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Numerico II

juan julca
Jun 2024

To verify that x1 = 2 and x2 = 0 is an optimal solution and to find the


optimal solution of the dual problem using complementary slackness, we can
follow these steps:
1. **Verify Feasibility:** Check if x1 = 2 and x2 = 0 satisfy the constraints
of the primal problem.
2. **Compute Objective Function Value:** Calculate the value of the ob-
jective function at x1 = 2 and x2 = 0.
3. **Formulate the Dual Problem:** Derive the dual problem from the given
primal problem.
4. **Use Complementary Slackness Conditions:** Apply the complementary
slackness conditions to find the optimal solution of the dual problem.
1. Verify Feasibility The constraints are:

4x1 + 3x2 ≤ 12

−x1 + 3x2 ≤ 4
4x1 + x2 ≤ 8
xi ≥ 0
Substitute x1 = 2 and x2 = 0:

4(2) + 3(0) = 8 ≤ 12

−2 + 3(0) = −2 ≤ 4
4(2) + 0 = 8 ≤ 8
All constraints are satisfied, so x1 = 2 and x2 = 0 is a feasible solution.
2. Compute Objective Function Value The objective function is:

z = 2x1 + x2

Substitute x1 = 2 and x2 = 0:

z = 2(2) + 0 = 4

1
3. Formulate the Dual Problem The primal problem is:

Maximize z = 2x1 + x2

Subject to:
4x1 + 3x2 ≤ 12
−x1 + 3x2 ≤ 4
4x1 + x2 ≤ 8
xi ≥ 0
The dual problem will be:

Minimize w = 12y1 + 4y2 + 8y3

Subject to:
4y1 − y2 + 4y3 ≥ 2
3y1 + 3y2 + y3 ≥ 1
yi ≥ 0
4. Use Complementary Slackness Conditions The complementary slackness
conditions are:
yi (aij xj − bi ) = 0
For y1 :
y1 (4x1 + 3x2 − 12) = 0
y1 (4(2) + 3(0) − 12) = 0
y1 (8 − 12) = 0
y1 (−4) = 0
So, y1 = 0.
For y2 :
y2 (−x1 + 3x2 − 4) = 0
y2 (−2 + 3(0) − 4) = 0
y2 (−2 − 4) = 0
y2 (−6) = 0
So, y2 = 0.
For y3 :
y3 (4x1 + x2 − 8) = 0
y3 (4(2) + 0 − 8) = 0
y3 (8 − 8) = 0
y3 (0) = 0

2
y3 can be any non-negative value.
Now, using the dual constraints:

4y1 − y2 + 4y3 ≥ 2

3y1 + 3y2 + y3 ≥ 1
Substituting y1 = 0 and y2 = 0:

4(0) − 0 + 4y3 ≥ 2

4y3 ≥ 2
1
y3 ≥
2

3(0) + 3(0) + y3 ≥ 1
y3 ≥ 1
Therefore, y3 = 1 satisfies both conditions.
Conclusion The optimal solution for the dual problem is:

y1 = 0

y2 = 0
y3 = 1
This confirms that x1 = 2 and x2 = 0 is an optimal solution for the primal
problem, and the corresponding optimal solution for the dual problem is y1 = 0,
y2 = 0, and y3 = 1.

You might also like