Use of exact penalty functions to determine efficient decisions
From MaRDI portal
Publication:2638947
DOI10.1016/0377-2217(90)90405-ZzbMath0717.90066OpenAlexW2074231667MaRDI QIDQ2638947
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
vector optimizationexact penalty functionsnonlinear multiple criteria optimizationsuccessive quadratic programming methods
Related Items (4)
The exponential penalty function method for multiobjective programming problems ⋮ Vector optimization and generalized Lagrangian duality ⋮ Retrieval and use of the balance set in multiobjective global optimization ⋮ Multi-objective optimization over convex disjunctive feasible sets using reference points
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some characterizations of the optimal solutions of a vector optimization problem
- On the completeness and constructiveness of parametric characterizations to vector optimization problems
- A globally convergent method for nonlinear programming
- Goal programming and multiple objective optimizations. Part I
- A survey of multicriteria optimization or the vector maximum problem. I: 1776-1960
- Optimale Entscheidung bei mehrfacher Zielsetzung
- Scalarization in vector optimization
- Revisions of constraint approximations in the successive QP method for nonlinear programming problems
- Exact penalty functions in nonlinear programming
- A model algorithm for composite nondifferentiable optimization problems
- An Exact Potential Method for Constrained Maxima
This page was built for publication: Use of exact penalty functions to determine efficient decisions