Optimization in integers

Context
Optimization in integers

Author : Michel MINOUX

Publication date: April 10, 2008 | Lire en français

Add to my library

1. Context

A constrained integer optimization problem is generally defined as the search for the minimum (or maximum) of a real function of n real variables $f : ℝ^{n} \to ℝ$ on a given subset X of $ℝ^{n}$ , called the set of admissible solutions. Without loss of generality, we can assume that X is described as the set of points of $ℝ^{n}$ satisfying a certain number of conditions (constraints)...

You do not have access to this resource.

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource. Click here to request your free trial access!

Already subscribed? Log in!

Ongoing reading
Context

Previous
page Optimization in integers

Example of a production engineering application

Bibliography

References

(1) - BALAS (E.) - An Additive Algorithm for Solving Linear Programs with Zero-one Variables. - Operations Research, 13, 4, p. 517-546 (1965).
(2) - BALAS (E.) - Disjunctive Programming. - Annals of Discrete Mathematics, 5, p. 3-51 (1979).

You do not have access to this resource.

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource. Click here to request your free trial access!

Already subscribed? Log in!

Article included in this offer

"Mathematics"

( 168 articles )

Complete knowledge base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

View offer details

Context Optimization in integers

1. Context

Bibliography

References

Context
Optimization in integers