publication . Conference object . Preprint . 2011

Continuous reformulations for zero-one programming problems

Santis, M.; Lucidi, S.; Francesco RINALDI;
  • Published: 01 Jan 2011
Abstract
In this work, we study continuous reformulations of zero-one programming problems. We prove that, under suitable conditions, the optimal solutions of a zero-one programming problem can be obtained by solving a specific continuous problem.
Subjects
free text keywords: Zero-one programming, Concave functions, Continuous programming

[1] Abello, J., Butenko, S., Pardalos, P.M., Resende, M.,Finding independent sets in a graph using continuous multivariable polynomial formulations. J. Glob. Optim. 21, 111137, 2001.

[2] Balasundaram, B., Butenko, S.,Constructing test functions for global optimization using continuous formulations of graph problems. Optim. Methods Softw. 20, 439452, 2005. [OpenAIRE]

[3] Horst, R., Pardalos, P.M., Thoai, N.V.,Introduction to Global Optimization 2nd edn. Kluwer, Dordrecht, 2000.

[4] Borchardt M., An Exact Penalty Approach for Solving a Class of Minimization Problems with Boolean Variables. Optimization. 19(6), pp. 829-838, 1988.

[5] M. De Santis, S. Lucidi, F. Rinaldi. New Concave Penalty functions for improving the feasibility pump. Department of Computer and System Sciences Antonio Ruberti Technical Reports, Vol.2(10), 2010.

[6] Giannessi F., Niccolucci F., Connections between nonlinear and integer programming problems. Symposia Mathematica, Academic Press, New York , Vol. 19, pp. 161-176, 1976.

[7] Kalantari B., Rosen J.B., Penalty Formulation for Zero-One Integer Equivalent Problem. Mathematical Programming, Vol. 24, pp. 229-232, 1982.

[8] Kalantari B., Rosen J.B., Penalty Formulation for Zero-One Nonlinear Programming. Discrete Applied Mathematics, Vol. 16(2), pp. 179-182, 1987. [OpenAIRE]

[9] S. Lucidi, F. Rinaldi. Exact penalty functions for nonlinear integer programming problems. J Optim Theory Appl Vol. 145, pp. 479-488, 2010. [OpenAIRE]

[10] Mangasarian, O.L., Knapsack Feasibility as an Absolute Value Equation Solvable by Successive Linear Programming.Optim. Lett. Vol. 3(2), 2009.

[11] Murray W., Ng K. M., An algorithm for nonlinear optimization problems with binary variables. Computational Optimization and Applications, Vol. 47(2), 257-288, 2010.

[12] Pardalos P. M., Prokopyev O. A., Busygin S., Continuous Approaches for Solving Discrete Optimization Problems. Handbook on Modelling for Discrete Optimization, Springer US, Vol. 88, pp. 39-60, 2006. [OpenAIRE]

[15] Rockafellar T., Convex Analysis, Princeton University Press, 1970.

Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue
publication . Conference object . Preprint . 2011

Continuous reformulations for zero-one programming problems

Santis, M.; Lucidi, S.; Francesco RINALDI;