Simple Search

Query:

Enter a query and click »Search«...

Format:

Display: entries per page entries

Zbl 0713.90056
Feautrier, Paul
Parametric integer programming. (English)
[J] RAIRO, Rech. Opér. 22, No.3, 243-268 (1988). ISSN 0399-0559

From the summary: ``When analysing computer programs one is often confronted with integer programming problems. These problems have three peculiarities: (i) feasible points are ranked according to lexicographic order rather than by the usual linear economic function; (ii) the feasible set depends on integer parameters; (iii) one is interested only in exact solutions. In the paper we show that (1) the classical simplex algorithm has no difficulty in handling lexicographic ordering; (2) the algorithm may be executed in symbolic mode, thus giving the solution of continuous parametric problems; (3) the method may be extended to problems in integers. We prove that the resulting algorithm always terminates and give an estimate of its complexity.''

MSC 2000:: *90C10 Integer programming
90C31 Sensitivity, etc.
90C60 Abstract computational complexity for math. programming problems
90C05 Linear programming
90-08 Computational methods (optimization)

Keywords: lexicographic order; simplex algorithm; continuous parametric problems; estimate of its complexity

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Simple Search

Zentralblatt MATH Berlin [Germany]