Solve the linear programming problems in Problem 21-36 by applying the simplex method to the dual problem. Minimize C = 10 x 1 + 4 x 2 subject to 2 x 1 + x 2 ≥ 6 x 1 − 4 x 2 ≥ − 24 − 8 x 1 + 5 x 2 ≥ − 24 x 1 , x 2 ≥ 0
Solve the linear programming problems in Problem 21-36 by applying the simplex method to the dual problem. Minimize C = 10 x 1 + 4 x 2 subject to 2 x 1 + x 2 ≥ 6 x 1 − 4 x 2 ≥ − 24 − 8 x 1 + 5 x 2 ≥ − 24 x 1 , x 2 ≥ 0
Solution Summary: The author explains how to calculate the solution of the minimization problem by determining the dual form of it.
=
Q6 What will be the allowable bearing capacity of sand having p = 37° and ydry
19 kN/m³ for (i) 1.5 m strip foundation (ii) 1.5 m x 1.5 m square footing and
(iii)1.5m x 2m rectangular footing. The footings are placed at a depth of 1.5 m
below ground level. Assume F, = 2.5. Use Terzaghi's equations.
0
Ne
Na
Ny
35 57.8 41.4 42.4
40 95.7 81.3 100.4
Q1 The SPT records versus depth are given in table below. Find qan for the raft 12%
foundation with BxB-10x10m and depth of raft D-2m, the allowable
settlement is 50mm.
Elevation, m 0.5 2
2 6.5 9.5 13 18 25
No.of blows, N 11 15 29 32 30 44
0
estigate shear
12%
2
Chapter 6 Solutions
Finite Mathematics for Business, Economics, Life Sciences, and Social Sciences (14th Edition)
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.
Solve ANY Optimization Problem in 5 Steps w/ Examples. What are they and How do you solve them?; Author: Ace Tutors;https://www.youtube.com/watch?v=BfOSKc_sncg;License: Standard YouTube License, CC-BY
Types of solution in LPP|Basic|Multiple solution|Unbounded|Infeasible|GTU|Special case of LP problem; Author: Mechanical Engineering Management;https://www.youtube.com/watch?v=F-D2WICq8Sk;License: Standard YouTube License, CC-BY