Finite Mathematics for Business, Economics, Life Sciences, and Social Sciences (13th Edition)
13th Edition
ISBN: 9780321945525
Author: Raymond A. Barnett, Michael R. Ziegler, Karl E. Byleen
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 6.3, Problem 36E
If you want to solve a minimization problem by applying the geometric method to the original problem, how many variables and problem constraints must be in the original problem?
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
No chatgpt pls will upvote
Already got wrong chatgpt answer
.
In a town with 5000 adults, a sample of 50 is selected using SRSWOR and asked their opinion of a proposed municipal project; 30 are found to favor it and 20 oppose it. If, in fact, the adults of the town were equally divided on the proposal, what would be the probability of observing what has been observed? Approximate using the Binomial distribution. Compare this with the exact probability which is 0.0418.
1.2.19. Let and s be natural numbers. Let G be the simple graph with vertex set
Vo... V„−1 such that v; ↔ v; if and only if |ji| Є (r,s). Prove that S has exactly k
components, where k is the greatest common divisor of {n, r,s}.
Chapter 6 Solutions
Finite Mathematics for Business, Economics, Life Sciences, and Social Sciences (13th Edition)
Ch. 6.1 - The following linear programming problem has only...Ch. 6.1 - Find an example of a standard maximization problem...Ch. 6.1 - Use the table method to solve the following linear...Ch. 6.1 - Refer to Example 1. Find the basic solution for...Ch. 6.1 - Construct the table of basic solutions and use it...Ch. 6.1 - Construct the table of basic solutions and use it...Ch. 6.1 - Refer to Table 5. For the basic solution...Ch. 6.1 - Prob. 1ECh. 6.1 - Prob. 2ECh. 6.1 - Prob. 3E
Ch. 6.1 - Prob. 4ECh. 6.1 - Problems 9-12 refer to the system...Ch. 6.1 - Problems 9-12 refer to the system...Ch. 6.1 - Problems 9-12 refer to the system...Ch. 6.1 - Problems 9-12 refer to the system...Ch. 6.1 - In Problems 13-20, write the e-system obtained via...Ch. 6.1 - In Problems 13-20, write the e-system obtained via...Ch. 6.1 - In Problems 13-20, write the e-system obtained via...Ch. 6.1 - In Problems 13-20, write the e-system obtained via...Ch. 6.1 - In Problems 13-20, write the e-system obtained via...Ch. 6.1 - In Problems 13-20, write the e-system obtained via...Ch. 6.1 - In Problems 13-20, write the e-system obtained via...Ch. 6.1 - In Problems 13-20, write the e-system obtained via...Ch. 6.1 - Problems 21-30 refer to the table below of the six...Ch. 6.1 - Problems 21-30 refer to the table below of the six...Ch. 6.1 - Problems 21-30 refer to the table below of the six...Ch. 6.1 - Problems 21-30 refer to the table below of the six...Ch. 6.1 - Prob. 21ECh. 6.1 - Prob. 22ECh. 6.1 - Problems 21-30 refer to the table below of the six...Ch. 6.1 - Problems 21-30 refer to the table below of the six...Ch. 6.1 - Problems 21-30 refer to the table below of the six...Ch. 6.1 - Problems 21-30 refer to the table below of the six...Ch. 6.1 - Problems 31-40 refer to the partially completed...Ch. 6.1 - Problems 31-40 refer to the partially completed...Ch. 6.1 - Problems 31-40 refer to the partially completed...Ch. 6.1 - Problems 31-40 refer to the partially completed...Ch. 6.1 - Problems 31-40 refer to the partially completed...Ch. 6.1 - Problems 31-40 refer to the partially completed...Ch. 6.1 - Problems 31-40 refer to the partially completed...Ch. 6.1 - Problems 31-40 refer to the partially completed...Ch. 6.1 - Problems 31-40 refer to the partially completed...Ch. 6.1 - Problems 31-40 refer to the partially completed...Ch. 6.1 - In Problems 41-48, convert the given i-system to...Ch. 6.1 - In Problems 41-48, convert the given i-system to...Ch. 6.1 - In Problems 41-48, convert the given i-system to...Ch. 6.1 - In Problems 41-48, convert the given i-system to...Ch. 6.1 - In Problems 41-48, convert the given i-system to...Ch. 6.1 - In Problems 41-48, convert the given i-system to...Ch. 6.1 - In Problems 41-48, convert the given i-system to...Ch. 6.1 - In Problems 41-48, convert the given i-system to...Ch. 6.1 - In Problems 45-50, graph the system of...Ch. 6.1 - In Problems 45-50, graph the system of...Ch. 6.1 - In Problems 45-50, graph the system of...Ch. 6.1 - In Problems 45-50, graph the system of...Ch. 6.1 - In Problems 45-50, graph the system of...Ch. 6.1 - In Problems 45-50, graph the system of...Ch. 6.1 - In Problems 59-66, solve the given linear...Ch. 6.1 - In Problems 59-66, solve the given linear...Ch. 6.1 - In Problems 59-66, solve the given linear...Ch. 6.1 - In Problems 59-66, solve the given linear...Ch. 6.1 - In Problems 59-66, solve the given linear...Ch. 6.1 - In Problems 59-66, solve the given linear...Ch. 6.1 - In Problems 59-66, solve the given linear...Ch. 6.1 - In Problems 59-66, solve the given linear...Ch. 6.1 - A linear programming problem has four decision...Ch. 6.1 - A linear programming problem has five decision...Ch. 6.1 - A linear programming problem has 30 decision...Ch. 6.1 - A linear programming problem has 40 decision...Ch. 6.2 - Graph the feasible region for the linear...Ch. 6.2 - Solve the following linear programming problem...Ch. 6.2 - Solve using the simplex method:...Ch. 6.2 - Repeat Example 3 modified as follows:Ch. 6.2 - For the simplex tableau in Problems 1-4, (A)...Ch. 6.2 - For the simplex tableau in Problems 1-4, (A)...Ch. 6.2 - For the simplex tableau in Problems 1-4, (A)...Ch. 6.2 - For the simplex tableau in Problems 1-4, (A)...Ch. 6.2 - In Problems 5-8, find the pivot element, identify...Ch. 6.2 - In Problems 5-8, find the pivot element, identify...Ch. 6.2 - In Problems 5-8, find the pivot element, identify...Ch. 6.2 - In Problems 5-8, find the pivot element, identify...Ch. 6.2 - In Problems 9-12, (A) Using the slack variables,...Ch. 6.2 - In Problems 9-12, (A) Using the slack variables,...Ch. 6.2 - In Problems 9-12, (A) Using the slack variables,...Ch. 6.2 - In Problems 9-12, (A) Using the slack variables,...Ch. 6.2 - Solve the linear programming problems in Problems...Ch. 6.2 - Solve the linear programming problems in Problems...Ch. 6.2 - Solve the linear programming problems in Problems...Ch. 6.2 - Solve the linear programming problems in Problems...Ch. 6.2 - Solve the linear programming problems in Problems...Ch. 6.2 - Solve the linear programming problems in Problems...Ch. 6.2 - Solve the linear programming problems in Problems...Ch. 6.2 - Solve the linear programming problems in Problems...Ch. 6.2 - Solve the linear programming problems in Problems...Ch. 6.2 - Solve the linear programming problems in Problems...Ch. 6.2 - Solve the linear programming problems in Problems...Ch. 6.2 - Solve the linear programming problems in Problems...Ch. 6.2 - Solve the linear programming problems in Problems...Ch. 6.2 - Solve the linear programming problems in Problems...Ch. 6.2 - Solve the linear programming problems in Problems...Ch. 6.2 - Solve the linear programming problems in Problems...Ch. 6.2 - In Problems 33 and 34, first solve the linear...Ch. 6.2 - In Problems 33 and 34, first solve the linear...Ch. 6.2 - Solve Problems 35 and 36 by the simplex method and...Ch. 6.2 - Solve Problems 35 and 36 by the simplex method and...Ch. 6.2 - In Problems 37-40, there is a tie for the choice...Ch. 6.2 - In Problems 37-40, there is a tie for the choice...Ch. 6.2 - In Problems 37-40, there is a tie for the choice...Ch. 6.2 - In Problems 37-40, there is a tie for the choice...Ch. 6.2 - In Problems 41-56, construct a mathematical model...Ch. 6.2 - In Problems 41-56, construct a mathematical model...Ch. 6.2 - In Problems 41-56, construct a mathematical model...Ch. 6.2 - In Problems 41-56, construct a mathematical model...Ch. 6.2 - In Problems 41-56, construct a mathematical model...Ch. 6.2 - In Problems 41-56, construct a mathematical model...Ch. 6.2 - In Problems 41-56, construct a mathematical model...Ch. 6.2 - In Problems 41-56, construct a mathematical model...Ch. 6.2 - In Problems 41-56, construct a mathematical model...Ch. 6.2 - In Problems 41-56, construct a mathematical model...Ch. 6.2 - In Problems 41-56, construct a mathematical model...Ch. 6.2 - In Problems 41-56, construct a mathematical model...Ch. 6.2 - In Problems 41-56, construct a mathematical model...Ch. 6.2 - In Problems 41-56, construct a mathematical model...Ch. 6.2 - In Problems 41-56, construct a mathematical model...Ch. 6.2 - In Problems 41-56, construct a mathematical model...Ch. 6.3 - Excluding the nonnegative constraints, the...Ch. 6.3 - The simplex method can be used to solve any...Ch. 6.3 - Form the dual problem:...Ch. 6.3 - Solve the following minimization problem by...Ch. 6.3 - Solve the following minimization problem by...Ch. 6.3 - Repeat Example 4 if the shipping charge from plant...Ch. 6.3 - In Problems 1-8, find the transpose of each...Ch. 6.3 - In Problems 1-8, find the transpose of each...Ch. 6.3 - In Problems 1-8, find the transpose of each...Ch. 6.3 - In Problems 1-8, find the transpose of each...Ch. 6.3 - In Problems 1-8, find the transpose of each...Ch. 6.3 - In Problems 1-8, find the transpose of each...Ch. 6.3 - In Problems 1-8, find the transpose of each...Ch. 6.3 - In Problems 1-8, find the transpose of each...Ch. 6.3 - In Problems 9 and 10, (A) Form the dual problem....Ch. 6.3 - In Problems 9 and 10, (A) Form the dual problem....Ch. 6.3 - In Problems 11 and 12, a minimization problem, the...Ch. 6.3 - In Problems 11 and 12, a minimization problem, the...Ch. 6.3 - In Problems 13-20, (A) Form the dual problem. (B)...Ch. 6.3 - In Problems 13-20, (A) Form the dual problem. (B)...Ch. 6.3 - In Problems 13-20, (A) Form the dual problem. (B)...Ch. 6.3 - In Problems 13-20, (A) Form the dual problem. (B)...Ch. 6.3 - In Problems 13-20, (A) Form the dual problem. (B)...Ch. 6.3 - In Problems 13-20, (A) Form the dual problem. (B)...Ch. 6.3 - In Problems 13-20, (A) Form the dual problem. (B)...Ch. 6.3 - In Problems 13-20, (A) Form the dual problem. (B)...Ch. 6.3 - Solve the linear programming problems in Problem...Ch. 6.3 - Solve the linear programming problems in Problem...Ch. 6.3 - Solve the linear programming problems in Problem...Ch. 6.3 - Solve the linear programming problems in Problem...Ch. 6.3 - Solve the linear programming problems in Problem...Ch. 6.3 - Solve the linear programming problems in Problem...Ch. 6.3 - Solve the linear programming problems in Problem...Ch. 6.3 - Solve the linear programming problems in Problem...Ch. 6.3 - Solve the linear programming problems in Problem...Ch. 6.3 - Solve the linear programming problems in Problem...Ch. 6.3 - Solve the linear programming problems in Problem...Ch. 6.3 - Solve the linear programming problems in Problem...Ch. 6.3 - A minimization problem has 4 variables and 2...Ch. 6.3 - A minimization problem has 3 variables and 5...Ch. 6.3 - If you want to solve a minimization problem by...Ch. 6.3 - If you want to solve a minimization problem by...Ch. 6.3 - In Problems 37-40, determine whether a...Ch. 6.3 - In Problems 37-40, determine whether a...Ch. 6.3 - In Problems 37-40, determine whether a...Ch. 6.3 - In Problems 37-40, determine whether a...Ch. 6.3 - Solve the linear programming problem in Problems...Ch. 6.3 - Solve the linear programming problem in Problems...Ch. 6.3 - Solve the linear programming problem in Problems...Ch. 6.3 - Solve the linear programming problem in Problems...Ch. 6.3 - In Problems 49-58, construct a mathematical model...Ch. 6.3 - In Problems 49-58, construct a mathematical model...Ch. 6.3 - In Problems 49-58, construct a mathematical model...Ch. 6.3 - In Problems 49-58, construct a mathematical model...Ch. 6.3 - In Problems 49-58, construct a mathematical model...Ch. 6.3 - In Problems 49-58, construct a mathematical model...Ch. 6.3 - In Problems 49-58, construct a mathematical model...Ch. 6.3 - In Problems 49-58, construct a mathematical model...Ch. 6.3 - In Problems 49-58, construct a mathematical model...Ch. 6.3 - In Problems 49-58, construct a mathematical model...Ch. 6.4 - Repeat Example 1 for...Ch. 6.4 - Solve the following linear programming problem...Ch. 6.4 - Solve the following linear programming problem...Ch. 6.4 - Prob. 4MPCh. 6.4 - Suppose that the refinery in Example 5 has 35,000...Ch. 6.4 - In Problems 1-8, (A) Introduce slack, surplus, and...Ch. 6.4 - In Problems 1-8, (A) Introduce slack, surplus, and...Ch. 6.4 - In Problems 1-8, (A) Introduce slack, surplus, and...Ch. 6.4 - In Problems 1-8, (A) Introduce slack, surplus, and...Ch. 6.4 - In Problems 1-8, (A) Introduce slack, surplus, and...Ch. 6.4 - In Problems 1-8, (A) Introduce slack, surplus, and...Ch. 6.4 - In Problems 1-8, (A) Introduce slack, surplus, and...Ch. 6.4 - In Problems 1-8, (A) Introduce slack, surplus, and...Ch. 6.4 - Use the big M method to solve Problems 9-22....Ch. 6.4 - Use the big M method to solve Problems 9-22....Ch. 6.4 - Use the big M method to solve Problems 9-22....Ch. 6.4 - Use the big M method to solve Problems 9-22....Ch. 6.4 - Use the big M method to solve Problems 9-22....Ch. 6.4 - Use the big M method to solve Problems 9-22....Ch. 6.4 - Use the big M method to solve Problems 9-22....Ch. 6.4 - Use the big M method to solve Problems 9-22....Ch. 6.4 - Use the big M method to solve Problems 9-22....Ch. 6.4 - Use the big M method to solve Problems 9-22....Ch. 6.4 - Use the big M method to solve Problems 9-22....Ch. 6.4 - Use the big M method to solve Problems 9-22....Ch. 6.4 - Use the big M method to solve Problems 9-22....Ch. 6.4 - Use the big M method to solve Problems 9-22....Ch. 6.4 - Solve Problems 5 and 7 by graphing (the geometric...Ch. 6.4 - Solve Problems 6 and 8 by graphing (the geometric...Ch. 6.4 - Problems 25-32 are mixed. Some can be solved by...Ch. 6.4 - Problems 25-32 are mixed. Some can be solved by...Ch. 6.4 - Problems 25-32 are mixed. Some can be solved by...Ch. 6.4 - Problems 25-32 are mixed. Some can be solved by...Ch. 6.4 - Problems 25-32 are mixed. Some can be solved by...Ch. 6.4 - Problems 25-32 are mixed. Some can be solved by...Ch. 6.4 - Problems 25-32 are mixed. Some can be solved by...Ch. 6.4 - Problems 25-32 are mixed. Some can be solved by...Ch. 6.4 - In Problems 33-38, construct a mathematical model...Ch. 6.4 - In Problems 33-38, construct a mathematical model...Ch. 6.4 - In Problems 33-38, construct a mathematical model...Ch. 6.4 - In Problems 33-38, construct a mathematical model...Ch. 6.4 - In Problems 33-38, construct a mathematical model...Ch. 6.4 - In Problems 33-38, construct a mathematical model...Ch. 6.4 - In Problems 39-47, construct a mathematical model...Ch. 6.4 - In Problems 39-47, construct a mathematical model...Ch. 6.4 - In Problems 39-47, construct a mathematical model...Ch. 6.4 - In Problems 39-47, construct a mathematical model...Ch. 6.4 - In Problems 39-47, construct a mathematical model...Ch. 6.4 - In Problems 39-47, construct a mathematical model...Ch. 6.4 - In Problems 39-47, construct a mathematical model...Ch. 6.4 - In Problems 39-47, construct a mathematical model...Ch. 6.4 - In Problems 39-47, construct a mathematical model...Ch. 6 - Given the linear programming problem...Ch. 6 - How many basic variables and how many nonbasic...Ch. 6 - Find all basic solutions for the system in Problem...Ch. 6 - Write the simplex tableau for Problem 9, and...Ch. 6 - Solve Problem 9 using the simplex method.Ch. 6 - For the simplex tableau below, identify the basic...Ch. 6 - Find the basic solution for each tableau....Ch. 6 - Form the dual problem of...Ch. 6 - Write the initial system for the dual problem in...Ch. 6 - Write the first simplex tableau for the dual...Ch. 6 - Use the simplex method to find the optimal...Ch. 6 - Use the final simplex tableau from Problem 19 to...Ch. 6 - Solve the linear programming problem using the...Ch. 6 - Form the dual problem of the linear programming...Ch. 6 - Solve Problem 22 by applying the simplex method to...Ch. 6 - Solve the linear programming Problems 24 and...Ch. 6 - Solve the linear programming Problems 24 and...Ch. 6 - In problems 28 and 29, (A) Introduce slack,...Ch. 6 - In problems 28 and 29, (A) Introduce slack,...Ch. 6 - Find the modified problem for the following linear...Ch. 6 - Write a brief verbal description of the type of...Ch. 6 - Write a brief verbal description of the type of...Ch. 6 - Write a brief verbal description of the type of...Ch. 6 - Solve the following linear programming problem by...Ch. 6 - Solve by the dual problem method:...Ch. 6 - Solve Problem 35 by the big M method.Ch. 6 - Solve by the dual problem method:...Ch. 6 - In problems 38-41, construct a mathematical model...Ch. 6 - In problems 38-41, construct a mathematical model...Ch. 6 - In problems 38-41, construct a mathematical model...Ch. 6 - In problems 38-41, construct a mathematical model...
Additional Math Textbook Solutions
Find more solutions based on key concepts
Equations of tangent lines a. Find an equation of the line tangent to the following curves at the given value o...
Calculus: Early Transcendentals (2nd Edition)
Constructing and Graphing Discrete Probability Distributions In Exercises 19 and 20, (a) construct a probabilit...
Elementary Statistics: Picturing the World (7th Edition)
Fill in each blanks so that the resulting statement is true. Any set of ordered pairs is called a/an _______. T...
College Algebra (7th Edition)
Children of First Ladies This list represents the number of children for the first six “first ladies” of the Un...
Introductory Statistics
The equivalent expression of x(y+z) by using the commutative property.
Calculus for Business, Economics, Life Sciences, and Social Sciences (14th Edition)
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
- Question 3 over a field K. In this question, MË(K) denotes the set of n × n matrices (a) Suppose that A Є Mn(K) is an invertible matrix. Is it always true that A is equivalent to A-¹? Justify your answer. (b) Let B be given by 8 B = 0 7 7 0 -7 7 Working over the field F2 with 2 elements, compute the rank of B as an element of M2(F2). (c) Let 1 C -1 1 [4] [6] and consider C as an element of M3(Q). Determine the minimal polynomial mc(x) and hence, or otherwise, show that C can not be diagonalised. [7] (d) Show that C in (c) considered as an element of M3(R) can be diagonalised. Write down all the eigenvalues. Show your working. [8]arrow_forward16. Solve the given differential equation: y" + 4y sin (t)u(t 2π), - y(0) = 1, y'(0) = 0 Given, 1 (x² + 1)(x²+4) 1/3 -1/3 = + x²+1 x² +4 Send your answer in pen and paper don't r eputed ur self down Don't send the same previous answer that was Al generated Don't use any Al tool show ur answer in pe n and paper then takearrow_forwardR denotes the field of real numbers, Q denotes the field of rationals, and Fp denotes the field of p elements given by integers modulo p. You may refer to general results from lectures. Question 1 For each non-negative integer m, let R[x]m denote the vector space consisting of the polynomials in x with coefficients in R and of degree ≤ m. x²+2, V3 = 5. Prove that (V1, V2, V3) is a linearly independent (a) Let vi = x, V2 = list in R[x] 3. (b) Let V1, V2, V3 be as defined in (a). Find a vector v € R[×]3 such that (V1, V2, V3, V4) is a basis of R[x] 3. [8] [6] (c) Prove that the map ƒ from R[x] 2 to R[x]3 given by f(p(x)) = xp(x) — xp(0) is a linear map. [6] (d) Write down the matrix for the map ƒ defined in (c) with respect to the basis (2,2x + 1, x²) of R[x] 2 and the basis (1, x, x², x³) of R[x] 3. [5]arrow_forward
- Question 4 (a) The following matrices represent linear maps on R² with respect to an orthonormal basis: = [1/√5 2/√5 [2/√5 -1/√5] " [1/√5 2/√5] A = B = [2/√5 1/√5] 1 C = D = = = [ 1/3/5 2/35] 1/√5 2/√5 -2/√5 1/√5' For each of the matrices A, B, C, D, state whether it represents a self-adjoint linear map, an orthogonal linear map, both, or neither. (b) For the quadratic form q(x, y, z) = y² + 2xy +2yz over R, write down a linear change of variables to u, v, w such that q in these terms is in canonical form for Sylvester's Law of Inertia. [6] [4]arrow_forwardpart b pleasearrow_forwardQuestion 5 (a) Let a, b, c, d, e, ƒ Є K where K is a field. Suppose that the determinant of the matrix a cl |df equals 3 and the determinant of determinant of the matrix a+3b cl d+3e f ГЪ e [ c ] equals 2. Compute the [5] (b) Calculate the adjugate Adj (A) of the 2 × 2 matrix [1 2 A = over R. (c) Working over the field F3 with 3 elements, use row and column operations to put the matrix [6] 0123] A = 3210 into canonical form for equivalence and write down the canonical form. What is the rank of A as a matrix over F3? 4arrow_forward
- Question 2 In this question, V = Q4 and - U = {(x, y, z, w) EV | x+y2w+ z = 0}, W = {(x, y, z, w) € V | x − 2y + w − z = 0}, Z = {(x, y, z, w) € V | xyzw = 0}. (a) Determine which of U, W, Z are subspaces of V. Justify your answers. (b) Show that UW is a subspace of V and determine its dimension. (c) Is VU+W? Is V = UW? Justify your answers. [10] [7] '00'arrow_forwardGood explanation it sure experts solve itarrow_forwardBest explains it not need guidelines okkarrow_forward
- Task number: A1.1, A1.7 Topic: Celestial Navigation, Compass - Magnetic and Gyro Activ Determine compass error (magnetic and gyro) using azimuth choosing a suitable celestial body (Sun/ Stars/ Planets/ Moon). Apply variation to find the deviation of the magnetic compass. Minimum number of times that activity should be recorded: 6 (2 each phase) Sample calculation (Azimuth- Planets): On 06th May 2006 at 22h20m 10s UTC, a vessel in position 48°00'N 050°00'E observed Mars bearing 327° by compass. Find the compass error. If variation was 4.0° East, calculate the deviation. GHA Mars (06d 22h): Increment (20m 10s): 089° 55.7' 005° 02.5' v (0.9): (+) 00.3' GHA Mars: 094° 58.5' Longitude (E): (+) 050° 00.0' (plus- since longitude is easterly) LHA Mars: 144° 58.5' Declination (06d 22h): d (0.2): N 024° 18.6' (-) 00.1' Declination Mars: N 024° 18.5' P=144° 58.5' (If LHA<180°, P=LHA) A Tan Latitude/ Tan P A Tan 48° 00' Tan 144° 58.5' A = 1.584646985 N (A is named opposite to latitude, except when…arrow_forwardTask number: A1.1, A1.7 Topic: Celestial Navigation, Compass - Magnetic and Gyro Activ Determine compass error (magnetic and gyro) using azimuth choosing a suitable celestial body (Sun/ Stars/ Planets/ Moon). Apply variation to find the deviation of the magnetic compass. Minimum number of times that activity should be recorded: 6 (2 each phase) Sample calculation (Azimuth- Planets): On 06th May 2006 at 22h20m 10s UTC, a vessel in position 48°00'N 050°00'E observed Mars bearing 327° by compass. Find the compass error. If variation was 4.0° East, calculate the deviation. GHA Mars (06d 22h): Increment (20m 10s): 089° 55.7' 005° 02.5' v (0.9): (+) 00.3' GHA Mars: 094° 58.5' Longitude (E): (+) 050° 00.0' (plus- since longitude is easterly) LHA Mars: 144° 58.5' Declination (06d 22h): d (0.2): N 024° 18.6' (-) 00.1' Declination Mars: N 024° 18.5' P=144° 58.5' (If LHA<180°, P=LHA) A Tan Latitude/ Tan P A Tan 48° 00' Tan 144° 58.5' A = 1.584646985 N (A is named opposite to latitude, except when…arrow_forwardActiv Determine compass error using amplitude (Sun). Minimum number of times that activity should be performed: 3 (1 each phase) Sample calculation (Amplitude- Sun): On 07th May 2006 at Sunset, a vessel in position 10°00'N 010°00'W observed the Sun bearing 288° by compass. Find the compass error. LMT Sunset: LIT: (+) 00d 07d 18h 00h 13m 40m UTC Sunset: 07d 18h 53m (added- since longitude is westerly) Declination (07d 18h): N 016° 55.5' d (0.7): (+) 00.6' Declination Sun: N 016° 56.1' Sin Amplitude = Sin Declination/Cos Latitude = Sin 016°56.1'/ Cos 10°00' = 0.295780189 Amplitude=W17.2N (The prefix of amplitude is named easterly if body is rising, and westerly if body is setting. The suffix is named same as declination) True Bearing=287.2° Compass Bearing= 288.0° Compass Error = 0.8° Westarrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Algebra for College StudentsAlgebraISBN:9781285195780Author:Jerome E. Kaufmann, Karen L. SchwittersPublisher:Cengage Learning
College Algebra (MindTap Course List)AlgebraISBN:9781305652231Author:R. David Gustafson, Jeff HughesPublisher:Cengage Learning
Glencoe Algebra 1, Student Edition, 9780079039897...AlgebraISBN:9780079039897Author:CarterPublisher:McGraw Hill
Algebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:Cengage
Algebra: Structure And Method, Book 1AlgebraISBN:9780395977224Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. ColePublisher:McDougal Littell
Elementary Linear Algebra (MindTap Course List)AlgebraISBN:9781305658004Author:Ron LarsonPublisher:Cengage Learning
Algebra for College Students
Algebra
ISBN:9781285195780
Author:Jerome E. Kaufmann, Karen L. Schwitters
Publisher:Cengage Learning
College Algebra (MindTap Course List)
Algebra
ISBN:9781305652231
Author:R. David Gustafson, Jeff Hughes
Publisher:Cengage Learning
Glencoe Algebra 1, Student Edition, 9780079039897...
Algebra
ISBN:9780079039897
Author:Carter
Publisher:McGraw Hill
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:9781133382119
Author:Swokowski
Publisher:Cengage
Algebra: Structure And Method, Book 1
Algebra
ISBN:9780395977224
Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. Cole
Publisher:McDougal Littell
Elementary Linear Algebra (MindTap Course List)
Algebra
ISBN:9781305658004
Author:Ron Larson
Publisher:Cengage Learning
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
Optimization Problems in Calculus; Author: Professor Dave Explains;https://www.youtube.com/watch?v=q1U6AmIa_uQ;License: Standard YouTube License, CC-BY
Introduction to Optimization; Author: Math with Dr. Claire;https://www.youtube.com/watch?v=YLzgYm2tN8E;License: Standard YouTube License, CC-BY