Scribd
Upload
52 views3 pages

Or Assignment

بحوث

Uploaded by

abdelrhmanyassin3
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
52 views3 pages

Or Assignment

بحوث

Uploaded by

abdelrhmanyassin3
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

Operations Research (OR)

Assignment (4)
Due Date: Monday 24/6/2024 11:59:59 PM

Instructions:
Please follow the below steps in order to complete this assignment:
• Make sure your handwriting is clear and neat.
• Take images of your solution and save them in a single file as PDF.
• Rename the file: Assignment(4)yourIndex.
For ex: Assignment(4)18-111.
• Use this link “submission link” to upload and submit your solution.
Please Don’t:
• Copy or resend other student work since both submissions will not
be graded.
• Send a file larger than 10 MB.
Assignment 4

Operations Research( OR)


Assignment 4
1
In the Reddy Mikks model, consider the feasible solution x1 = 2 tons and x2 = 2
tons. Determine the value of the associated slacks for raw materials M1 and
M2.

2
In the diet model, determine the surplus amount of feed consisting of 525 lb of
corn and 425 lb of soybean meal.

3
Consider the following inequality

22x1 − 4x2 ≥ −7

Show that multiplying both sides of the inequality by (-1) and then converting
the resulting inequality into an equation is the same as converting it first to
an equation and then multi plying both sides by (-1).

4
Two different products, P1 and P2, can be manufactured by one or both of two
different machines, M1 and M2. The unit processing time of either product on
either machine is the same. The daily capacity of machine M1 is 200 units (of
either P1 or P2, or a mix of both), and the daily capacity of machine M2 is 250
units. The shop supervisor wants to balance the production schedule of the two
machines such that the total number of units produced on one machine is within
5 units of the number produced on the other. The profit per unit of P1 is $10
and that of P2 is $15. Set up the problem as an LP in equation form.

5
Show how the following objective function can be presented in equation form:

M inimize z = max{|x1 − x2 + 3x3 |, | − x1 + 3x2 − x3 |}

x1 , x2 , x3 ≥ 0
(Hint: |a| ≤ b is equivalent to a ≤ b and a ≥ −b.)

Page 1 of 2 U of K-FMSI-Department of Statistics-Lina Asmally


Assignment 4

6
The following tableau represents a specific simplex iteration. All variables are
nonnegative. The tableau is not optimal for either maximization or minimiza-
tion. Thus, when a nonbasic variable enters the solution, it can either increase
or decrease z or leave it unchanged, depending on the parameters of the entering
nonbasic variable.

Basic x1 x2 x3 x4 x5 x6 x7 x8 Solution
z 0 -5 0 4 -1 -10 0 0 620
x8 0 3 0 -2 -3 -1 5 1 12
x3 0 1 1 3 1 0 3 0 6
x1 1 -1 0 0 6 -4 0 0 0
1. Categorize the variables as basic and nonbasic, and provide the current
values of all the variables.
2. Assuming that the problem is of the maximization type, identify the non-
basic variables that have the potential to improve the value of z. If each
such variable enters the basic solution, determine the associated leaving
variable, if any, and the associated change in z. Do not use the Gauss-
Jordan row operations.
3. Repeat part (2) assuming that the problem is of the minimization type.

7
Solve the following lb model:
Minimize z = 3x1 + 2x2 + 3x3
subject to:
x1 + 4x2 + x3 ≥ 14
2x1 + x2 + x4 ≥ 20
x1 , x2 , x3 , x4 ⪰ 0

8
Solve the following LP model using M-Method and Two Phase Method

Maximize z = x1 + 5x2 + 3x3


subject to:
x1 + 2x2 + x3 = 6
2x1 - x2 = 8
x1 , x2 , x3 ⪰ 0

Page 2 of 2 U of K-FMSI-Department of Statistics-Lina Asmally

You might also like