Changes in Primal and Dual Solutions When Scaled











up vote
1
down vote

favorite












Suppose that we have an LP in the standard form
$$text{(P) min }c^Tx: Ax=b, xle 0$$

and it's dual would be
$$text{(D) max }b^Tx: Axle c$$

Let $overline{x}$ and $overline{y}$ be the optimal solutions to (P) and (D) respectively.


How do these solutions change if we multiply the constraint $Ax=b$ by a scalar? I think we'd have the following
$$text{(P$alpha$) min }c^Tx: alpha Ax=b, xle 0$$

and it's dual would be
$$text{(D$alpha$) max }b^Tx: alpha Axle c$$

Where $alpha in mathbb{R}-{0}$


My initial thoughts are that

1. The optimal value's of (P), (D), (P$alpha$), and (D$alpha$) won't change since the feasible region wont' change.

2. The optimal solutions will just be $overline{x}/alpha$ and $overline{y}/alpha$ for (P$alpha$) and (D$alpha$) respectively.



Yet, this seems wrong.

I'm rather new to Linear Programming and duality and would love an explanation of why my intuition is/isn't correct.










share|cite|improve this question


























    up vote
    1
    down vote

    favorite












    Suppose that we have an LP in the standard form
    $$text{(P) min }c^Tx: Ax=b, xle 0$$

    and it's dual would be
    $$text{(D) max }b^Tx: Axle c$$

    Let $overline{x}$ and $overline{y}$ be the optimal solutions to (P) and (D) respectively.


    How do these solutions change if we multiply the constraint $Ax=b$ by a scalar? I think we'd have the following
    $$text{(P$alpha$) min }c^Tx: alpha Ax=b, xle 0$$

    and it's dual would be
    $$text{(D$alpha$) max }b^Tx: alpha Axle c$$

    Where $alpha in mathbb{R}-{0}$


    My initial thoughts are that

    1. The optimal value's of (P), (D), (P$alpha$), and (D$alpha$) won't change since the feasible region wont' change.

    2. The optimal solutions will just be $overline{x}/alpha$ and $overline{y}/alpha$ for (P$alpha$) and (D$alpha$) respectively.



    Yet, this seems wrong.

    I'm rather new to Linear Programming and duality and would love an explanation of why my intuition is/isn't correct.










    share|cite|improve this question
























      up vote
      1
      down vote

      favorite









      up vote
      1
      down vote

      favorite











      Suppose that we have an LP in the standard form
      $$text{(P) min }c^Tx: Ax=b, xle 0$$

      and it's dual would be
      $$text{(D) max }b^Tx: Axle c$$

      Let $overline{x}$ and $overline{y}$ be the optimal solutions to (P) and (D) respectively.


      How do these solutions change if we multiply the constraint $Ax=b$ by a scalar? I think we'd have the following
      $$text{(P$alpha$) min }c^Tx: alpha Ax=b, xle 0$$

      and it's dual would be
      $$text{(D$alpha$) max }b^Tx: alpha Axle c$$

      Where $alpha in mathbb{R}-{0}$


      My initial thoughts are that

      1. The optimal value's of (P), (D), (P$alpha$), and (D$alpha$) won't change since the feasible region wont' change.

      2. The optimal solutions will just be $overline{x}/alpha$ and $overline{y}/alpha$ for (P$alpha$) and (D$alpha$) respectively.



      Yet, this seems wrong.

      I'm rather new to Linear Programming and duality and would love an explanation of why my intuition is/isn't correct.










      share|cite|improve this question













      Suppose that we have an LP in the standard form
      $$text{(P) min }c^Tx: Ax=b, xle 0$$

      and it's dual would be
      $$text{(D) max }b^Tx: Axle c$$

      Let $overline{x}$ and $overline{y}$ be the optimal solutions to (P) and (D) respectively.


      How do these solutions change if we multiply the constraint $Ax=b$ by a scalar? I think we'd have the following
      $$text{(P$alpha$) min }c^Tx: alpha Ax=b, xle 0$$

      and it's dual would be
      $$text{(D$alpha$) max }b^Tx: alpha Axle c$$

      Where $alpha in mathbb{R}-{0}$


      My initial thoughts are that

      1. The optimal value's of (P), (D), (P$alpha$), and (D$alpha$) won't change since the feasible region wont' change.

      2. The optimal solutions will just be $overline{x}/alpha$ and $overline{y}/alpha$ for (P$alpha$) and (D$alpha$) respectively.



      Yet, this seems wrong.

      I'm rather new to Linear Programming and duality and would love an explanation of why my intuition is/isn't correct.







      linear-programming






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Nov 26 at 12:45









      CandyKing312312

      63




      63






















          1 Answer
          1






          active

          oldest

          votes

















          up vote
          2
          down vote













          We would have



          $$text{(P$alpha$) min }c^Tx: alpha Ax=color{blue}alpha b, xle 0$$

          and it's dual would be
          $$text{(D$alpha$) max }color{blue}{alpha}b^Tx: alpha Axle c$$

          Where $alpha in mathbb{R}setminus {0}$



          The primal solution would remain the same since the feasible set remains the same. The corresponding dual solution would be $frac1{alpha}bar{y}$.






          share|cite|improve this answer























          • For (P$alpha$) why would you multiply b by $alpha$? Wouldn't that make $alpha Ax=alpha b$ equivalent to $Ax=b$?
            – CandyKing312312
            Nov 26 at 12:59












          • That is what the question meant right? Multiplying the constraint $Ax=b$ by a scalar. not just multiplying each row of $A$ by $alpha$. Yes, they are equivalent.
            – Siong Thye Goh
            Nov 26 at 13:05












          • My mistake, I meant $overline{A}_i=alpha*A_i$. Where $overline{A}$ represents the modified primal constraint
            – CandyKing312312
            Nov 26 at 13:07








          • 1




            you probably mean $alpha in mathbb{R}setminus{0}$
            – LinAlg
            Nov 26 at 17:00













          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',
          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%2f3014278%2fchanges-in-primal-and-dual-solutions-when-scaled%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown

























          1 Answer
          1






          active

          oldest

          votes








          1 Answer
          1






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes








          up vote
          2
          down vote













          We would have



          $$text{(P$alpha$) min }c^Tx: alpha Ax=color{blue}alpha b, xle 0$$

          and it's dual would be
          $$text{(D$alpha$) max }color{blue}{alpha}b^Tx: alpha Axle c$$

          Where $alpha in mathbb{R}setminus {0}$



          The primal solution would remain the same since the feasible set remains the same. The corresponding dual solution would be $frac1{alpha}bar{y}$.






          share|cite|improve this answer























          • For (P$alpha$) why would you multiply b by $alpha$? Wouldn't that make $alpha Ax=alpha b$ equivalent to $Ax=b$?
            – CandyKing312312
            Nov 26 at 12:59












          • That is what the question meant right? Multiplying the constraint $Ax=b$ by a scalar. not just multiplying each row of $A$ by $alpha$. Yes, they are equivalent.
            – Siong Thye Goh
            Nov 26 at 13:05












          • My mistake, I meant $overline{A}_i=alpha*A_i$. Where $overline{A}$ represents the modified primal constraint
            – CandyKing312312
            Nov 26 at 13:07








          • 1




            you probably mean $alpha in mathbb{R}setminus{0}$
            – LinAlg
            Nov 26 at 17:00

















          up vote
          2
          down vote













          We would have



          $$text{(P$alpha$) min }c^Tx: alpha Ax=color{blue}alpha b, xle 0$$

          and it's dual would be
          $$text{(D$alpha$) max }color{blue}{alpha}b^Tx: alpha Axle c$$

          Where $alpha in mathbb{R}setminus {0}$



          The primal solution would remain the same since the feasible set remains the same. The corresponding dual solution would be $frac1{alpha}bar{y}$.






          share|cite|improve this answer























          • For (P$alpha$) why would you multiply b by $alpha$? Wouldn't that make $alpha Ax=alpha b$ equivalent to $Ax=b$?
            – CandyKing312312
            Nov 26 at 12:59












          • That is what the question meant right? Multiplying the constraint $Ax=b$ by a scalar. not just multiplying each row of $A$ by $alpha$. Yes, they are equivalent.
            – Siong Thye Goh
            Nov 26 at 13:05












          • My mistake, I meant $overline{A}_i=alpha*A_i$. Where $overline{A}$ represents the modified primal constraint
            – CandyKing312312
            Nov 26 at 13:07








          • 1




            you probably mean $alpha in mathbb{R}setminus{0}$
            – LinAlg
            Nov 26 at 17:00















          up vote
          2
          down vote










          up vote
          2
          down vote









          We would have



          $$text{(P$alpha$) min }c^Tx: alpha Ax=color{blue}alpha b, xle 0$$

          and it's dual would be
          $$text{(D$alpha$) max }color{blue}{alpha}b^Tx: alpha Axle c$$

          Where $alpha in mathbb{R}setminus {0}$



          The primal solution would remain the same since the feasible set remains the same. The corresponding dual solution would be $frac1{alpha}bar{y}$.






          share|cite|improve this answer














          We would have



          $$text{(P$alpha$) min }c^Tx: alpha Ax=color{blue}alpha b, xle 0$$

          and it's dual would be
          $$text{(D$alpha$) max }color{blue}{alpha}b^Tx: alpha Axle c$$

          Where $alpha in mathbb{R}setminus {0}$



          The primal solution would remain the same since the feasible set remains the same. The corresponding dual solution would be $frac1{alpha}bar{y}$.







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited Nov 26 at 17:18

























          answered Nov 26 at 12:54









          Siong Thye Goh

          97.5k1463116




          97.5k1463116












          • For (P$alpha$) why would you multiply b by $alpha$? Wouldn't that make $alpha Ax=alpha b$ equivalent to $Ax=b$?
            – CandyKing312312
            Nov 26 at 12:59












          • That is what the question meant right? Multiplying the constraint $Ax=b$ by a scalar. not just multiplying each row of $A$ by $alpha$. Yes, they are equivalent.
            – Siong Thye Goh
            Nov 26 at 13:05












          • My mistake, I meant $overline{A}_i=alpha*A_i$. Where $overline{A}$ represents the modified primal constraint
            – CandyKing312312
            Nov 26 at 13:07








          • 1




            you probably mean $alpha in mathbb{R}setminus{0}$
            – LinAlg
            Nov 26 at 17:00




















          • For (P$alpha$) why would you multiply b by $alpha$? Wouldn't that make $alpha Ax=alpha b$ equivalent to $Ax=b$?
            – CandyKing312312
            Nov 26 at 12:59












          • That is what the question meant right? Multiplying the constraint $Ax=b$ by a scalar. not just multiplying each row of $A$ by $alpha$. Yes, they are equivalent.
            – Siong Thye Goh
            Nov 26 at 13:05












          • My mistake, I meant $overline{A}_i=alpha*A_i$. Where $overline{A}$ represents the modified primal constraint
            – CandyKing312312
            Nov 26 at 13:07








          • 1




            you probably mean $alpha in mathbb{R}setminus{0}$
            – LinAlg
            Nov 26 at 17:00


















          For (P$alpha$) why would you multiply b by $alpha$? Wouldn't that make $alpha Ax=alpha b$ equivalent to $Ax=b$?
          – CandyKing312312
          Nov 26 at 12:59






          For (P$alpha$) why would you multiply b by $alpha$? Wouldn't that make $alpha Ax=alpha b$ equivalent to $Ax=b$?
          – CandyKing312312
          Nov 26 at 12:59














          That is what the question meant right? Multiplying the constraint $Ax=b$ by a scalar. not just multiplying each row of $A$ by $alpha$. Yes, they are equivalent.
          – Siong Thye Goh
          Nov 26 at 13:05






          That is what the question meant right? Multiplying the constraint $Ax=b$ by a scalar. not just multiplying each row of $A$ by $alpha$. Yes, they are equivalent.
          – Siong Thye Goh
          Nov 26 at 13:05














          My mistake, I meant $overline{A}_i=alpha*A_i$. Where $overline{A}$ represents the modified primal constraint
          – CandyKing312312
          Nov 26 at 13:07






          My mistake, I meant $overline{A}_i=alpha*A_i$. Where $overline{A}$ represents the modified primal constraint
          – CandyKing312312
          Nov 26 at 13:07






          1




          1




          you probably mean $alpha in mathbb{R}setminus{0}$
          – LinAlg
          Nov 26 at 17:00






          you probably mean $alpha in mathbb{R}setminus{0}$
          – LinAlg
          Nov 26 at 17:00




















          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.





          Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


          Please pay close attention to the following guidance:


          • 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.


          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%2f3014278%2fchanges-in-primal-and-dual-solutions-when-scaled%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

          To store a contact into the json file from server.js file using a class in NodeJS

          Redirect URL with Chrome Remote Debugging Android Devices

          Dieringhausen