School of Mathematics Level I Semester 1 & 2RCA Supplementary Examinations Instructions • Answer all questions for modules for which you are registered and which appear in this booklet. • You have a...

1 answer below »

View more »
Answered Same DayAug 21, 2021

Answer To: School of Mathematics Level I Semester 1 & 2RCA Supplementary Examinations Instructions • Answer all...

Aparna answered on Aug 21 2021
149 Votes
1. Consider the linear programming problem
(P) Minimize:
subject to
and
and its dual is
(DP)
Maximize:
subject to
It is known that is the optimal solution to the dual problem (DP). Use complementary slackness conditions to find the optimal solution of the linear programming problem (P).
Solution:
As the optimal solution for the dual problem is . Therefore,
If is optimal then by duality theorem, we have optimal to (LP) such that and both satisfy the complementary slackness conditions together. By adding slack variables to first and second constraint of (D), we have the canonical form of the problem
Minimize:
subject to
and
    Iteration 1
    
    
    -3
    -3
    -21
    0
    0
    M
    M
    
    B
    
    
    
    
    
    
    
    
    
    Min...
SOLUTION.PDF

Answer To This Question Is Available To Download

Related Questions & Answers

More Questions »

Submit New Assignment

Copy and Paste Your Assignment Here
April
January
February
March
April
May
June
July
August
September
October
November
December
2025
2025
2026
2027
SunMonTueWedThuFriSat
30
31
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
1
2
3
00:00
00:30
01:00
01:30
02:00
02:30
03:00
03:30
04:00
04:30
05:00
05:30
06:00
06:30
07:00
07:30
08:00
08:30
09:00
09:30
10:00
10:30
11:00
11:30
12:00
12:30
13:00
13:30
14:00
14:30
15:00
15:30
16:00
16:30
17:00
17:30
18:00
18:30
19:00
19:30
20:00
20:30
21:00
21:30
22:00
22:30
23:00
23:30