If there are two points where an objective function is optimized, what can be said about the linear programming problem? A.
The feasible region has only two vertices.
B.
Two of the constraints are parallel to each other.
C.
The feasible region contains the origin (0, 0).
D.
The objective function is parallel to one of the constraints.

PLEASE HELP.

solution:

we have to construct

∠m nt ≅ ∠p qr

the steps to draw this construction are

step 1: use a compass to draw an arc from point q which intersects the side pq at point a and the side qr at point b.

step 2: draw a segment nt and use the same width of the compass to draw an arc from point n which intersects the segment nt at a point x.

step 3:

step 4: join points n and y using a straightedge.

step 3:

option (d).maintaining the same width of the compass as ab, draw an arc from point x such that it intersects the arc drawn from n in a point y.

to draw   congruent angles , 1. width of compasses while drawing two angles should be same i.e from point at which angle has to be drawn, 2.the distance between the two points where the compass intersects the two sides should be same while drawing any two congruent angles.

answer: ay  

fonsi  

dy  

oh

oh no, oh no

oh yeah

diridiri, dirididi daddy  

go

sí, sabes que ya llevo un rato mirándote  

tengo que bailar contigo hoy (dy)  

vi que tu mirada ya estaba llamándome  

muéstrame el camino que yo voy (oh)

tú, tú eres el imán y yo soy el metal  

me voy acercando y voy armando el plan  

solo con pensarlo se acelera el pulso (oh yeah)

ya, ya me está gustando más de lo normal  

todos mis sentidos van pidiendo más  

esto hay que tomarlo sin ningún apuro

despacito  

quiero respirar tu cuello despacito  

deja que te diga cosas al oído  

para que te acuerdes si no estás conmigo

despacito  

quiero desnudarte a besos despacito  

firmo en las paredes de tu laberinto  

y hacer de tu cuerpo todo un manuscrito (sube, sube, sube)

(sube, sube)

your answer   is c

step-by-step explanation: