Use of exact penalty functions to determine efficient decisions

DOI10.1016/0377-2217(90)90405-ZzbMATH Open0717.90066OpenAlexW2074231667MaRDI QIDQ2638947FDOQ2638947

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

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

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)

Cites Work

• Title not available (Why is that?)
• On the completeness and constructiveness of parametric characterizations to vector optimization problems
• A globally convergent method for nonlinear programming
• Exact penalty functions in nonlinear programming
• Title not available (Why is that?)
• Goal programming and multiple objective optimizations. Part I
• Title not available (Why is that?)
• Title not available (Why is that?)
• Scalarization in vector optimization
• An Exact Potential Method for Constrained Maxima
• A survey of multicriteria optimization or the vector maximum problem. I: 1776-1960
• Title not available (Why is that?)
• A model algorithm for composite nondifferentiable optimization problems
• Optimale Entscheidung bei mehrfacher Zielsetzung
• Title not available (Why is that?)
• Some characterizations of the optimal solutions of a vector optimization problem
• Revisions of constraint approximations in the successive QP method for nonlinear programming problems
• Title not available (Why is that?)

Cited In (5)

• Multi-objective optimization over convex disjunctive feasible sets using reference points
• Title not available (Why is that?)
• 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)