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=-2.9 required=5.0 tests=BAYES_00,MAILING_LIST_MULTI
	autolearn=unavailable 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!newsread.com!newsprint.newsread.com!63.218.45.11.MISMATCH!newshosting.com!nx02.iad01.newshosting.com!newsfeed.icl.net!newsfeed.fjserv.net!oleane.net!oleane!freenix!enst.fr!melchior!cuivre.fr.eu.org!melchior.frmug.org!not-for-mail
From: "Alexander E. Kopilovich" <aek@VB1162.spb.edu>
Newsgroups: comp.lang.ada
Subject: Re: Ada and constraint programming
Date: Thu, 11 Nov 2004 03:54:32 +0300 (MSK)
Organization: Cuivre, Argent, Or
Message-ID: <mailman.93.1100134439.10401.comp.lang.ada@ada-france.org>
References: <87k6sted7l.fsf@deneb.enyo.de>
NNTP-Posting-Host: lovelace.ada-france.org
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
X-Trace: melchior.cuivre.fr.eu.org 1100134440 8775 212.85.156.195 (11 Nov 2004
 00:54:00 GMT)
X-Complaints-To: usenet@melchior.cuivre.fr.eu.org
NNTP-Posting-Date: Thu, 11 Nov 2004 00:54:00 +0000 (UTC)
To: comp.lang.ada@ada-france.org
Return-Path: <aek@VB1162.spb.edu>
In-Reply-To: <87k6sted7l.fsf@deneb.enyo.de>;
	from Florian Weimer at Wed, 10 Nov 2004 20:06:06 +0100
X-Mailer: Mail/@ [v2.44 MSDOS]
X-Virus-Scanned: by amavisd-new-20030616-p10 (Debian) at ada-france.org
X-BeenThere: comp.lang.ada@ada-france.org
X-Mailman-Version: 2.1.5
Precedence: list
List-Id: "Gateway to the comp.lang.ada Usenet newsgroup"
	<comp.lang.ada.ada-france.org>
List-Unsubscribe: <http://www.ada-france.org/mailman/listinfo/comp.lang.ada>,
	<mailto:comp.lang.ada-request@ada-france.org?subject=unsubscribe>
List-Post: <mailto:comp.lang.ada@ada-france.org>
List-Help: <mailto:comp.lang.ada-request@ada-france.org?subject=help>
List-Subscribe: <http://www.ada-france.org/mailman/listinfo/comp.lang.ada>,
	<mailto:comp.lang.ada-request@ada-france.org?subject=subscribe>
Xref: g2news1.google.com comp.lang.ada:6133
Date: 2004-11-11T03:54:32+03:00

Florian Weimer wrote:

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

Yes, and another branch of that is called "integer programming" or "discrete
programming" (this is about optimization in constrained discrete domains).