Discrete monotonic optimization with application to a discrete location problem

SIAM Journal on Optimization

Volumn 17, Issue 1, 2007, Pages 79-97

  Tuy, Hoang ^a   Minoux, Michel ^b   Hoai Phuong, N T ^a  

^a INSTITUTE OF MATHEMATICS   (Viet Nam)

^b SORBONNE UNIVERSITÉ   (France)

Author keywords

Branch reduce and bound algorithm; Design centering; Differences of increasing functions; Discrete location; Discrete optimization; Monotonic optimization; Monotonicity cuts; Polyblock approximation

Indexed keywords

COMPUTATIONAL METHODS; INTEGER PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING;

BRANCH-REDUCE-AND-BOUND ALGORITHM; DESIGN CENTERING; DIFFERENCES OF INCREASING FUNCTIONS; DISCRETE LOCATION; DISCRETE OPTIMIZATION; MONOTONIC OPTIMIZATION; MONOTONICITY CUTS; POLYBLOCK APPROXIMATION;

OPTIMIZATION;

EID: 33847126154     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/04060932X     Document Type: Article

References (16)

1. H. KONNO, P. T. THACH, AND H. TUY, Optimization on Low Rank Nonconvex Structures, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1997.
2. J. B. LASSERRE, Global optimization with polynomials and the problem of moments, SIAM J. Optim., 11 (2001), pp. 796-817.
3. M. MINOUX AND H. TUY, An Approach to Discrete Monotonic Optimization, preprint, Institute of Mathematics, Hanoi, Vietnam, 2001.
4. F. PLASTRIA, Continuous location problems, in Facility Location, Z. Drezner and H. W. Harnacher, eds., Springer, Berlin, 1995, pp. 225-262.
5. A. RUBINOV, H. TUY, AND H. MAYS, Algorithm for a monotonic global optimization problem, Optimization, 49 (2001), pp. 205-221.
6. J. S. SHI AND Y. YAMAMOTO, A d.c. approach to the largest empty sphere problem in higher dimension, in State of the Art in Global Optimization, C. Floudas and P. Pardalos, eds., Kluwer Academic Publishers, Dordrecht, The Netherlands, 1996, pp. 395-411.
7. N. Z. SHOR, Nondifferentiable Optimization and Polynomial Problems, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1998.
8. P. T. THACH, The design centering problem as a D.C. programming problem, Math. Programming, 41 (1988), pp. 229-248.
9. H. TUY, Normal sets, polyblocks, and monotonic optimization, Vietnam J. Math., 27 (1999), pp. 277-300.
10. H. TUY, Monotonic optimization: Problems and solution approaches, SIAM J. Optim., 11 (2000), pp. 464-494.
11. H. TUY, F. AL-KHAYYAL, AND P. T. THACH, Monotonic optimization: Branch and cut methods, in Essays and Surveys on Global Optimization, C. Audet, P. Hansen, and G. Savard, eds., Springer, New York, 2005, pp. 39-78.
12. H. TUY AND L. T. LUC, A new approach to optimization under monotonic constraint, J. Global Optim., 18 (2000), pp. 1-15.
13. H. TUY AND N. T. HOAI PHUONG, A unified monotonic approach to generalized linear fractional programming, J. Global Optim., 26 (2003), pp. 229-259.
14. H. TUY, N. D. NGHIA, AND L. S. VINH, A discrete location problem, Acta Math. Vietnam., 28 (2003), pp. 185-199.
15. H. TUY, P. T. THACH, AND H. KONNO, Optimization of polynomial fractional programming, J. Global Optim., 29 (2004), pp. 19-44.
16. L. M. VIDIGAL AND S. W. DIRECTOR, A design centering problem algorithm for nonconvex regions of acceptability, IEEE Trans, on Computer-aided Design of Integrated Circuits and Systems, 14 (1982), pp. 13-24.