Question: Given the following LP: minmize Z = 3x1 + 2x2 subject to 2x + x, 2 10 -3x, + 2x, S 6 X1 + X2S

Given the following LP: minmize Z = 3x1 + 2x2 subject to 2x + x, 2 10 -3x, + 2x, S 6 X1 + X2S 6 X, 20,x : unrestricted a) Write the dual of the following LP problem (5 points) b) Given the following solution to the primal problem, check whether it is optimal or not using the complementary slackness conditions of optimality. (10 points) X16, X20 e) Can you determine a lower bound for the primal problem and an upper bound for the dual problem? Specify these bounds without solving the primal or dual problems. (10 points)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!

Scot and Joplin are in partnership. They share profits in the ratio: Scot 70 per cent; Joplin 30 per cent. The following trial balance was extracted as at 31 December 2013. Required: Draw up a set of...

Please, answer all parts step by step . Thank you so much. Question 2: Consider the following model: Minimize Z = 3x + 2x2, subject to 2x + x2 > 10 - 3x + 2x2 5 6 X1 + X2 6 and X, 20, x 20. Part a)...

Post Optimality and Sensitivity Analysis (PO/SA) A. Changes that affect FEASIBILITY: 1. Changing the right-hand-side (RHS) 2. Adding a new constraint Example A: Consider the following LP: Maximize z...

(i) Write down the linear program relaxation for the vertex cover problem and solve the linear program. [6 marks] (ii) Based on the solution of the linear program in (b)(i), derive an integer...

Close Windo A Moving to another question will save this response. Question 2 of 4 Question 2 28 points Save An Consider the following linear program: Minimize Z = 3x1 + 2x2 Subject to 2x1 + x2 2 10...

The objective of this exercise is to find a way of assigning supervisors to sections in order to minimise total inefficiency . Use the assignment method to determine the optimal assignment and the...

Consider the following problem Maximize z = 3x1 + x2 + 4x, subject to 6x1 + 3x2 + 5x3 S 25 3x + 4x2 + 5x, s 20 X1, X2, X3 20 After applying the simplex method, the optimal tableau is as shown below....

3 Use the Big M method and the two-phase method to nd the optimal solution to the following LP: max z 5x1 x2 s.t. 2x1 x2 6 s.t. x1 x2 4 s.t. x1 2x2 5 x1, x2 0 4 Use the simplex algorithm to nd the...

. (75 points) Solve the following problems in the textbook: Problem 1 on page 171; Problem 6 on page 178; Problems 2 on page 189; Problem 1 on page 212; Problem 18 on page 214. PROBLEMS Group A 1...

Question One a) Briefly explain the below terms Mathematical program. (2mks) cm Rank variables (2mks) ( Optimal solution. (2mks) b) Put the following program in standard forum Maximize: Z=5x1 + 2xx...

Calculations: Answer the following questions Question 1: 10 marks: As an investor, you are supposed to take a decision whether to run the training program or not in the following situation. Owning a...

1 Although auditing standards do not require auditors to provide a guarantee, the auditors may still be held accountable for their services in certain circumstances. For example,...

On January 1, 2016 Focus Corporation issued $500,000, 6%, 5-year bonds at face value. Interest is payable annually on January 1. Instructions Prepare journal entries to record the (a)Issuance of the...

5. In APQR, LP = 101, PQ = 13.4 cm and QR = 20.8 cm. Find (i) ZR. (ii) _Q, (iii) the length of PR. 20.8 cm R Q 101 13.4 cm P

As the manager of Smith Construction, you need to make a decision on the number of homes to build in a new residential area where you are the only builder. Unfortunately, you must build the homes...