Problems 21-30 refer to the table below of the six basic solutions to the e-system 2 x 1 + 3 x 2 + s 1 = 24 4 x 1 + 3 x 2 + s 2 = 36 x 1 x 2 s 1 s 2 A 0 0 24 36 B 0 8 0 12 C 0 12 − 12 0 D 12 0 0 − 12 E 9 0 6 0 F 6 4 0 0 Use the basic feasible solutions to maximize P = 8 x 1 + 5 x 2 .
Problems 21-30 refer to the table below of the six basic solutions to the e-system 2 x 1 + 3 x 2 + s 1 = 24 4 x 1 + 3 x 2 + s 2 = 36 x 1 x 2 s 1 s 2 A 0 0 24 36 B 0 8 0 12 C 0 12 − 12 0 D 12 0 0 − 12 E 9 0 6 0 F 6 4 0 0 Use the basic feasible solutions to maximize P = 8 x 1 + 5 x 2 .
Solution Summary: The author calculates the maximized value of P=8x_1+52 from the basic feasible solutions of the e-system.
The final answer is 8/π(sinx) + 8/3π(sin 3x)+ 8/5π(sin5x)....
Keity
x२
1. (i)
Identify which of the following subsets of R2 are open and which
are not.
(a)
A = (2,4) x (1, 2),
(b)
B = (2,4) x {1,2},
(c)
C = (2,4) x R.
Provide a sketch and a brief explanation to each of your answers.
[6 Marks]
(ii)
Give an example of a bounded set in R2 which is not open.
[2 Marks]
(iii)
Give an example of an open set in R2 which is not bounded.
[2 Marks
2.
(i)
Which of the following statements are true? Construct coun-
terexamples for those that are false.
(a)
sequence.
Every bounded sequence (x(n)) nEN C RN has a convergent sub-
(b)
(c)
(d)
Every sequence (x(n)) nEN C RN has a convergent subsequence.
Every convergent sequence (x(n)) nEN C RN is bounded.
Every bounded sequence (x(n)) EN CRN converges.
nЄN
(e)
If a sequence (xn)nEN C RN has a convergent subsequence, then
(xn)nEN is convergent.
[10 Marks]
(ii)
Give an example of a sequence (x(n))nEN CR2 which is located on
the parabola x2 = x², contains infinitely many different points and converges
to the limit x = (2,4).
[5 Marks]
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