The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » sci.math.* » sci.math

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: How to solve linear equation with linear constraints
Replies: 6   Last Post: Jun 23, 2006 7:40 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Toni Lassila

Posts: 536
Registered: 12/13/04
Re: How to solve linear equation with linear constraints
Posted: Jun 23, 2006 11:47 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

On 23 Jun 2006 08:22:23 -0700, "" <> wrote:

> wrote:
>> Hi Folks,
>> I am interested in the equation of form:
>> a1*x1+a2*x2+a3**xn + b = 0
>> where "" and "b" are given and "x1...xn" are n unknown
>> variables. Obviously, the system has n unknowns and only one equation.
>> This equation comes with a set of constraints of form:
>> -1<xi<1 where i = 1, ...n.

>Do you really mean -1 < xi < 1, or do you actually mean -1 <= xi <= 1?
>This makes a tremendous difference. With non-strict inequalities, you
>have an extensive and powerful theory of linear programming available
>to you, but with strict inequalities this is not the case. It is
>possible that your problem has no solution at all if you use "<", but
>has easily-obtained solutions if you use "<=".

It's not an optimization problem. Of course there are solutions if
sum_i |a_i| > |b|.

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.