Scribd
Upload
32 views

Linear Programming Is Project Management Use Two Methods-1

Uploaded by

Zayed ALariqi
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
32 views

Linear Programming Is Project Management Use Two Methods-1

Uploaded by

Zayed ALariqi
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
You are on page 1/ 3

Student name: Mohammed Alquaishi.

Eng: Aliaa Alhmiari.

Linear programming is project management use two methods


Graphical and simplex methods
Graphical
• using Graph
• just using two variables, not more than two
Graphical method
• we have object function to minimize or maximum profit
• We have constraints, no negative

simplex method
• No graph
• can solve either two or more than two variables

Step Graphical
1. graphic constraints
2. Shade region (according < or >)
3. Find corner
4. Suitable in the objective function
5. Choose the minimize value if minimum, choose maximize if maximum.

step of simplex
step 1
• Rewrite the problem in standard form
• maximize only
• objective function operation with RSH=0
• Constraints For ≤ equation by (+Si) & For ≥ equation by (-Si)
Step 2
• Construct the table for pivot columns and pivot rows
• choose the smallest value objective of column
• determine the ratio test by divide values in pivot in Column with constant and choose
the row with small value in ratio tasting
step 3
• The pivot must be 1
step 4
• in the pivot columns of other elements is zero
step 5
• repeat steps 2,3 & 4 until there's no negative number in objective row.
Step 6
Take the constraint value & put the in objective equation.

Multiple choice questions related to linear programming, focusing on graphical and simplex
methods:

1. In graphical linear programming, the objective is to maximize profit.


- True
- False

2. The graphical method of linear programming can handle problems with more than two
variables.
- True
- False

3. The simplex method of linear programming involves constructing tables for pivot columns
and rows.
- True
- False

4. In the simplex method, constraints are rewritten in standard form where all inequalities are
converted to equalities.
- True
- False

5. In the graphical method, the shaded region represents feasible solutions that satisfy all
constraints.
- True
- False

6. In the simplex method, the objective is to minimize the objective function.


- True
- False

7. In the graphical method, if the objective function is to minimize cost, the optimal solution is
found at the point with the highest value within the feasible region.
- True
- False

8. When applying the simplex method, the pivot element in a table must always be 1.
- True
- False

9. In the simplex method, once the solution is obtained, there is no need to check for optimality.
- True
- False

10. In graphical linear programming, if the feasible region is unbounded, the problem has no
feasible solution.
- True
- False

11. The simplex method can handle linear programming problems with any number of variables
and constraints.
- True
- False

12. The simplex method guarantees finding the globally optimal solution to a linear
programming problem.
- True
- False

13. In the graphical method, the corner points of the feasible region are found by solving the
system of equations formed by the constraints.
- True
- False

14. In the simplex method, the objective is always to minimize the objective function.
- True
- False

15. In linear programming, if the objective function is to maximize profit, and all constraints are
inequalities, the problem can be solved using either the graphical or simplex method.
- True
- False

You might also like