Use of exact penalty functions to determine efficient decisions

DOI10.1016/0377-2217(90)90405-ZMaRDI QIDQ2638947zbMATH OpenOpenAlexFDO

Authors Heinz Bernau

Publication date 1990

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(90)90405-z

zbMATH Keywords

vector optimizationexact penalty functionsnonlinear multiple criteria optimizationsuccessive quadratic programming methods

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonlinear programming (90C30)

Recommendations

• On the exact penalty functions
• scientific article; zbMATH DE number 778133
• Exact Penalty Functions in Constrained Optimization
• Exactness and algorithm of an objective penalty function
• A new class of exact penalty functions and penalty algorithms
• An exact penalty function of objective parameter
• Optimality conditions via exact penalty functions
• An estimation of exact penalty in constrained optimization
• A Direct Approach to the Discounted Penalty Function
• A multiplicative method of exact penalty functions

Cites work

• scientific article; zbMATH DE number 3175708 (Why is no real title available?)
• scientific article; zbMATH DE number 3934760 (Why is no real title available?)
• scientific article; zbMATH DE number 3987068 (Why is no real title available?)
• scientific article; zbMATH DE number 3987074 (Why is no real title available?)
• scientific article; zbMATH DE number 4068620 (Why is no real title available?)
• scientific article; zbMATH DE number 3744430 (Why is no real title available?)
• scientific article; zbMATH DE number 3583207 (Why is no real title available?)
• A globally convergent method for nonlinear programming
• A model algorithm for composite nondifferentiable optimization problems
• A survey of multicriteria optimization or the vector maximum problem. I: 1776-1960
• An Exact Potential Method for Constrained Maxima
• Exact penalty functions in nonlinear programming
• Goal programming and multiple objective optimizations. Part I
• On the completeness and constructiveness of parametric characterizations to vector optimization problems
• Optimale Entscheidung bei mehrfacher Zielsetzung
• Revisions of constraint approximations in the successive QP method for nonlinear programming problems
• Scalarization in vector optimization
• Some characterizations of the optimal solutions of a vector optimization problem

Cited in

(5)

• Multi-objective optimization over convex disjunctive feasible sets using reference points
• scientific article; zbMATH DE number 4095224 (Why is no real title available?)
• Vector optimization and generalized Lagrangian duality
• The exponential penalty function method for multiobjective programming problems
• Retrieval and use of the balance set in multiobjective global optimization

This page was built for publication: Use of exact penalty functions to determine efficient decisions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2638947)