A new solution to optimization-satisfaction problems by a penalty method
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3159112 (Why is no real title available?)
- scientific article; zbMATH DE number 3562783 (Why is no real title available?)
- scientific article; zbMATH DE number 3402374 (Why is no real title available?)
- An exponential penalty method for nondifferentiable minimax problems with general constraints
- An outer approximations algorithm for computer-aided design problems
- Defense Applications of Mathematical Programs with Optimization Problems in the Constraints
- Infinitely constrained optimization problems
- Necessary and Sufficient Optimality Conditions for the Fritz John Problem with Linear Equality Constraints
- Necessary conditions for min-max problems and algorithms by a relaxation procedure
- On the Stackelberg strategy in nonzero-sum games
- Point-to-Set Maps in Mathematical Programming
- Production and marketing decisions with multiple objectives in a competitive environment
This page was built for publication: A new solution to optimization-satisfaction problems by a penalty method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1156353)