A Complementarity Constraint Formulation of Convex Multiobjective Optimization Problems

References

• Anitescu M. Global convergence of an elastic mode approach for a class of mathematical programs with complementarity constraints. SIAM J. Optim. (2005) 16(1):120–145Crossref, Google Scholar
• Benson H., Sen A., Shanno D., Vanderbei R. Interior-point algorithms, penalty methods and equilibrium problems. Computational Optim. Appl. (2006) 34(2):155–182Crossref, Google Scholar
• Chen Y., Florian M. The nonlinear bilevel programming problem: Formulations, regularity and optimality conditions. Optimization (1995) 32:193–209Crossref, Google Scholar
• Clarke F. H.Optimization and Nonsmooth Analysis (1983) (Wiley, New York) . Reprinted by SIAM, 1990Google Scholar
• Das I., Dennis J. E. A closer look at drawbacks of minimizing weighted sums of objectives for Pareto set generation in multicriteria optimization problems. Structural Multidisciplinary Optim. (1997) 14(1):63–69Crossref, Google Scholar
• Das I., Dennis J. E. Normal-boundary intersection: A new method for generating the Pareto surface in nonlinear multicriteria optimization problems. SIAM J. Optim. (1998) 8(3):631–657Crossref, Google Scholar
• Dirkse S. P., Ferris M. C. The path solver: A nonmonotone stabilization scheme for mixed complementarity problems. Optim. Methods Software (1995) 5:123–156Crossref, Google Scholar
• Ehrgott M.Multicriteria Optimization (2005) 4912nd ed.(Springer Verlag, New York) Lecture Notes in Economics and Mathematical SystemsGoogle Scholar
• Ferris M. C., Munson T. S. Complementarity problems in GAMS and the PATH solver. J. Econom. Dynam. Control (2000) 24(2):165–188Crossref, Google Scholar
• Fletcher R., Leyffer S. Nonlinear programming without a penalty function. Math. Programming (2002) 91:239–270Crossref, Google Scholar
• Fletcher R., Leyffer S. Solving mathematical program with complementarity constraints as nonlinear programs. Optim. Methods Software (2004) 19(1):15–40Crossref, Google Scholar
• Fletcher R., Leyffer S., Toint P. L. On the global convergence of a filter-SQP algorithm. SIAM J. Optim. (2002) 13(1):44–59Crossref, Google Scholar
• Fletcher R., Leyffer S., Ralph D., Scholtes S. Local convergence of SQP methods for mathematical programs with equilibrium constraints. SIAM J. Optim. (2006) 17(1):259–286Crossref, Google Scholar
• Fourer R., Gay D. M., Kernighan B. W.AMPL: A Modelling Language for Mathematical Programming (2003) 2nd ed.(Books/Cole—Thomson Learning, Pacific Grove, CA) Google Scholar
• Hillermeier C.Nonlinear Multiobjective Optimization (2001) (Birkhäuser Verlag, Berlin) Crossref, Google Scholar
• Hock W., Schittkowski K.Test Examples for Nonlinear Programming Codes (1981) (Springer-Verlag, Berlin) Crossref, Google Scholar
• Hwang C.-L., Masud A. S. M.Multiple Objective Decision Making—Methods and Applications (1979) 164(Springer-Verlag, Berlin) Lecture Notes in Economics and Mathematical SystemsCrossref, Google Scholar
• Leyffer S. Mathematical programs with complementarity constraints. SIAG/OPT Views-and-News (2003) 14(1):15–18Google Scholar
• Leyffer S., Dempe S., Kalashnikov V. Complementarity constraints as nonlinear equations: Theory and numerical experience. Optimization and Multivalued Mappings (2006) (Springer-Verlag, Berlin) 169–208Crossref, Google Scholar
• Leyffer S., Lopez-Calva G., Nocedal J. Interior methods for mathematical programs with complementarity constraints. SIAM J. Optim. (2006) 17(1):52–77Crossref, Google Scholar
• Li W., Swetits J. A Newton method for convex regression, data smoothing and quadratic programming with bound constraints. SIAM J. Optim. (1993) 3(3):466–488Crossref, Google Scholar
• Liu X., Perakis G., Sun J. A robust SQP method for mathematical programs with linear complementarity constraints. Computational Optim. Appl. (2006) 34(1):5–33Crossref, Google Scholar
• Miettinen K.Nonlinear Multiobjective Optimization (1999) (Kluwer Academic Publishers, Boston) Google Scholar
• Miettinen K., Mäkelä M. M. Proper Pareto optimality in nonconvex problems—Characterization with tangent and normal cones. (1998a) . Report 11/1998, Department of Mathematics, University of Jyväskylä, Jyväskylä, FinlandGoogle Scholar
• Miettinen K., Mäkelä M. M. Theoretical and computational comparison of multiobjective optimization methods NIMBUS and RD. (1998b) . Report 5/1998, Department of Mathematics, University of Jyväskylä, Jyväskylä, FinlandGoogle Scholar
• Miettinen K., Mäkelä M. M. Interactive multiobjective optimization system WWW-NIMBUS on the Internet. Comput. Oper. Res. (2000) 27:709–723Crossref, Google Scholar
• Oliveira S. L. C., Ferreira P. A. V. Bi-objective optimization with multiple decision-makers: A convex approach to attain majority solutions. JORS (2000) 51:333–340Crossref, Google Scholar
• Raghunathan A., Biegler L. T. An interior point method for mathematical programs with complementarity constraints (MPCCs). SIAM J. Optim. (2005) 15(3):720–750Crossref, Google Scholar
• Rustem B.Algorithms for Nonlinear Programming and Multiple Objective Decision (1998) (Wiley, Chichester, UK) Google Scholar
• Sahinidis N. V.Branch and Reduce Optimization Navigator (2000) Version 4.0 ed.(University of Illinois at Urbana-Champaign, Urbana) Google Scholar
• Sayin S. Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming. Math. Programming (2000) 87(3):543–560Crossref, Google Scholar
• Scheel H., Scholtes S. Mathematical program with complementarity constraints: Stationarity, optimality and sensitivity. Math. Oper. Res. (2000) 25:1–22Link, Google Scholar
• Stadler W.Multicriteria Optimization in Engineering and in the Sciences (1988) (Plenum Press, New York) Crossref, Google Scholar
• Steuer R. E.Multiple Criteria Optimization: Theory, Computation and Applications (1986) (John Wiley & Sons, New York) Google Scholar
• Tappeta R. V., Renaud J. E. Interactive multiobjective optimization procedure with local preferences. Proc. 3rd WCSMO (1999) Buffalo, NY http://www.eng.buffalo.edu/Research/MODEL/wcsmo3/proceedings/Google Scholar
• Tawarmalani M., Sahinidis N. V.Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications, Nonconvex Optimization and Its Applications (2002) 65(Kluwer Academic Publishers, Boston) Crossref, Google Scholar
• Wang J.-F., Renaud J. E. Automatic differentiation in multi-objective collaborative optimization. Proc. 3rd WCSMO (1999) Buffalo, NY http://www.eng.buffalo.edu/Research/MODEL/wcsmo3/proceedings/Google Scholar