Algebra 2 2.11 system of Linear inequalities

Constraints;

T + F ≤ 2000

4t ≥ F

T ≥ 0

F ≥ 0

Step-by-step explanation:

T- Technology stock

F - food stocks

T + F ≤ 2000

4t ≥ F

T ≥ 0

F ≥ 0

Now one has to use linear programming to solve this problem.

the value of v.w= -12.

step-by-step explanation:

we are given three vector r,v and w as:

r = < 5, -5, -2> ; v = < 2, -8, -8> ; w = < -2, 6, -5>

we know that r,v and w could also be represented as:

r=5i-5j-2k

v=2i-8j-8k

and w= -2i+6j-5k

where i,j and k are the unit vectors of x,y and z-axis respectively.

also we know that it has the following property:

i.i=1 ; j.j=1; k.k=1

and i.=j.i=i.k=k.i=j.k=k.j=0

i.e. when we multiply two vectors or we find it's dot product we need to only multiply the components of x coordinates with each other; y with each other and z with each other.

hence, v.w= (2i-8j- -2i+6j-5k)

                  = 2×(-2)+(-8)×(6)+(-8)×(-5)

                  = -4-48+40

                  = -12

hence, v.w= -12

aloha~! my name is zalgo and i am here to you out on this amazing day. to answer your question, yes, nonzero numbers can have a greatest common factor and that would be 1. still don't get it? let me considering every number is divisible by 1 and hence every number has 1 as a factor of theirs. so, if 2 nonzero numbers didn't share any gcf (greatest common factor), they would still have a factor in common and that would be 1.

i hope that this ! : p

"stay and stay proud! " - zalgo

(by the way, do you mind marking me as brainliest? i'd greatly appreciate it! mahalo! x3)