The meaning of active and non-active constraints












0














Consider the constrained minimization problem



min $f(x), x in mathbb{R^n}$



s.t $h_i(x)=0, i=1,2,...m$



$g_i(x) leq 0 , i=1,2,..k$



Now the author states:



" For a feasible solution $x$, some of the inequality constraints can be satisfied at $x$ as strict in-
equalities (i.e., $g_i (x) < 0$), and some – as equalities: $g_i (x) = 0$. The inequality constraints
of this latter type are called active at $x∗$ , and those of the former type – nonactive. The
reason for this terminology is clear: for a nonactive at $x$ inequality constraint we have
$g_i(x) < 0$; from continuity of $g_i$ it follows that the constraint is satisfied in a neighbour-
hood of $x$ as well; in other words, such an inequality locally does not participate in the
problem: it makes no influence on feasibility/infeasibility of candidate solutions close to
$x$ (of course, “far” from $x$ such an inequality can also come into the play). In contrast to
this, an active at $x$ inequality cannot be neglected even in a small neighborhood of the
point: normally, it influences feasibility/infeasibility of close to $x$ candidate solutions."



I'm really confused at a feasible point $x$ where $g_i(x) < 0$ and by the continuity of $g_i$ now we know that in some neighborhood $N_r(x)$ of $x$ the constraint $g_i(y) < 0$ is met $forall y in N_r(x)$ so it tells us that all the $ys$ in $N_r(x)$ are feasible also. Then why he states that "such an inequality locally does not participate in the problem:it makes no influence on feasibility/infeasibility of candidate solutions close to $x$" it has influence since it tells us the $ys$ are feasible!!










share|cite|improve this question





























    0














    Consider the constrained minimization problem



    min $f(x), x in mathbb{R^n}$



    s.t $h_i(x)=0, i=1,2,...m$



    $g_i(x) leq 0 , i=1,2,..k$



    Now the author states:



    " For a feasible solution $x$, some of the inequality constraints can be satisfied at $x$ as strict in-
    equalities (i.e., $g_i (x) < 0$), and some – as equalities: $g_i (x) = 0$. The inequality constraints
    of this latter type are called active at $x∗$ , and those of the former type – nonactive. The
    reason for this terminology is clear: for a nonactive at $x$ inequality constraint we have
    $g_i(x) < 0$; from continuity of $g_i$ it follows that the constraint is satisfied in a neighbour-
    hood of $x$ as well; in other words, such an inequality locally does not participate in the
    problem: it makes no influence on feasibility/infeasibility of candidate solutions close to
    $x$ (of course, “far” from $x$ such an inequality can also come into the play). In contrast to
    this, an active at $x$ inequality cannot be neglected even in a small neighborhood of the
    point: normally, it influences feasibility/infeasibility of close to $x$ candidate solutions."



    I'm really confused at a feasible point $x$ where $g_i(x) < 0$ and by the continuity of $g_i$ now we know that in some neighborhood $N_r(x)$ of $x$ the constraint $g_i(y) < 0$ is met $forall y in N_r(x)$ so it tells us that all the $ys$ in $N_r(x)$ are feasible also. Then why he states that "such an inequality locally does not participate in the problem:it makes no influence on feasibility/infeasibility of candidate solutions close to $x$" it has influence since it tells us the $ys$ are feasible!!










    share|cite|improve this question



























      0












      0








      0







      Consider the constrained minimization problem



      min $f(x), x in mathbb{R^n}$



      s.t $h_i(x)=0, i=1,2,...m$



      $g_i(x) leq 0 , i=1,2,..k$



      Now the author states:



      " For a feasible solution $x$, some of the inequality constraints can be satisfied at $x$ as strict in-
      equalities (i.e., $g_i (x) < 0$), and some – as equalities: $g_i (x) = 0$. The inequality constraints
      of this latter type are called active at $x∗$ , and those of the former type – nonactive. The
      reason for this terminology is clear: for a nonactive at $x$ inequality constraint we have
      $g_i(x) < 0$; from continuity of $g_i$ it follows that the constraint is satisfied in a neighbour-
      hood of $x$ as well; in other words, such an inequality locally does not participate in the
      problem: it makes no influence on feasibility/infeasibility of candidate solutions close to
      $x$ (of course, “far” from $x$ such an inequality can also come into the play). In contrast to
      this, an active at $x$ inequality cannot be neglected even in a small neighborhood of the
      point: normally, it influences feasibility/infeasibility of close to $x$ candidate solutions."



      I'm really confused at a feasible point $x$ where $g_i(x) < 0$ and by the continuity of $g_i$ now we know that in some neighborhood $N_r(x)$ of $x$ the constraint $g_i(y) < 0$ is met $forall y in N_r(x)$ so it tells us that all the $ys$ in $N_r(x)$ are feasible also. Then why he states that "such an inequality locally does not participate in the problem:it makes no influence on feasibility/infeasibility of candidate solutions close to $x$" it has influence since it tells us the $ys$ are feasible!!










      share|cite|improve this question















      Consider the constrained minimization problem



      min $f(x), x in mathbb{R^n}$



      s.t $h_i(x)=0, i=1,2,...m$



      $g_i(x) leq 0 , i=1,2,..k$



      Now the author states:



      " For a feasible solution $x$, some of the inequality constraints can be satisfied at $x$ as strict in-
      equalities (i.e., $g_i (x) < 0$), and some – as equalities: $g_i (x) = 0$. The inequality constraints
      of this latter type are called active at $x∗$ , and those of the former type – nonactive. The
      reason for this terminology is clear: for a nonactive at $x$ inequality constraint we have
      $g_i(x) < 0$; from continuity of $g_i$ it follows that the constraint is satisfied in a neighbour-
      hood of $x$ as well; in other words, such an inequality locally does not participate in the
      problem: it makes no influence on feasibility/infeasibility of candidate solutions close to
      $x$ (of course, “far” from $x$ such an inequality can also come into the play). In contrast to
      this, an active at $x$ inequality cannot be neglected even in a small neighborhood of the
      point: normally, it influences feasibility/infeasibility of close to $x$ candidate solutions."



      I'm really confused at a feasible point $x$ where $g_i(x) < 0$ and by the continuity of $g_i$ now we know that in some neighborhood $N_r(x)$ of $x$ the constraint $g_i(y) < 0$ is met $forall y in N_r(x)$ so it tells us that all the $ys$ in $N_r(x)$ are feasible also. Then why he states that "such an inequality locally does not participate in the problem:it makes no influence on feasibility/infeasibility of candidate solutions close to $x$" it has influence since it tells us the $ys$ are feasible!!







      nonlinear-optimization numerical-optimization constraint-programming






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Nov 26 '18 at 16:09

























      asked Nov 26 '18 at 6:10









      Dreamer123

      24619




      24619






















          2 Answers
          2






          active

          oldest

          votes


















          0














          The inequality constraints essentially give you the set where you are allowed to search for your solutions (i.e. the domain of your problem). If an inequality constraint is not binding, this roughly means that you are in the interior of the set where you are allowed to search for solutions. In particular, since you are in the interior, you may fit a small ball between this "feasible point" and the "walls" enforced by your constraint.



          Interpreting this small ball we may fit in between the candidate $x$ and the constraints as candidates close to $x$, one reobtains:



          such an inequality locally does not participate in the problem:it makes no influence on feasibility/infeasibility of candidate solutions close to $x$.



          The point here is that it does not locally change the behavior of your problem, although it for sure may impact the global properties (such as deciding the feasible set).






          share|cite|improve this answer





























            0














            Let's look at a simple example, with two constraints. The domain is the real number line. The constraints are
            $$
            x le 2 \
            x le 3.
            $$

            Now look at the point $x = 2$. Both constraints are satisfied; the first (at this point) is an equality constraint, the second is a strict inequality, because $2 < 3$.



            Near $x = 2$ (say, for $1.9 < x < 2.1$) the second constraint is always satisfied, so all points in that region are feasible for the second constraint. That does not make them feasible solutions to the set of inequalities however. So your assertion that " it has influence since it tells us the ys are feasible!!" is mistaken. The strict inequality tells us that the $y$s are feasible for that one constraint, not for the overall problem.






            share|cite|improve this answer





















              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%2f3013912%2fthe-meaning-of-active-and-non-active-constraints%23new-answer', 'question_page');
              }
              );

              Post as a guest















              Required, but never shown

























              2 Answers
              2






              active

              oldest

              votes








              2 Answers
              2






              active

              oldest

              votes









              active

              oldest

              votes






              active

              oldest

              votes









              0














              The inequality constraints essentially give you the set where you are allowed to search for your solutions (i.e. the domain of your problem). If an inequality constraint is not binding, this roughly means that you are in the interior of the set where you are allowed to search for solutions. In particular, since you are in the interior, you may fit a small ball between this "feasible point" and the "walls" enforced by your constraint.



              Interpreting this small ball we may fit in between the candidate $x$ and the constraints as candidates close to $x$, one reobtains:



              such an inequality locally does not participate in the problem:it makes no influence on feasibility/infeasibility of candidate solutions close to $x$.



              The point here is that it does not locally change the behavior of your problem, although it for sure may impact the global properties (such as deciding the feasible set).






              share|cite|improve this answer


























                0














                The inequality constraints essentially give you the set where you are allowed to search for your solutions (i.e. the domain of your problem). If an inequality constraint is not binding, this roughly means that you are in the interior of the set where you are allowed to search for solutions. In particular, since you are in the interior, you may fit a small ball between this "feasible point" and the "walls" enforced by your constraint.



                Interpreting this small ball we may fit in between the candidate $x$ and the constraints as candidates close to $x$, one reobtains:



                such an inequality locally does not participate in the problem:it makes no influence on feasibility/infeasibility of candidate solutions close to $x$.



                The point here is that it does not locally change the behavior of your problem, although it for sure may impact the global properties (such as deciding the feasible set).






                share|cite|improve this answer
























                  0












                  0








                  0






                  The inequality constraints essentially give you the set where you are allowed to search for your solutions (i.e. the domain of your problem). If an inequality constraint is not binding, this roughly means that you are in the interior of the set where you are allowed to search for solutions. In particular, since you are in the interior, you may fit a small ball between this "feasible point" and the "walls" enforced by your constraint.



                  Interpreting this small ball we may fit in between the candidate $x$ and the constraints as candidates close to $x$, one reobtains:



                  such an inequality locally does not participate in the problem:it makes no influence on feasibility/infeasibility of candidate solutions close to $x$.



                  The point here is that it does not locally change the behavior of your problem, although it for sure may impact the global properties (such as deciding the feasible set).






                  share|cite|improve this answer












                  The inequality constraints essentially give you the set where you are allowed to search for your solutions (i.e. the domain of your problem). If an inequality constraint is not binding, this roughly means that you are in the interior of the set where you are allowed to search for solutions. In particular, since you are in the interior, you may fit a small ball between this "feasible point" and the "walls" enforced by your constraint.



                  Interpreting this small ball we may fit in between the candidate $x$ and the constraints as candidates close to $x$, one reobtains:



                  such an inequality locally does not participate in the problem:it makes no influence on feasibility/infeasibility of candidate solutions close to $x$.



                  The point here is that it does not locally change the behavior of your problem, although it for sure may impact the global properties (such as deciding the feasible set).







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Nov 26 '18 at 7:09









                  Ziemann

                  515




                  515























                      0














                      Let's look at a simple example, with two constraints. The domain is the real number line. The constraints are
                      $$
                      x le 2 \
                      x le 3.
                      $$

                      Now look at the point $x = 2$. Both constraints are satisfied; the first (at this point) is an equality constraint, the second is a strict inequality, because $2 < 3$.



                      Near $x = 2$ (say, for $1.9 < x < 2.1$) the second constraint is always satisfied, so all points in that region are feasible for the second constraint. That does not make them feasible solutions to the set of inequalities however. So your assertion that " it has influence since it tells us the ys are feasible!!" is mistaken. The strict inequality tells us that the $y$s are feasible for that one constraint, not for the overall problem.






                      share|cite|improve this answer


























                        0














                        Let's look at a simple example, with two constraints. The domain is the real number line. The constraints are
                        $$
                        x le 2 \
                        x le 3.
                        $$

                        Now look at the point $x = 2$. Both constraints are satisfied; the first (at this point) is an equality constraint, the second is a strict inequality, because $2 < 3$.



                        Near $x = 2$ (say, for $1.9 < x < 2.1$) the second constraint is always satisfied, so all points in that region are feasible for the second constraint. That does not make them feasible solutions to the set of inequalities however. So your assertion that " it has influence since it tells us the ys are feasible!!" is mistaken. The strict inequality tells us that the $y$s are feasible for that one constraint, not for the overall problem.






                        share|cite|improve this answer
























                          0












                          0








                          0






                          Let's look at a simple example, with two constraints. The domain is the real number line. The constraints are
                          $$
                          x le 2 \
                          x le 3.
                          $$

                          Now look at the point $x = 2$. Both constraints are satisfied; the first (at this point) is an equality constraint, the second is a strict inequality, because $2 < 3$.



                          Near $x = 2$ (say, for $1.9 < x < 2.1$) the second constraint is always satisfied, so all points in that region are feasible for the second constraint. That does not make them feasible solutions to the set of inequalities however. So your assertion that " it has influence since it tells us the ys are feasible!!" is mistaken. The strict inequality tells us that the $y$s are feasible for that one constraint, not for the overall problem.






                          share|cite|improve this answer












                          Let's look at a simple example, with two constraints. The domain is the real number line. The constraints are
                          $$
                          x le 2 \
                          x le 3.
                          $$

                          Now look at the point $x = 2$. Both constraints are satisfied; the first (at this point) is an equality constraint, the second is a strict inequality, because $2 < 3$.



                          Near $x = 2$ (say, for $1.9 < x < 2.1$) the second constraint is always satisfied, so all points in that region are feasible for the second constraint. That does not make them feasible solutions to the set of inequalities however. So your assertion that " it has influence since it tells us the ys are feasible!!" is mistaken. The strict inequality tells us that the $y$s are feasible for that one constraint, not for the overall problem.







                          share|cite|improve this answer












                          share|cite|improve this answer



                          share|cite|improve this answer










                          answered Nov 26 '18 at 16:16









                          John Hughes

                          62.4k24090




                          62.4k24090






























                              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%2f3013912%2fthe-meaning-of-active-and-non-active-constraints%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

                              Plaza Victoria

                              In PowerPoint, is there a keyboard shortcut for bulleted / numbered list?

                              How to put 3 figures in Latex with 2 figures side by side and 1 below these side by side images but in...