Reformulation of general chance constrained problems using the penalty functions
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
In: Stochastic Programming E-Print Series, 2
- Ereignis
-
Veröffentlichung
- (wo)
-
Berlin
- (wer)
-
Humboldt-Universität zu Berlin
- (wann)
-
2010
- Urheber
-
Branda, Martin
- DOI
-
10.18452/8409
- URN
-
urn:nbn:de:kobv:11-100112743
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 11:00 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Branda, Martin
- Humboldt-Universität zu Berlin
Entstanden
- 2010
Ähnliche Objekte (12)
Convergent Inexact Penalty Decomposition Methods for Cardinality-Constrained Problems
Optimal Control Problem with Regular Mixed Constraints via Penalty Functions
A Class of Exponential Penalty Functions
On two-stage convex chance constrained problems
Ambiguous chance constrained problems and robust optimization
A co-evolutionary algorithm with adaptive penalty function for constrained optimization
Gradient-type penalty method with inertial effects for solving constrained convex optimization problems with smooth data
Uncertain chance-constrained programming model for project scheduling problem
Genetic algorithm based technique for solving chance constrained problems
Smoothing of the lower-order exact penalty function for inequality constrained optimization
Smoothing approximation to the lower order exact penalty function for inequality constrained optimization
Evaluation of penalty functions for semi-global matching cost aggregation
Convergent Inexact Penalty Decomposition Methods for Cardinality-Constrained Problems
Optimal Control Problem with Regular Mixed Constraints via Penalty Functions
A Class of Exponential Penalty Functions
On two-stage convex chance constrained problems
Ambiguous chance constrained problems and robust optimization
A co-evolutionary algorithm with adaptive penalty function for constrained optimization
Gradient-type penalty method with inertial effects for solving constrained convex optimization problems with smooth data
Uncertain chance-constrained programming model for project scheduling problem
Genetic algorithm based technique for solving chance constrained problems
Smoothing of the lower-order exact penalty function for inequality constrained optimization
Smoothing approximation to the lower order exact penalty function for inequality constrained optimization
Evaluation of penalty functions for semi-global matching cost aggregation
Convergent Inexact Penalty Decomposition Methods for Cardinality-Constrained Problems
Optimal Control Problem with Regular Mixed Constraints via Penalty Functions
A Class of Exponential Penalty Functions
On two-stage convex chance constrained problems
Ambiguous chance constrained problems and robust optimization
A co-evolutionary algorithm with adaptive penalty function for constrained optimization
Gradient-type penalty method with inertial effects for solving constrained convex optimization problems with smooth data
Uncertain chance-constrained programming model for project scheduling problem
Genetic algorithm based technique for solving chance constrained problems
Smoothing of the lower-order exact penalty function for inequality constrained optimization
Smoothing approximation to the lower order exact penalty function for inequality constrained optimization