Pls Help ! 12/4 − 1 3/4 A) 1 /4 B) 1/ 2 C) 1 1/ 4 D) 2 1/ 4
2 answers:
You might be interested in
1. Line l; point P not on l.( Take a line I and mark point P outside it or on the line.So from point P there are infinite number of lines out of which only one line is parallel to line I. Suppose you are taking point P on line I, from that point P also infinite number of lines can be drawn but only one line will be coincident or parallel to line I.
2. Plane R is parallel to plane S; Plane T cuts planes R and S.(Imagine you are sitting inside a room ,consider two walls opposite to each other as two planes R and S and floor on which you are sitting as third plane T ,so R and S are parallel and plane T is cutting them so in this case their lines of intersect .But this is not possible in each and every case, suppose R and S planes are parallel to each other and Plane T cuts them like two faces of a building and third plane T is stairs or suppose it is in slanting position i.e not parallel to R and S so in this case also lines of intersection will be parallel.
3. △ABC with midpoints M and N.( As you know if we take a triangle ABC ,the mid points of sides AB and AC being M and N, so the line joining the mid point of two sides of a triangle is parallel to third side and is half of it.
4.Point B is between points A and C.( Take a line segment AC. Mark any point B anywhere on the line segment AC. Three possibilities arises
(i) AB > BC (ii) AB < BC (iii) AB = BC
Since A, B,C are collinear .So in each case
Answer:
(3, 0).
Step-by-step explanation:
dentifying the vertices of the feasible region. Graphing is often a good way to do it, or you can solve the equations pairwise to identify the x- and y-values that are at the limits of the region.
In the attached graph, the solution spaces of the last two constraints are shown in red and blue, and their overlap is shown in purple. Hence the vertices of the feasible region are the vertices of the purple area: (0, 0), (0, 1), (1.5, 1.5), and (3, 0).
The signs of the variables in the contraint function (+ for x, - for y) tell you that to maximize C, you want to make y as small as possible, while making x as large as possible at the same time.
Hence, The Answer is ( 3, 0)
