Generalization to a continuumMonotonicity of $ell_p$ normExists solution for this optimization problem?Maximizing sum of sign functionsProving that $int_mathbbR f dmu = frac1Nsum_i=1^N f(lambda_i)$Utility maximization of n goodsIs there only one set of KKT conditions for a given optimization problem?How to solve this quadratic optimization problem using Lagrange multipliers?Aggregating Using IntegralsHow to convert constrainted optimization problem to an unconstrained one?Standard name for the computation of Lagrange multipliers iteratively by fixing other multipliers?

Is this toilet slogan correct usage of the English language?

How do I color the graph in datavisualization?

Multiplicative persistence

What does routing an IP address mean?

How to explain what's wrong with this application of the chain rule?

Does an advisor owe his/her student anything? Will an advisor keep a PhD student only out of pity?

The screen of my macbook suddenly broken down how can I do to recover

Start making guitar arrangements

On a tidally locked planet, would time be quantized?

Loading commands from file

What is the evidence for the "tyranny of the majority problem" in a direct democracy context?

Fear of getting stuck on one programming language / technology that is not used in my country

Why did the Mercure fail?

Aragorn's "guise" in the Orthanc Stone

Must Legal Documents Be Siged In Standard Pen Colors?

Why should universal income be universal?

Freedom of speech and where it applies

What is Cash Advance APR?

What was the exact wording from Ivanhoe of this advice on how to free yourself from slavery?

Problem with TransformedDistribution

How to implement a feedback to keep the DC gain at zero for this conceptual passive filter?

Pre-mixing cryogenic fuels and using only one fuel tank

Did arcade monitors have same pixel aspect ratio as TV sets?

Is there a name for this algorithm to calculate the concentration of a mixture of two solutions containing the same solute?



Generalization to a continuum


Monotonicity of $ell_p$ normExists solution for this optimization problem?Maximizing sum of sign functionsProving that $int_mathbbR f dmu = frac1Nsum_i=1^N f(lambda_i)$Utility maximization of n goodsIs there only one set of KKT conditions for a given optimization problem?How to solve this quadratic optimization problem using Lagrange multipliers?Aggregating Using IntegralsHow to convert constrainted optimization problem to an unconstrained one?Standard name for the computation of Lagrange multipliers iteratively by fixing other multipliers?













1












$begingroup$


Preamble, set-up:
In economics, a well known optimization problem writes as follows:
$$
max_x_j=1^n,yU(x_1,y)+sum_i=2^nlambda_icdot U(x_i,y)+mucdot(y-sum_j=1^n(w_j-x_j))
$$



where $lambda_i$ and $mu$ are (binding) lagrangian multipliers
such that $mu>0$, and $lambda_i>0$ for all $i$, and $U$ is a differentiable and concave function.



An easy way to solve this problem taking first order conditions:
$$
x_j:lambda_jcdotfracpartial U(x_j,y)partial x_j+mu=0, quad textfor $j=1,dots,n$, and $lambda_1=1$
$$

$$
y:sum_j=1^nlambda_jcdotfracpartial U(x_j,y)partial y+mu=0, quad textfor $j=1,dots,n$, and $lambda_1=1$
$$



Notice that provided $mu>0$ we can divide the last equation by $mu$ and the use the $n$ firs order conditions for $x_j$ in order to get a compact necessary condition:



$$
sum_j=1^nfracpartial U(x_j,y)/partial ypartial U(x_j,y)/partial x_j=1
$$



My interest:
I would like to expand this result to a setting were there is an infinite number of consumers. Lets say that consumers are indexed by $jin[0,1]$ according to an atomless CDF $F(j)$. Essentialy, I would like to retrieve an equivalent necesary optimality condition like:



$$
int_0^1fracpartial U(x_j,y)/partial ypartial U(x_j,y)/partial x_jdF(j)=1
$$



The optimization problem would look like:



$$
max_x_jin[0,1],yint_0^1lambda_jcdot U(x_j,y)dF(j)+mucdotleft(y-int_0^1(w_j-x_j)dF(j)right)
$$



However if I want to retrieve the desired expression it seems like I need that:



$$
fracint_0^1(w_i-x_i)dF(i)dx_i=-1
$$



and I do not know under which conditions I can get this. Any suggestions? Thanks!










share|cite|improve this question









$endgroup$
















    1












    $begingroup$


    Preamble, set-up:
    In economics, a well known optimization problem writes as follows:
    $$
    max_x_j=1^n,yU(x_1,y)+sum_i=2^nlambda_icdot U(x_i,y)+mucdot(y-sum_j=1^n(w_j-x_j))
    $$



    where $lambda_i$ and $mu$ are (binding) lagrangian multipliers
    such that $mu>0$, and $lambda_i>0$ for all $i$, and $U$ is a differentiable and concave function.



    An easy way to solve this problem taking first order conditions:
    $$
    x_j:lambda_jcdotfracpartial U(x_j,y)partial x_j+mu=0, quad textfor $j=1,dots,n$, and $lambda_1=1$
    $$

    $$
    y:sum_j=1^nlambda_jcdotfracpartial U(x_j,y)partial y+mu=0, quad textfor $j=1,dots,n$, and $lambda_1=1$
    $$



    Notice that provided $mu>0$ we can divide the last equation by $mu$ and the use the $n$ firs order conditions for $x_j$ in order to get a compact necessary condition:



    $$
    sum_j=1^nfracpartial U(x_j,y)/partial ypartial U(x_j,y)/partial x_j=1
    $$



    My interest:
    I would like to expand this result to a setting were there is an infinite number of consumers. Lets say that consumers are indexed by $jin[0,1]$ according to an atomless CDF $F(j)$. Essentialy, I would like to retrieve an equivalent necesary optimality condition like:



    $$
    int_0^1fracpartial U(x_j,y)/partial ypartial U(x_j,y)/partial x_jdF(j)=1
    $$



    The optimization problem would look like:



    $$
    max_x_jin[0,1],yint_0^1lambda_jcdot U(x_j,y)dF(j)+mucdotleft(y-int_0^1(w_j-x_j)dF(j)right)
    $$



    However if I want to retrieve the desired expression it seems like I need that:



    $$
    fracint_0^1(w_i-x_i)dF(i)dx_i=-1
    $$



    and I do not know under which conditions I can get this. Any suggestions? Thanks!










    share|cite|improve this question









    $endgroup$














      1












      1








      1





      $begingroup$


      Preamble, set-up:
      In economics, a well known optimization problem writes as follows:
      $$
      max_x_j=1^n,yU(x_1,y)+sum_i=2^nlambda_icdot U(x_i,y)+mucdot(y-sum_j=1^n(w_j-x_j))
      $$



      where $lambda_i$ and $mu$ are (binding) lagrangian multipliers
      such that $mu>0$, and $lambda_i>0$ for all $i$, and $U$ is a differentiable and concave function.



      An easy way to solve this problem taking first order conditions:
      $$
      x_j:lambda_jcdotfracpartial U(x_j,y)partial x_j+mu=0, quad textfor $j=1,dots,n$, and $lambda_1=1$
      $$

      $$
      y:sum_j=1^nlambda_jcdotfracpartial U(x_j,y)partial y+mu=0, quad textfor $j=1,dots,n$, and $lambda_1=1$
      $$



      Notice that provided $mu>0$ we can divide the last equation by $mu$ and the use the $n$ firs order conditions for $x_j$ in order to get a compact necessary condition:



      $$
      sum_j=1^nfracpartial U(x_j,y)/partial ypartial U(x_j,y)/partial x_j=1
      $$



      My interest:
      I would like to expand this result to a setting were there is an infinite number of consumers. Lets say that consumers are indexed by $jin[0,1]$ according to an atomless CDF $F(j)$. Essentialy, I would like to retrieve an equivalent necesary optimality condition like:



      $$
      int_0^1fracpartial U(x_j,y)/partial ypartial U(x_j,y)/partial x_jdF(j)=1
      $$



      The optimization problem would look like:



      $$
      max_x_jin[0,1],yint_0^1lambda_jcdot U(x_j,y)dF(j)+mucdotleft(y-int_0^1(w_j-x_j)dF(j)right)
      $$



      However if I want to retrieve the desired expression it seems like I need that:



      $$
      fracint_0^1(w_i-x_i)dF(i)dx_i=-1
      $$



      and I do not know under which conditions I can get this. Any suggestions? Thanks!










      share|cite|improve this question









      $endgroup$




      Preamble, set-up:
      In economics, a well known optimization problem writes as follows:
      $$
      max_x_j=1^n,yU(x_1,y)+sum_i=2^nlambda_icdot U(x_i,y)+mucdot(y-sum_j=1^n(w_j-x_j))
      $$



      where $lambda_i$ and $mu$ are (binding) lagrangian multipliers
      such that $mu>0$, and $lambda_i>0$ for all $i$, and $U$ is a differentiable and concave function.



      An easy way to solve this problem taking first order conditions:
      $$
      x_j:lambda_jcdotfracpartial U(x_j,y)partial x_j+mu=0, quad textfor $j=1,dots,n$, and $lambda_1=1$
      $$

      $$
      y:sum_j=1^nlambda_jcdotfracpartial U(x_j,y)partial y+mu=0, quad textfor $j=1,dots,n$, and $lambda_1=1$
      $$



      Notice that provided $mu>0$ we can divide the last equation by $mu$ and the use the $n$ firs order conditions for $x_j$ in order to get a compact necessary condition:



      $$
      sum_j=1^nfracpartial U(x_j,y)/partial ypartial U(x_j,y)/partial x_j=1
      $$



      My interest:
      I would like to expand this result to a setting were there is an infinite number of consumers. Lets say that consumers are indexed by $jin[0,1]$ according to an atomless CDF $F(j)$. Essentialy, I would like to retrieve an equivalent necesary optimality condition like:



      $$
      int_0^1fracpartial U(x_j,y)/partial ypartial U(x_j,y)/partial x_jdF(j)=1
      $$



      The optimization problem would look like:



      $$
      max_x_jin[0,1],yint_0^1lambda_jcdot U(x_j,y)dF(j)+mucdotleft(y-int_0^1(w_j-x_j)dF(j)right)
      $$



      However if I want to retrieve the desired expression it seems like I need that:



      $$
      fracint_0^1(w_i-x_i)dF(i)dx_i=-1
      $$



      and I do not know under which conditions I can get this. Any suggestions? Thanks!







      measure-theory optimization economics continuum-theory






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Mar 15 at 17:02









      Weierstraß RamirezWeierstraß Ramirez

      146420




      146420




















          0






          active

          oldest

          votes











          Your Answer





          StackExchange.ifUsing("editor", function ()
          return StackExchange.using("mathjaxEditing", function ()
          StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
          StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
          );
          );
          , "mathjax-editing");

          StackExchange.ready(function()
          var channelOptions =
          tags: "".split(" "),
          id: "69"
          ;
          initTagRenderer("".split(" "), "".split(" "), channelOptions);

          StackExchange.using("externalEditor", function()
          // Have to fire editor after snippets, if snippets enabled
          if (StackExchange.settings.snippets.snippetsEnabled)
          StackExchange.using("snippets", function()
          createEditor();
          );

          else
          createEditor();

          );

          function createEditor()
          StackExchange.prepareEditor(
          heartbeatType: 'answer',
          autoActivateHeartbeat: false,
          convertImagesToLinks: true,
          noModals: true,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: 10,
          bindNavPrevention: true,
          postfix: "",
          imageUploader:
          brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
          contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
          allowUrls: true
          ,
          noCode: true, onDemand: true,
          discardSelector: ".discard-answer"
          ,immediatelyShowMarkdownHelp:true
          );



          );













          draft saved

          draft discarded


















          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3149546%2fgeneralization-to-a-continuum%23new-answer', 'question_page');

          );

          Post as a guest















          Required, but never shown

























          0






          active

          oldest

          votes








          0






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes















          draft saved

          draft discarded
















































          Thanks for contributing an answer to Mathematics Stack Exchange!


          • Please be sure to answer the question. Provide details and share your research!

          But avoid


          • Asking for help, clarification, or responding to other answers.

          • Making statements based on opinion; back them up with references or personal experience.

          Use MathJax to format equations. MathJax reference.


          To learn more, see our tips on writing great answers.




          draft saved


          draft discarded














          StackExchange.ready(
          function ()
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3149546%2fgeneralization-to-a-continuum%23new-answer', 'question_page');

          );

          Post as a guest















          Required, but never shown





















































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown

































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown







          Popular posts from this blog

          Lowndes Grove History Architecture References Navigation menu32°48′6″N 79°57′58″W / 32.80167°N 79.96611°W / 32.80167; -79.9661132°48′6″N 79°57′58″W / 32.80167°N 79.96611°W / 32.80167; -79.9661178002500"National Register Information System"Historic houses of South Carolina"Lowndes Grove""+32° 48' 6.00", −79° 57' 58.00""Lowndes Grove, Charleston County (260 St. Margaret St., Charleston)""Lowndes Grove"The Charleston ExpositionIt Happened in South Carolina"Lowndes Grove (House), Saint Margaret Street & Sixth Avenue, Charleston, Charleston County, SC(Photographs)"Plantations of the Carolina Low Countrye

          random experiment with two different functions on unit interval Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)Random variable and probability space notionsRandom Walk with EdgesFinding functions where the increase over a random interval is Poisson distributedNumber of days until dayCan an observed event in fact be of zero probability?Unit random processmodels of coins and uniform distributionHow to get the number of successes given $n$ trials , probability $P$ and a random variable $X$Absorbing Markov chain in a computer. Is “almost every” turned into always convergence in computer executions?Stopped random walk is not uniformly integrable

          How should I support this large drywall patch? Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?How do I cover large gaps in drywall?How do I keep drywall around a patch from crumbling?Can I glue a second layer of drywall?How to patch long strip on drywall?Large drywall patch: how to avoid bulging seams?Drywall Mesh Patch vs. Bulge? To remove or not to remove?How to fix this drywall job?Prep drywall before backsplashWhat's the best way to fix this horrible drywall patch job?Drywall patching using 3M Patch Plus Primer