Consider the vectors: a 1 </msub> = ( <mtable rowspacing="4pt"

Ryan Robertson 2022-07-07 Answered
Consider the vectors:
a 1 = ( 0 1 1 0 ) , a 2 = ( 0 0 1 1 ) , a 3 = ( 2 0 0 1 )
Find a single vector p which maximizes p a i for i = 1 , 2 , 3.

To put this in context this is an economics profit max problem where p is a price and each component of the above vectors represents the quantity of the good.

I honestly have no idea how to find this p vector. It doesn't even seem possible to me that a single vector can maximize these three vectors.
You can still ask an expert for help

Expert Community at Your Service

  • Live experts 24/7
  • Questions are typically answered in as fast as 30 minutes
  • Personalized clear answers
Learn more

Solve your problem for the price of one coffee

  • Available 24/7
  • Math expert for every subject
  • Pay only if we can solve it
Ask Question

Answers (1)

eurgylchnj
Answered 2022-07-08 Author has 14 answers
I think your question is incomplete. First you should determine your goal function, e.g., you can choose the sum of all profits to maximize, max: p a 1 + p a 2 + p a 3 . Also you should determine your boundaries. E.g., total number of goods d 1 , d 2 , d 3 , d 3 .
Did you like this example?
Subscribe for all access

Expert Community at Your Service

  • Live experts 24/7
  • Questions are typically answered in as fast as 30 minutes
  • Personalized clear answers
Learn more

You might be interested in

asked 2022-05-07
"A common theme in linear compression and feature extraction is to map a high dimensional vector x to a lower dimensional vector y = W x such that the information in the vector x is maximally preserved in y. Opten PCA is applied for this purpose. However, the optimal setting for W is in generall not given by the widely used PCA. Actually, PCA is sub-optimal special case of mutual information maximisation."

Can anyone elaborate why PCA is a sub-optimal special case of mutual information maximisation ?
asked 2022-05-26
The primal assignment problem that I have is:
max i = i N j = 1 N c i j x i j subject to i = 1 N x i j = 1 ,     j = 1 , , N j = 1 N x i j = 1 ,     i = 1 , , N x i , j   { 0 , 1 }
and I would like to obtain its dual, which should be
min p j { i = 1 N p j + i = 1 N max { a i j p j } }
Can you give me any hints on how to approach this derivation? I have tried with Lagrange multipliers but I have not been able to reach this expression.
asked 2022-05-03
I have encountered that in some cases maximization of a function had been substituted with a maximization of its monotone transformation.

For example, finding the min or max of f ( x , y ) = ( ( x 1 ) 2 + ( y 2 ) 2 ) 1 / 2 is the same as finding the min / max of ( x 2 + y 2 ) and then take the square root of the answer. So, my questions are:
1) Is it true for any monotone transformation g?
2) Is the same principle allow us to maximize /minimize log g ( x ) instead of g ( x ) itself?
asked 2022-05-08
Given a right circular cone with the line of symmetry along x = 0, and the base along y = 0, how can I find the maximum volume paraboloid (parabola revolved around the y-axis) inscribed within the cone? Maximising the volume of the paraboloid relative to the volume of the right circular cone. In 2-D, the parabola has 2 points of tangency to the triangle, one of each side of the line of symmetry. I have tried using the disk method to find the volume of the cone, and the parabola, both with arbitrary equations such as y = b a x, and y = c d x 2 , but I end up with a massive equation for several variables, instead of a simple percentage answer. Any help is appreciated! Thanks in advance.
asked 2022-05-03
I have non-negative function g ( y , x ) that is define using non-negative f ( y , x ) in the following way:
g ( y , x ) = 0 x f ( t , y ) d t
I am trying to maximize max y S g ( y , x ). Using Fatou's lemma we have that
max y S g ( y , x ) = 0 x f ( t , y ) d t 0 x max y S f ( t , y ) d t
I also have that max y S f ( t , y ) h ( t ) where 0 x h ( t ) <

My question when does the last inequality hold with equally?

What do I have to assume about f ( y , x ) and g ( x , y ) for equality to hold?

Can I apply dominated convergence theorem here?
asked 2022-05-08
Let be t R , n = 1 , 2 , , p [ 0 , 1 ] and a ( p , 1 ].

Show that
sup t ( t a log ( p e t + ( 1 p ) ) = a log ( a p ) + ( 1 a ) log ( 1 a 1 p )
So, I've try to derivate, but I did'nt get sucess, since my result is different. I've get log ( a ( 1 p ) p ( 1 a ) ) . Any ideas?
asked 2022-05-08
I want to solve the following optimization problem
maximize  f ( X ) = log d e t ( X + Y ) a T ( X + Y ) 1 a subject to  X W ,
where the design variable X is symmetric positive semidefinite, W , Y are fixed symmetric positive semidefinite matrices, and a is a given vector. The inequality X W means that X W is symmetric positive semidefinite.

I was wondering if there's hope to find an analytical solution to either the constrained or unconstrained problem. And if there is none, could I use convex optimization techniques to solve this numerically?