Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 87 views

    Business Maths Project 1

    Uploaded by

    Devan Morogan
    1) The document contains examples of integrals and their solutions. It also contains examples of converting lines between slope-intercept form and standard form, and determining whether lines are parallel or perpendicular. 2) There are also examples of solving linear programming problems to maximize profit for a manufacturer given constraints on resources and demand. The optimal solution is found to be selling 24 cases of one product and 10 cases of another. 3) In all, the document provides mathematical examples and solutions for integrals, lines, and linear programming optimization problems.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Business Maths Project 1

    Uploaded by

    Devan Morogan
    87 views8 pages
    1) The document contains examples of integrals and their solutions. It also contains examples of converting lines between slope-intercept form and standard form, and determining whether lines are parallel or perpendicular. 2) There are also examples of solving linear programming problems to maximize profit for a manufacturer given constraints on resources and demand. The optimal solution is found to be selling 24 cases of one product and 10 cases of another. 3) In all, the document provides mathematical examples and solutions for integrals, lines, and linear programming optimization problems.

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    1) The document contains examples of integrals and their solutions. It also contains examples of converting lines between slope-intercept form and standard form, and determining whether lines are parallel or perpendicular. 2) There are also examples of solving linear programming problems to maximize profit for a manufacturer given constraints on resources and demand. The optimal solution is found to be selling 24 cases of one product and 10 cases of another. 3) In all, the document provides mathematical examples and solutions for integrals, lines, and linear programming optimization problems.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    87 views8 pages

    Business Maths Project 1

    Uploaded by

    Devan Morogan
    1) The document contains examples of integrals and their solutions. It also contains examples of converting lines between slope-intercept form and standard form, and determining whether lines are parallel or perpendicular. 2) There are also examples of solving linear programming problems to maximize profit for a manufacturer given constraints on resources and demand. The optimal solution is found to be selling 24 cases of one product and 10 cases of another. 3) In all, the document provides mathematical examples and solutions for integrals, lines, and linear programming optimization problems.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 8

    Question 1

    a ¿ ∫ 4 x+ 1 dx

    4 x 1+1
    = + x+ c
    1+1
    2
    4x
    = + x +c
    2
    2
    = 2 x + x +c

    b) ∫ ( x +4 )2 ⅆx

    = ∫ ( ϰ +4 )( x + 4 ) ⅆx

    2
    = ∫ x +4 x +.4 x +16 ⅆx
    2
    = ∫ x +8 x+16 ⅆx

    x2 +1 8 x1 +1
    = + +16 x +C
    2+ 1 1+ 1

    x3 8 x 2
    = + + 16 x +c
    3 2

    x3 2
    = +4 x +16 x +C
    3

    2 x +5 x 2
    c) ∫ ⅆx
    x

    2
    2x 5ϰ
    = ∫ + dx
    x x

    = ∫ 2+5 xⅆx
    1+1
    5x
    = 2 x+ +C
    1+1
    2
    5x
    = 2 x+ +C
    2

    5 x2
    = + 2 x +C
    2

    d) ∫
    ( √3x −√ x ) ⅆx 3

    =
    −1 3 ( 12 )
    ∫ 3 x 2 −x
    −1 3
    = 2
    ∫ 3 x −x ⅆx 2

    −1 3
    +1 +1
    3x 2 x2
    = + +C
    −1 3
    +1 +1
    2 2

    1 5
    3x2 x2
    = + +C
    1 5
    2 2

    5
    1
    = 2 x2
    2
    6x + +c
    5
    Question 2

    Convert into y=mx+c

    y=−x+1

    y=x + 4

    m1=−1 @ m 2=1

    Hence, the lines are perpendicular to each other.

    Convert into y=mx+c

    −2 y=x +4 6 y=3 x−1

    3x 1
    2 y=x−4 y= −
    6 6

    x x 1
    y= −2 y= −
    2 2 6

    1 1
    m 1= @ m 2=
    2 2

    Hence, the lines are parallel to each other.


    Convert into y=mx+c

    3 y=9 x +1 x +3 y=4

    9x 1
    y= + 3 y=−x + 4
    3 3

    1 −x 4
    y=3 x + y= +
    3 3 3

    −1
    m 1=3 @ m 2=
    3

    Hence, the lines are perpendicular to each other.

    Convert into y=mx+c

    4 y=8 x +1 2 y=3−4 x

    8x 1 −4 x 3
    y= + y= +
    4 4 2 2

    1 3
    y=2 x + y=−2 x +
    4 2

    m1=2 @ m2=−2

    None.
    Question 3

    ¿ cost=$ 7000

    Variable cost =$ 1.50+ $ 5

    Sales=$ 8.20

    Let x be the product

    8.20 x−( 1.50+5 ) x−7000 ¿ 0

    8.20 x−6.50 x >7000

    1.7 x >7000

    7000
    x>
    1.7

    x >411.65

    x=4118units
    ¿ cost=$ 6500

    Variable cost =1.3 N + 0.4 N

    Sales=$ 3.50

    3.50 N−( 1.3 N +0.4 N + 6500 )> 0

    3.50 N−1.3 N−0.4 N−6500> 0

    1.8 N−6500> 0

    1.8 N >6500

    N >3611.11

    N=3612units

    Baby Wiggles , Profit=$ 170 each case ; 10units of raw material∧1unit of time
    Sleepy baby , Profit=$ 140 each case ; 6 units of raw material∧2 unit of time

    Given day=300 units of raw material∧44 units of time

    Let x=Number of case of Baby Wiggles

    Let y =Number of case of Sleepy Baby

    Constraints :

    i ¿10 x +6 y ≤300

    ii ¿ x+ 2 y ≤ 44
    iii ¿ x ≥0

    iv ¿ y ≥0

    Point C :

    5
    Equation 1 : y=50− x
    3

    1
    Equation 2 : y=22− x
    2

    Equation 1=Equation2

    5 1
    50− x=22− x
    3 2

    −5 1
    x + x=22−50
    3 2

    −7
    x=−28
    6

    x=24

    When x=24 ,

    1
    y=22− ( 24 )
    2
    y=10

    Point C=( 24,10 )

    Objective Function ( profit) : P=170 x +140 y

    POINTS PROFIT ( P=170 x +140 y ¿

    A 170 ( 0 ) +140 ( 0 )=0

    B 170 ( 0 ) +140 ( 22 )=3080

    C 170 ( 24 ) +140 ( 10 )=5480

    D 170 ( 30 ) +140 ( 0 )=5100

    Conclusion: P is the largest at corner point C. Manufacturer can maximize profit around
    $5480, by selling 24 cases of Baby Wiggles (x) and 10 cases of Sleepy Baby
    (y).

    You might also like