A new solution to optimization-satisfaction problems by a penalty method
DOI10.1016/0005-1098(82)90024-3zbMath0468.49021OpenAlexW2094894328MaRDI QIDQ1156353
Kiyotaka Shimizu, Eitaro Aiyoshi
Publication date: 1982
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0005-1098(82)90024-3
optimizationparametric programmingminimization problemcomputational methodmathematical programmingpenalty methodpenalty function methodcomputer-aided designdecision theory under uncertaintyinfinitely constrained nonlinear programmingoptimization-satisfaction problemssatisfaction approach
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Infinitely constrained optimization problems
- Production and marketing decisions with multiple objectives in a competitive environment
- An exponential penalty method for nondifferentiable minimax problems with general constraints
- An outer approximations algorithm for computer-aided design problems
- On the Stackelberg strategy in nonzero-sum games
- Necessary conditions for min-max problems and algorithms by a relaxation procedure
- Defense Applications of Mathematical Programs with Optimization Problems in the Constraints
- Necessary and Sufficient Optimality Conditions for the Fritz John Problem with Linear Equality Constraints
- Point-to-Set Maps in Mathematical Programming
This page was built for publication: A new solution to optimization-satisfaction problems by a penalty method
