Scribd
Upload
900 views2 pages

Maximize Z X X X Subject To X X X X X X X and XXX Write The Form and Starting Tableau of The Linear Program G Problem

The document contains 5 questions related to linear programming problems. Question 1 asks to write the standard form and starting tableau of a maximization problem. Question 2 asks to discuss the feasibility of an initial basic solution for another maximization problem. Question 3 asks to convert a minimization problem into a maximization problem. Question 4 provides an initial basic feasible solution tableau and asks to find the next improved solution using the simplex method. Question 5 asks to express an objective function in terms of non-basic variables and evaluate the initial basic solution.

Uploaded by

Azeem
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
900 views2 pages

Maximize Z X X X Subject To X X X X X X X and XXX Write The Form and Starting Tableau of The Linear Program G Problem

The document contains 5 questions related to linear programming problems. Question 1 asks to write the standard form and starting tableau of a maximization problem. Question 2 asks to discuss the feasibility of an initial basic solution for another maximization problem. Question 3 asks to convert a minimization problem into a maximization problem. Question 4 provides an initial basic feasible solution tableau and asks to find the next improved solution using the simplex method. Question 5 asks to express an objective function in terms of non-basic variables and evaluate the initial basic solution.

Uploaded by

Azeem
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

Question No 1:

Maximize Z 3 x1 5 x2 4 x 3
subject to
2 x1 3 x2 8
2 x2 5 x 3 10
3 x1 2 x2 4 x 3 15
and x1 , x2 , x 3 0
Write the standard form and starting tableau of the linear program min g problem

Question No 2:
Discuss the feasibility of the initial basic solution to a linear programming problem subject to the
following constraint.
Maximize Z=4x1 +3x 2
Subject to
x1 +x 2 50
x1 +2x 2 80
3x1 +2x 2 140
x1 ,x 2 0

Question No 3:
Convert the following minimization problem into maximization problem
Minimize Z=x1 -3x 2 +2x 3
Subject to
3x1 -x 2 +2x 3 7
-2x1 +4x 2 12
-4x1 +3x 2 +8x 3 10
x1 ,x 2 ,x 3 0

Question No 4:
Initial basic feasible solution of linear programming problem is given in the following table

[Link] [Link] Z x1 x2 x3 S1 S2 S3 RHS Ratio


0 - 1 -3 -5 -4 0 0 0 0
1 S1 0 2 3 0 1 0 0 8 8/3
2 S2 0 3 2 4 0 1 0 15 15/2
3 S3 0 0 2 5 0 0 1 10 5
Find the next improved solution using the simplex algorithm.
Question No 5:
Express the objective function of following linear programming problem in terms of non-basic
variable and hence evaluate the initial basic feasible solution.
Minimize Z=3x+2y+7z
Subject to
-x+y=10
2x-y+z 10
x,y,z 0

You might also like