- To: mathgroup at smc.vnet.net
- Subject: [mg19557] strict inequalities
- From: Joerg Rudolf Mueller <georgm at uni-koblenz.de>
- Date: Wed, 1 Sep 1999 23:06:58 -0400
- Organization: University of Koblenz, Germany
- Sender: owner-wri-mathgroup at wolfram.com
Is there a possibility to solve a set of (linear)
equations and to find a solution that satisfies certain
strict inequalities (e.g. x<y) AND non-strict
inequalities (e.g. x<=z)?
Is there a possibility to solve an optimization-problem
with strict AND non-strict inequalities?
If you know about Farkas' "alternativ theorems"
- in German we call it "Alternativsitze" - you'll
know that it's necessary to attend the strictness.
"ConstrainedMin/Max" unfortunately doesn't work to my contentedness.
(I need s.th. like ConstrainedMin/Max that doesn't ignore the strictness
In using "SemialgebraicComponents" (in packet
I can only give strict inequalities - constraints of
the form (x<=z) are not possible here.
With "InequalitySolve" (in packet Algebra`InequalitySolve`)
I can't solve optimization-problems.
best regards, Joerg Mueller.
Prev by Date:
Range[imin,imax,di]; was it better in 3.0 than in 4.0 ?
Next by Date:
Re: Re: Numbers problem
Previous by thread:
Re: Range[imin,imax,di]; was it better in 3.0 than in 4.0 ?
Next by thread:
Re: strict inequalities