Exact penalty functions for nonlinear integer programming problems

Journal of Optimization Theory and Applications

Volumn 145, Issue 3, 2010, Pages 479-488

  Lucidi, S ^a   Rinaldi, F ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Continuous programming; Exact penalty functions; Nonlinear integer programming

Indexed keywords

CONDITION; CONTINUOUS PROGRAMMING; CONTINUOUS SPACES; EXACT PENALTY FUNCTIONS; NON-LINEAR INTEGER PROGRAMMING; NONLINEAR INTEGER PROGRAMMING PROBLEM; NONLINEAR PROBLEMS; OPTIMAL SOLUTIONS; PENALTY FORMULATION;

INTEGER PROGRAMMING;

EID: 77951980557     PISSN: 00223239     EISSN: 15732878     Source Type: Journal    
DOI: 10.1007/s10957-010-9700-7     Document Type: Article

References (15)

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, 111-137 (2001).
2. Balasundaram, B., Butenko, S.: Constructing test functions for global optimization using continuous formulations of graph problems. Optim. Methods Softw. 20, 439-452 (2005).
3. Horst, R., Pardalos, P. M., Thoai, N. V.: Introduction to Global Optimization, 2nd edn. Kluwer, Dordrecht (2000).
4. Mangasarian, O. L.: Knapsack feasibility as an absolute value equation solvable by successive linear programming. Optim. Lett. 3(2) (2009).
5. Murray, W., Ng, K. M.: An algorithm for nonlinear optimization problems with binary variables. Comput. Optim. Appl. (2010, to appear).
6. Pardalos, P. M., Prokopyev, O. A., Busygin, S.: Continuous Approaches for Solving Discrete Optimization Problems. Handbook on Modelling for Discrete Optimization, vol. 88, pp. 39-60. Springer, New York (2006).
7. Pardalos, P. M., Wolkowicz, H.: Topics in Semidefinite and Interior-Point Methods. Am. Math. Soc., Providence (1998).
8. Ragavachari, M.: On connections between zero-one integer programming and concave programming under linear constraints. Oper. Res. 17(4), 680-684 (1969).
9. Borchardt, M.: An exact penalty approach for solving a class of minimization problems with Boolean variables. Optimization 19(6), 829-838 (1988).
10. Giannessi, F., Niccolucci, F.: Connections between nonlinear and integer programming problems. In: Symposia Mathematica, vol. 19, pp. 161-176. Academic Press, New York (1976).
11. Kalantari, B., Rosen, J. B.: Penalty formulation for zero-one integer equivalent problem. Math. Program. 24, 229-232 (1982).
12. Kalantari, B., Rosen, J. B.: Penalty formulation for zero-one nonlinear programming. Discrete Appl. Math. 16(2), 179-182 (1987).
13. Rinaldi, F.: New results on the equivalence between zero-one programming and continuous concave programming. Optim. Lett. 3(3), 377-386 (2009).
14. Zhu, W. X.: Penalty parameter for linearly constrained 0-1 quadratic programming. J. Optim. Theory Appl. 116(1), 229-239 (2003).
15. Lucidi, S., Rinaldi, F.: Exact penalty functions for nonlinear integer programming problems. Technical Report Dipartimento Informatica e Sistemistica, Sapienza Università di Roma, vol. 1, n. 10 (2009).