Essentials of Discrete Mathematics
3rd Edition
ISBN: 9781284056242
Author: David J. Hunter
Publisher: Jones & Bartlett Learning
expand_more
expand_more
format_list_bulleted
Concept explainers
Videos
Question
Chapter 1.3, Problem 17E
To determine
(a)
Translation of the given statement into predicate logic.
To determine
(b)
Translation of the given statement into predicate logic.
To determine
(c)
Translation of the given predicate logic statement into English statement.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Client
1
Weight before
diet (pounds)
Weight after
diet (pounds)
128
120
2
131
123
3
140
141
4
178
170
5
121
118
6
136
136
7
118
121
8
136
127
a) Determine the mean change in patient weight from before to after the
diet (after – before). What is the 95% confidence interval of this mean
difference?
You manage a chemical company with 2 warehouses. The following quantities of
Important Chemical A have arrived from an international supplier at 3 different
ports:
Chemical Available (L)
Port 1
Port 2
Port 3
400
110
100
The following amounts of Important Chemical A are required at your warehouses:
Warehouse 1
Warehouse 2
Chemical Required (L)
380
230
The cost in £ to ship 1L of chemical from each port to each warehouse is as follows:
Warehouse 1 Warehouse 2
Port 1
£10
£45
Port 2
£20
£28
Port 3
£13
£11
(a) You want to know how to send these shipments as cheaply as possible. For-
mulate this as a linear program (you do not need to formulate it in standard
inequality form) indicating what each variable represents.
a) Suppose that we are carrying out the 1-phase simplex algorithm on a linear program in
standard inequality form (with 3 variables and 4 constraints) and suppose that we have
reached a point where we have obtained the following tableau. Apply one more pivot
operation, indicating the highlighted row and column and the row operations you carry
out. What can you conclude from your updated tableau?
x1 12 23
81
82
83
S4
$1
-20
1 1
0
0
0
3
82
3 0
-2
0
1
2
0
6
12
1
1
-3
0
0
1
0
2
84
-3 0
2
0
0
-1 1 4
2
-2
0 11
0
0
-4
0
-8
b) Solve the following linear program using the 2-phase simplex algorithm. You should give
the initial tableau and each further tableau produced during the execution of the
algorithm. If the program has an optimal solution, give this solution and state its
objective value. If it does not have an optimal solution, say why.
maximize 21 - - 2x2 + x3 - 4x4
subject to 2x1+x22x3x4≥ 1,
5x1+x2-x3-4 -1,
2x1+x2-x3-342,
1, 2, 3, 4 ≥0.
Chapter 1 Solutions
Essentials of Discrete Mathematics
Ch. 1.1 - Prob. 1ECh. 1.1 - Prob. 2ECh. 1.1 - Prob. 3ECh. 1.1 - Prob. 4ECh. 1.1 - Prob. 5ECh. 1.1 - Prob. 6ECh. 1.1 - Prob. 7ECh. 1.1 - Prob. 8ECh. 1.1 - Prob. 9ECh. 1.1 - Prob. 10E
Ch. 1.1 - Prob. 11ECh. 1.1 - Prob. 12ECh. 1.1 - Prob. 13ECh. 1.1 - Prob. 14ECh. 1.1 - Prob. 15ECh. 1.1 - Prob. 16ECh. 1.1 - Prob. 17ECh. 1.1 - Prob. 18ECh. 1.1 - Prob. 19ECh. 1.1 - Prob. 20ECh. 1.1 - Prob. 21ECh. 1.1 - Prob. 22ECh. 1.1 - Prob. 23ECh. 1.1 - Prob. 24ECh. 1.1 - Prob. 25ECh. 1.1 - Prob. 26ECh. 1.1 - Prob. 27ECh. 1.1 - Prob. 28ECh. 1.1 - Prob. 29ECh. 1.1 - Prob. 30ECh. 1.1 - Prob. 31ECh. 1.1 - Prob. 32ECh. 1.2 - Prob. 1ECh. 1.2 - Prob. 2ECh. 1.2 - Prob. 3ECh. 1.2 - Prob. 4ECh. 1.2 - Prob. 5ECh. 1.2 - Prob. 6ECh. 1.2 - Prob. 7ECh. 1.2 - Prob. 8ECh. 1.2 - Prob. 9ECh. 1.2 - Prob. 10ECh. 1.2 - Prob. 11ECh. 1.2 - Prob. 12ECh. 1.2 - Prob. 13ECh. 1.2 - Prob. 14ECh. 1.2 - Prob. 15ECh. 1.2 - Prob. 16ECh. 1.2 - Prob. 17ECh. 1.2 - Prob. 18ECh. 1.2 - Prob. 19ECh. 1.2 - Prob. 20ECh. 1.2 - Prob. 21ECh. 1.2 - Prob. 22ECh. 1.2 - Prob. 23ECh. 1.2 - Prob. 24ECh. 1.2 - Prob. 25ECh. 1.2 - Prob. 26ECh. 1.2 - Prob. 27ECh. 1.2 - Prob. 28ECh. 1.3 - Prob. 1ECh. 1.3 - Prob. 2ECh. 1.3 - Prob. 3ECh. 1.3 - Prob. 4ECh. 1.3 - Prob. 5ECh. 1.3 - Prob. 6ECh. 1.3 - Prob. 7ECh. 1.3 - Prob. 8ECh. 1.3 - Prob. 9ECh. 1.3 - Prob. 10ECh. 1.3 - Prob. 11ECh. 1.3 - Prob. 12ECh. 1.3 - Prob. 13ECh. 1.3 - Prob. 14ECh. 1.3 - Prob. 15ECh. 1.3 - Prob. 16ECh. 1.3 - Prob. 17ECh. 1.3 - Prob. 18ECh. 1.3 - Prob. 19ECh. 1.3 - Prob. 20ECh. 1.3 - Prob. 21ECh. 1.3 - Prob. 22ECh. 1.3 - Prob. 23ECh. 1.3 - Prob. 24ECh. 1.3 - Prob. 25ECh. 1.4 - Prob. 1ECh. 1.4 - Prob. 2ECh. 1.4 - Prob. 3ECh. 1.4 - Prob. 4ECh. 1.4 - Prob. 5ECh. 1.4 - Prob. 6ECh. 1.4 - Prob. 7ECh. 1.4 - Prob. 8ECh. 1.4 - Prob. 9ECh. 1.4 - Prob. 10ECh. 1.4 - Prob. 11ECh. 1.4 - Prob. 12ECh. 1.4 - Prob. 13ECh. 1.4 - Prob. 14ECh. 1.4 - Prob. 15ECh. 1.4 - Prob. 16ECh. 1.4 - Prob. 17ECh. 1.4 - Prob. 18ECh. 1.4 - Prob. 19ECh. 1.4 - Prob. 20ECh. 1.4 - Prob. 21ECh. 1.4 - Prob. 22ECh. 1.4 - Prob. 23ECh. 1.4 - Prob. 24ECh. 1.4 - Prob. 25ECh. 1.4 - Prob. 26ECh. 1.4 - Prob. 27ECh. 1.4 - Prob. 28ECh. 1.4 - Prob. 29ECh. 1.4 - Prob. 30ECh. 1.5 - Prob. 1ECh. 1.5 - Prob. 2ECh. 1.5 - Prob. 3ECh. 1.5 - Prob. 4ECh. 1.5 - Prob. 5ECh. 1.5 - Prob. 6ECh. 1.5 - Prob. 7ECh. 1.5 - Prob. 8ECh. 1.5 - Prob. 9ECh. 1.5 - Prob. 10ECh. 1.5 - Prob. 11ECh. 1.5 - Prob. 12ECh. 1.5 - Prob. 13ECh. 1.5 - Prob. 14ECh. 1.5 - Prob. 15ECh. 1.5 - Prob. 16ECh. 1.5 - Prob. 17ECh. 1.5 - Prob. 18ECh. 1.5 - Prob. 19ECh. 1.5 - Prob. 20ECh. 1.5 - Prob. 21ECh. 1.5 - Prob. 22ECh. 1.5 - Prob. 23ECh. 1.5 - Prob. 24ECh. 1.5 - Prob. 25E
Knowledge Booster
Learn more about
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.Similar questions
- Suppose we have a linear program in standard equation form maximize c'x subject to Ax=b, x≥ 0. and suppose u, v, and w are all optimal solutions to this linear program. (a) Prove that zu+v+w is an optimal solution. (b) If you try to adapt your proof from part (a) to prove that that u+v+w is an optimal solution, say exactly which part(s) of the proof go wrong. (c) If you try to adapt your proof from part (a) to prove that u+v-w is an optimal solution, say exactly which part(s) of the proof go wrong.arrow_forward(a) For the following linear programme, sketch the feasible region and the direction of the objective function. Use you sketch to find an optimal solution to the program. State the optimal solution and give the objective value for this solution. maximize +22 subject to 1 + 2x2 ≤ 4, 1 +3x2 ≤ 12, x1, x2 ≥0 (b) For the following linear programme, sketch the feasible region and the direction of the objective function. Explain, making reference to your sketch, why this linear programme is unbounded. maximize ₁+%2 subject to -2x1 + x2 ≤ 4, x1 - 2x2 ≤4, x1 + x2 ≥ 7, x1,x20 Give any feasible solution to the linear programme for which the objective value is 40 (you do not need to justify your answer).arrow_forwardfind the domain of the function f(x)arrow_forward
- For each of the following functions, find the Taylor Series about the indicated center and also determine the interval of convergence for the series. 1. f(x) = ex-2, c = 2 Π == 2. f(x) = sin(x), c = 2arrow_forwardQUESTION 5. Show that if 0 ≤r≤n, then r+2 r r (c) + (+³) + (+³) +- + (*) -(+) n n+ = r (1)...using induction on n. (2) ...using a combinatorial proof.arrow_forwardUse a power series to approximate each of the following to within 3 decimal places: 1. arctan 2. In (1.01)arrow_forward
- For each of the following power series, find the interval of convergence and the radius of convergence: n² 1.0 (x + 1)" n=1 շո 3n 2. Σ n=1 (x-3)n n3arrow_forwardUse a known series to find a power series in x that has the given function as its sum: 1. xcos(x³) 2. In (1+x) xarrow_forwardif n is odd integer then 4 does not divide narrow_forward
- or W Annuities L Question 2, 5.3.7 > Find the future value for the ordinary annuity with the given payment and interest rate. PMT = $2,000; 1.65% compounded quarterly for 11 years. The future value of the ordinary annuity is $ (Do not round until the final answer. Then round to the nearest cent as needed.) example Get more help Q Search 30 Larrow_forwardFind the cdf of a random variable Y whose pdf is given by; 2, 0≤x≤1 1/3, 0≤x≤1 a) f(x)=3, 2≤x≤4 0, elsewhere 2, 1≤x≤2 b) f(x)= (3-x)2, 2≤x≤3 0, elsewherearrow_forwardFor all integers a and b, a + b is not ≡ 0(mod n) if and only if a is not ≡ 0(mod n)a or is not b ≡ 0(mod n). Is conjecture true or false?why?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Elementary Geometry For College Students, 7eGeometryISBN:9781337614085Author:Alexander, Daniel C.; Koeberlein, Geralyn M.Publisher:Cengage,
Elementary Geometry For College Students, 7e
Geometry
ISBN:9781337614085
Author:Alexander, Daniel C.; Koeberlein, Geralyn M.
Publisher:Cengage,
Propositional Logic, Propositional Variables & Compound Propositions; Author: Neso Academy;https://www.youtube.com/watch?v=Ib5njCwNMdk;License: Standard YouTube License, CC-BY
Propositional Logic - Discrete math; Author: Charles Edeki - Math Computer Science Programming;https://www.youtube.com/watch?v=rL_8y2v1Guw;License: Standard YouTube License, CC-BY
DM-12-Propositional Logic-Basics; Author: GATEBOOK VIDEO LECTURES;https://www.youtube.com/watch?v=pzUBrJLIESU;License: Standard Youtube License
Lecture 1 - Propositional Logic; Author: nptelhrd;https://www.youtube.com/watch?v=xlUFkMKSB3Y;License: Standard YouTube License, CC-BY
MFCS unit-1 || Part:1 || JNTU || Well formed formula || propositional calculus || truth tables; Author: Learn with Smily;https://www.youtube.com/watch?v=XV15Q4mCcHc;License: Standard YouTube License, CC-BY