Solve or prove that there is no solution to the following LP problems by verifying any graphical results using the Simplex method.
1) Minimize: z = x1 – x2
Subject to: x1 + x2 ≤ –1
With: x1 & x2 nonnegative.
2) Minimize: z = x1 – x2
Subject to: x1 + x2 ≥ –1
With: x1 & x2 nonnegative.
3) Maximize: z = x1 – x2
Subject to: x1 + x2 ≥ –1
With: x1 & x2 nonnegative.
Redo problems 13 imposing the extra constraint that all basic variables are also integer.Consider the following integer programs. Using Chvatal cuts formulate associated LP’s and solve them graphically to obtain an optimal solution if it exists.
4) Maximize: z = 10x1 + x2
Subject to: 2x1 + 5x2 ≤ 11
With: x1 & x2 nonnegative & integer.
5) Maximize: z = 3x1 + 4x2
Subject to: 2x1 + x2 ≤ 6
2x1 + 3x2 ≤ 9
With: x1 & x2 nonnegative & integer.
6) Maximize: z = x (5π – x) on [0, 20].
7) Maximize: z = x2 – 8 on [–4, 4].
8) Maximize: z = x1 (x2 – 1) + x3 (x3
2 – 3) over the entire real line.
Derive algebraically the Kuhntucker conditions of the problem. Then, plot these conditions graphically as well as level contours of the objective function. Finally, using the plot obtain a solution to the optimization problem considered.
10) In general, there are two sizes of oil tankers: those that can go through the Suez canal and those that cannot and in effect have to travel around Africa to get from the Persian Gulf region to a NW European oil terminal. In this problem we are interested in calculating the minimum capacity (in weight/mass of cargo carried) of Suez incompatible tankers so that they are competitive to Suez compatible ones. The following values are of interest.
L, B, T: Principal vessel dimensions
?: Vessel mass displacement
F: Fare charged to customer per unit mass of cargo for single transit
C: Cargo single transit cost per unit mass of cargo
R: Empty ship seagoing cost per nm traveled
WS: Average waiting time per Suez Canal transit
XS: Fee per single Suez Canal transit
P: Port time (for loading or unloading) per unit mass of cargo
V: Vessel’s service speed in open seas
Z: Distance in nm between Gulf and European port of call
For simplicity assume that cargo capacity is equal to mass displacement ? and that ? = ρgLBT.Denote variables related to the Suez compatible vessel by an index of S and those related to the Suez incompatible one by I.Suez Canal constraints: LS <= Lmax, BS <= Bmax, TS <= Tmax. Also: ZI = 5ZS.Determine ?I for economic feasibility if the following are known:ρ,g, Lmax, Bmax, Tmax, ZS, WS, XS, FS, CS/I, RS/I, PS/I, VS/I
Z= x_{1}x_{2}
Our Constraint is
x_{1}+x_{2 }≤_{ } 1
It can be written as
x_{1}+x_{2 = } 1
x_{1} & x_{2 }are non negative values.
Simplex Method:
Z_{1}= x_{1}x_{2} + OS,
x_{1} + x_{2 }+ s_{1 }= 1
s_{1 }is the slack variable.
Initial Table:
CB_{i} 
C_{i} 
1 1 0 
Solution 
Rate 
Basic Variable 
x_{1} x_{2} s_{1} 

0 
S_{i} 
1 1 1 
1 
1/1 = 1 
Z_{i} 
0 0 0 
0 
C_{i  }Z_{i} 1 1 0
Z_{i =}
For Minimization:
All C_{i  }Z_{i} ≥ 0
Iteration 1:
Here we check the C_{i  }Z_{i} value as maximum that is 1 first column. The corresponding column value is S_{i }= 1. This is called key column.
CB_{i} 
C_{i} 
1 1 0 
Solution 
Rate 
Basic Variable 
x_{1} x_{2} s_{1} 

0 
S_{i} 
1 1 1 
1 

Z_{i} 
1 1 1 
0 
C_{i  }Z_{i} 0 2 1
The above C_{i – }Z_{i }values does not satisfy minimization constraint.
All C_{i  }Z_{i} ≥ 0
So, we cannot find the solution for this problem.
Question – 2
Minimize:
Z= x_{1}x_{2}
Our Constraint is
x_{1}+x_{2 }≥_{ } 1
It can be written as
x_{1}+x_{2 = } 1
x_{1} & x_{2 }are non negative values.
Simplex Method:
Z_{1}= x_{1}x_{2} + OS,
x_{1} + x_{2 }+ s_{1 = 1}
s_{1 }is the slack variable.
Initial Table:
CB_{i} 
C_{i} 
1 1 0 
Solution 
Rate 
Basic Variable 
x_{1} x_{2} s_{1} 

0 
S_{i} 
1 1 1 
1 

Z_{i} 
0 0 0 
0 
C_{i  }Z_{i} 1 1 0_{ }
For Minimization:
All C_{i  }Z_{i} ≥ 0
Iteration 1:
Here we check the C_{i  }Z_{i} value as maximum that is 1 first column. The corresponding column value is S_{i }= 1. This is called key column.
CB_{i} 
C_{i} 
1 1 0 
Solution 
Rate 
Basic Variable 
x_{1} x_{2} s_{1} 

0 
S_{i} 
1 1 1 
1 

Z_{i} 
1 1 1 
0 
C_{i  }Z_{i} 0 2 1
The above C_{i – }Z_{i }values does not satisfy minimization constraint.
All C_{i  }Z_{i} ≥ 0
So, we cannot find the solution for this problem.
Question – 3
Minimize:
Z= x_{1}x_{2}
Our Constraint is
x_{1}+x_{2 }≥_{ } 1
x_{1} & x_{2 }are non negative values.
Simplex Method:
Z_{1}= x_{1}x_{2} + 0
x_{1} + x_{2 }+ s_{1 }= 1
s_{1 }is the slack variable.
The Constraint can be written as,
x_{1}+x_{2 = } 1
x_{1} + x_{2 }+ s_{1 }= 1
The constraint confliction is >=. So, the independent variables should be in negative.
x_{1}  x_{2 } s_{1 }= 1
Initial Table:
CB_{i} 
C_{i} 
1 1 0 
Solution 
Rate 
Basic Variable 
x_{1} x_{2} s_{1} 

0 
S_{i} 
1 1 1 
1 
1 
Z_{i} 
1 1 0 
0 
C_{i  }Z_{i} 0 0 0
The solution for this problem is unbounded.
Question – 4
Z= 10x_{1}+x_{2}
Our Constraint is
2x_{1}+5x_{2 }≤_{ }11
It can be written as
2x_{1}+5x_{2 }=_{ }11
Take x1=0,
2(0)+5x_{2 }=_{ }11
x_{2} = 11/5
x_{2} = 2.2
take x2 = 0
2x_{1}+5(0)_{ }=_{ }11
x_{1} = 11/2
x_{1} = 5.5
x_{1} 
0 
2.2 
X_{2} 
5.5 
0 
The shaded parts are the feasible solution.
(0, 2.2)
Z=10 x1 + x2
Z=10(0) +2.2
Z=2.2
(5.5, 0)
Z=10(5.5) + 0
Z=55
For maximization, Z=55 is the solution.
Question – 5
Maximize:
Z= 3x_{1}+4x_{2}
The constraints are,
2x_{1}+x_{2 }≤ 6
2x_{1}+3x_{2 }≤ 9
We can written as,
2x_{1}+x_{2 }= 6
2x_{1}+3x_{2 }= 9
If we take x1 = 0
2 (0) +x_{2 }= 6
x_{2 }= 6
If we take x2 = 0
2x_{1}+0_{ }= 6
x_{1 }= 6/3
x_{1 }=2
x_{1} 
0 
3 
X_{2} 
6 
0 
x_{1} =_{ }0,
2x_{1}+3x_{2 }= 9
2(0) + 3x_{2 }= 9
3x_{2 }= 9
x_{2 }= 9/3
x_{2 }= 3
x_{2} =_{ }0,
2x_{1}+3x_{2 }= 9
2 x_{1}+ 3(0)_{ }= 9
2 x_{1 }= 9
x_{1}= 9/2
x_{1 }= 4.5
x_{1} 
0 
4.5 
X_{2} 
3 
0 
point is (2.25, 1.5)
For maximization,
(0, 6)
Z = 3x_{1}+4x_{2}
Z = 3(0) + 4(6)
Z = 24
(4.5, 0)
Z = 3x_{1}+4x_{2}
Z = 3(4.5) + 4(0)
Z = 13.5
(2.25, 1.5)
Z = 3x_{1}+4x_{2}
Z = 3(2.25) + 4(1.5)
Z = 12.75
The solution is (0,6).
The shaded parts of the graph is feasible solution.
Question 6
Maximize: z = x (5π – x) on [0, 20]
The value of π is 3.14.
Z = x (5*3.14 – x)
Z = x (15.7 – x)
Z = 15.7x – x^{2}
In [0, 20], the value of x is 0,
Z = 15.7 (0) – 0
Z = 0
Use the quadratic formula,
The equation is,
Z = 15.7x – x^{2}
The solution is x = 16 and x = 16
X=0 X=0.064
V=0 V=0
Question 7
Maximize: z = x^{2} – 8 on [4, 4]
In [4, 4], the value of x is 4,
Z = (4^{2})8
Z = 168
Z = 8
Use the quadratic formula,
The equation is,
Z = x^{2 } 8 X = 2.825 X = 0 X = 2.825
Z = 0 Z = 8
Question 8
Maximize: z = x1(x21) + x3(x3^{2} – 3)
If we take x1 = 0, x2 = 1, x3 = 1
Z = 0(11) + (1)((1^{2})3)
Z = 2
If we take x1 = 1, x2 = 1, x3 = 0
Z = 1(11) + 0(03)
Z = 2
If we take x1 = 1, x2 = 0, x3 = 1
Z = 1(01) + 1(13)
Z = 1 – 2
Z = 1
X1 
X2 
X3 
Z 
0 
1 
1 
2 
1 
1 
0 
2 
1 
0 
1 
1 
Question 9
Minimize: f(x_{1, }x_{2}) = (x_{1} – 4)^{2} +(x_{2} – 4)^{2}
The constraints are,
x_{1}+x_{2 }≤ 4
x_{1}+3x_{2 }≤ 9
We can written as,
x_{1}+x_{2 }= 4
x_{1}+3x_{2 }= 9
If we take x1 = 0
(0) +x_{2 }= 4
x_{2 }= 4
If we take x2 = 0
x_{1}+0_{ }= 4
x_{1 }= 4
x_{1 }=4
X1 
0 
4 
X2 
4 
0 
If we take x1 = 0
(0) +3x_{2 }= 9
x_{2 }= 9/3
x_{2 }= 3
If we take x2 = 0
x_{1}+0_{ }= 9
x_{1 }= 9
x_{1 }=9
X1 
0 
3 
X2 
9 
0 
(0,0) (4,0) (9,0)
We have,
L(x_{1}, x_{2}) 
= 
(x_{1} − 4)^{2} + (x_{2} − 4)^{2} − λ_{1}(x_{1} + x_{2} − 4) − λ_{2}(x_{1} + 3x_{2} − 9) 
The KuhnTucker conditions are,
−2(x_{1} − 4) − λ_{1} − λ_{2} = 0
−2(x_{2} − 4) − λ_{1} − 3λ_{2} = 0
x_{1} + x_{2} ≤ 4, λ_{1} ≥ 0, and λ_{1}(x_{1} + x_{2} − 4) = 0
x_{1} + 3x_{2} ≤ 9, λ_{2} ≥ 0, and λ_{2}(x_{1} + 3x_{2} − 9) = 0
To export a reference to this article please select a referencing stye below:
My Assignment Help. (2021). Optimization Using Simplex Method: Essay On Efficient Problemsolving.. Retrieved from https://myassignmenthelp.com/freesamples/enmg6150developmentandmanagement/column.html.
"Optimization Using Simplex Method: Essay On Efficient Problemsolving.." My Assignment Help, 2021, https://myassignmenthelp.com/freesamples/enmg6150developmentandmanagement/column.html.
My Assignment Help (2021) Optimization Using Simplex Method: Essay On Efficient Problemsolving. [Online]. Available from: https://myassignmenthelp.com/freesamples/enmg6150developmentandmanagement/column.html
[Accessed 16 June 2024].
My Assignment Help. 'Optimization Using Simplex Method: Essay On Efficient Problemsolving.' (My Assignment Help, 2021) <https://myassignmenthelp.com/freesamples/enmg6150developmentandmanagement/column.html> accessed 16 June 2024.
My Assignment Help. Optimization Using Simplex Method: Essay On Efficient Problemsolving. [Internet]. My Assignment Help. 2021 [cited 16 June 2024]. Available from: https://myassignmenthelp.com/freesamples/enmg6150developmentandmanagement/column.html.