Complementary slackness and duality, Programming Languages

Assignment Help:

Consider the following LP problem:

min x₁+3_x2+x₃ -x₄

s.t. x₁ +x₂ +x₃ +x₄ ≥ 0

x₁ +x₂ -x₃ -x₄ ≥ 1

x₂, x₃ ≥ 0 x₁, x₄ ≤ 0.

1. Unique primal-dual solutions.

Find a feasible solution (by trying a few guesses) and compute its associated value of the objective function, zprimal.
Write the dual.
Find a feasible solution to the dual (just pick one) and compute its associated value of the objective function, zdual, and check, according to weak duality, that it is not less than zprimal.
Solve the dual through the graphical method.
After finding the optimal value of the dual variables, use complementary slackness to find the optimal value of the primal variables.
Solve both primal and dual problems in AMPL. Print out the solutions.

Related Discussions:- Complementary slackness and duality

Use loop invariant to prove the working of the program, 1. Use mathematica...

1. Use mathematical induction to prove Whenever n is a positive integer. 2. Use loop invariant to prove that the program for computing the sum of 1,...,n is correct.

Write a booking and pricing system, Write a booking and pricing system for ...

Write a booking and pricing system for seats for performances in a theatre. Design and write a system to handle information (equipment, people, events etc.) for a club. Given

Develop a system for record student information, Your task for this project...

Your task for this project is to develop a system that would provide the following features: 1. Register new student 2. Drop student from university 3. Add a course and gr