outp

My Cart

The final table in Phase I of a Linear Programming Problem is given be

Question


The final table in Phase I of a Linear Programming Problem is given below:

C_{B}

     Basic

    Variables

 0          0          0           0             -1 

 x_{1}       x_{2}        s_{1}         s_{2}          x_{a_{1}}

    Sol.
0        x_{2}

1         1           1      0           0   

-1         0        -1       -1          1

     5
-1         x_{a_{1}}      3
    -1         0        -1       -1           0      -3

Here 1a x is the artificial variable. Does this LPP have a feasible solution? Justify your answer.


Posted on : 2023-03-18 17:37:16 | Author : IGNOU Academy | View : 42

Click Here to Order on WhatsApp

Login or SignUp to View Answer / Comment or Ask Question.. Its Free

Word Count : 129

To determine if the given Linear Programming Problem (LPP) has a feasible solution, we need to examine the final table in Phase I of the Simplex Method.

In this table, we see that the artificial variable x_{a_1} has a non-zero value in the ______ __ _________ ___ ____________ ___________ ________ _________ _____ __ ___ __________ ______.
______ ____________ ____________ ________ _____________ ____________ __________ ________ ________ __________ __ ____________ ________ _____________.
____ ___ ____ ____ __ _____ ____________ __ ________ ____ ______.
___ ____________ ___________ _____ ___________ ___ ____ __ _______ ____ _____________ _____ __________ ___.
____ ___ ___ ___________ ________ _____ _____________ _________ _________.
___________ ___________ ________ _____ ____________ _____________ ______ _____________ __________ _____ ____ ________ ____________ _________ ____________.
_____________ __ ________ ____ ____ ____________.
_____ __ ___________ __________.
Click Here to Order Full Assignment on WhatsApp








Degree : CERTIFICATE PROGRAMMES
Course Name : Advanced Certificate in Power Distribution Management
Course Code : ACPDM
Subject Name : Management Of Power Distribution
Subject Code : BEE 3
Year : 2023



IGNOU BEE 3 Solved Assignment 2023
Click Here to Order on WhatsApp

Related Question


Discuss the important factors for motivating employees in an organization. 


A department has 5 jobs to be performed and there are five employees to perform these jobs. The time (in hours) each employee will take to perform each job is given in the following matrix:  

                Employees

   I II III IV V
A 10 5 13 15 16
B 3 9 18 13 6
C 10 7 2 2 2
D 7 11 9 7 12
E 7 9 10 4 12

How should the jobs be allocated, one per employee, so as to minimize the total man-hours?


A department has 5 jobs to be performed and there are five employees to perform these jobs. The time (in hours) each employee will take to perform each job is given in the following matrix:  


An insurance company has decided to modernize and refit one of its branch offices. Some of the existing office equipments will be disposed of but the remaining will be returned to the branch on completion of the renovation work. Tenders are invited from a number of selected contractors. The contractors will be responsible for all the activities in connection with the renovation work excepting the prior removal of the old equipment and its subsequent replacement. The major elements of the project have been identified as follows along with their durations and immediately preceding element:


Formulate the dual of the LPP

Max.x_{1} +2x_{2} +x_{3} leq 10

Subject to  x_{1} +2x_{2} +x_{3} leq 10

                 3x_{1} +2x_{2} +5x_{3} leq 15

                  x_{1} +x_{2}, +x_{3} geq 0


Solve the following LPP by simplex method:

Max 9x_{1} +7x_{2} +7x_{3}

Subject to   3x1+ x_{2} +2x_{3} leq 12

                    x_{1},5 x_{2}, +3x_{3} leq 30

                     x_{1}, x_{2}, x_{3} geq 0.


Discuss the models of conflict process with examples

Call Now
Contact Us
Welcome to IGNOU Academy

Click to Contact Us

Call - 9199852182 Call - 9852900088 myabhasolutions@gmail.com WhatsApp - 9852900088
New to IGNOU Login to Get Every Update