From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.4
X-Google-Thread: 103376,495738d3723c3c78
X-Google-Attributes: gid103376,public
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news1.google.com!news2.google.com!proxad.net!newsfeed.stueberl.de!newsfeed01.sul.t-online.de!t-online.de!news.belwue.de!LF.net!news.enyo.de!not-for-mail
From: Florian Weimer <fw@deneb.enyo.de>
Newsgroups: comp.lang.ada
Subject: Re: Ada and constraint programming
Supersedes: <87mzxped8i.fsf@deneb.enyo.de>
Date: Wed, 10 Nov 2004 20:06:06 +0100
Message-ID: <87k6sted7l.fsf@deneb.enyo.de>
References: <looqmc.pf1.ln@skymaster> <UR6kd.109$w.23@trnddc02>
	<qvlsmc.bmq.ln@skymaster> <419231fa$1_1@baen1673807.greenlnk.net>
	<hsktmc.9cm.ln@skymaster>
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
X-Trace: albireo.enyo.de 1100113567 16973 212.9.189.171 (10 Nov 2004 19:06:07
 GMT)
X-Complaints-To: 
Cancel-Key: sha1:MqWOU2s1Tj5lzPzjP9Gq+YuFl/0=
Cancel-Lock: sha1:dTwWd/TAVwGXdRiNRMaCYHBGbPQ=
Xref: g2news1.google.com comp.lang.ada:6127
Date: 2004-11-10T20:06:06+01:00
List-Id: <comp.lang.ada>

* Jean-Pierre Rosen:

> No. It's more about finding a solution that minimizes
> this while not exceeding that, with an upper bound of foo that must
> not be more than half of bar...

This is called "linear programming", I think, at least in some special
cases.