Evolutionary algorithms for constrained optimization problems:
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Aachen
Shaker
2000
|
| Series: | Informatik
|
| Subjects: | |
| Online Access: | Inhaltsverzeichnis |
| Item Description: | Zugl.: Clausthal, Techn. Univ., Diss., 1999 |
| Physical Description: | VI, 251 S. graph. Darst. : 21 cm |
| ISBN: | 3826577833 |
Staff View
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV013337651 | ||
| 003 | DE-604 | ||
| 005 | 20030317 | ||
| 007 | t | ||
| 008 | 000905s2000 gw d||| m||| 00||| eng d | ||
| 016 | 7 | |a 959658874 |2 DE-101 | |
| 020 | |a 3826577833 |9 3-8265-7783-3 | ||
| 035 | |a (OCoLC)50052008 | ||
| 035 | |a (DE-599)BVBBV013337651 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-703 | ||
| 050 | 0 | |a F212 | |
| 100 | 1 | |a Gottlieb, Jens |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Evolutionary algorithms for constrained optimization problems |c Jens Gottlieb |
| 264 | 1 | |a Aachen |b Shaker |c 2000 | |
| 300 | |a VI, 251 S. |b graph. Darst. : 21 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Informatik | |
| 500 | |a Zugl.: Clausthal, Techn. Univ., Diss., 1999 | ||
| 650 | 4 | |a Geschichte | |
| 650 | 4 | |a Indianer | |
| 650 | 4 | |a Indians of North America |x Commerce |z Southern States | |
| 650 | 4 | |a Indians of North America |x Wars |z Southern States | |
| 650 | 0 | 7 | |a Nebenbedingung |0 (DE-588)4140066-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Optimierung |0 (DE-588)4043664-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Evolutionärer Algorithmus |0 (DE-588)4366912-8 |2 gnd |9 rswk-swf |
| 651 | 4 | |a Southern States |x History |y Colonial period, ca. 1600-1775 | |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Optimierung |0 (DE-588)4043664-0 |D s |
| 689 | 0 | 1 | |a Nebenbedingung |0 (DE-588)4140066-5 |D s |
| 689 | 0 | 2 | |a Evolutionärer Algorithmus |0 (DE-588)4366912-8 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009095673&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-009095673 | |
Record in the Search Index
| _version_ | 1807229338219708416 |
|---|---|
| adam_text |
CONTENTS
1
INTRODUCTION
1
2
CONSTRAINED
PROBLEMS
3
2.1
BASIC
CONCEPTS
.
4
2.2
PROBLEM
TYPES,
EXAMPLES
AND
COMPLEXITY
.
7
2.3
THE
FORMAL
FRAMEWORK
.
12
2.3.1
SEARCH
SPACES
AND
GRAPHS
.
12
2.3.2
THE
STRUCTURE
OF
THE
FEASIBLE
SEARCH
SPACE
.
15
2.3.3
OPTIMALITY
CONCEPTS
AND
THE
BOUNDARY
OF
THE
FEASIBLE
REGION
.
.
21
2.4
COVERING
AND
PACKING
PROBLEMS
.
25
2.4.1
DEFINITION
AND
RESULTS
.
25
2.4.2
HIERARCHIES
OF
COVERING
AND
PACKING
PROBLEMS
.
27
2.4.3
THE
MULTIDIMENSIONAL
KNAPSACK
PROBLEM
.
28
2.4.3.1
SPECIAL
CONCEPTS
AND
PROPERTIES
.
29
2.4.3.2
THE
CLASSICAL
BENCHMARK
SUITE
.
34
2.4.3.3
CHU
'
S
BENCHMARK
SUITE
.
37
2.5
SUMMARY
.
38
3
EVOLUTIONARY
ALGORITHMS
41
3.1
EVOLUTION
AND
PROBLEM
SOLVING
.
41
3.2
INGREDIENTS
OF
EVOLUTIONARY
SEARCH
.
45
3.2.1
THE
GENERAL
FRAMEWORK
.
46
3.2.2
PARENT
SELECTION
.
47
3.2.2.1
SAMPLING
ALGORITHMS
.
48
3.2.2.2
SELECTION
ALGORITHMS
.
49
3.2.3
REPLACEMENT
SCHEMES
.
51
II
CONTENTS
3.2.4
VARIATION
OPERATORS
.
53
3.2.4.1
MUTATION
.
54
3.2.4.2
CROSSOVER
.
54
3.2.5
FITNESS
LANDSCAPES
.
55
3.2.6
EXPLORATION
AND
EXPLOITATION
.
56
3.2.7
DUPLICATE
ELIMINATION
.
58
3.3
DISCUSSION
OF
EVOLUTIONARY
SEARCH
.
60
3.3.1
HISTORY
.
60
3.3.2
THEORETICAL
ISSUES
.
61
3.3.3
THE
RELATION
TO
OTHER
METHODS
.
63
3.4
CONSTRAINT-HANDLING
TECHNIQUES
.
65
3.4.1
CONSTRAINT
SATISFACTION
PROBLEMS
.
66
3.4.1.1
TRANSFORMATION
INTO
FREE
OPTIMIZATION
PROBLEMS
.
67
3.4.1.2
TRANSFORMATION
INTO
CONSTRAINED
OPTIMIZATION
PROBLEMS
.
68
3.4.2
CONSTRAINED
OPTIMIZATION
PROBLEMS
.
68
3.4.2.1
DIRECT
SEARCH
IN
THE
COMPLETE
SEARCH
SPACE
.
69
3.4.2.2
DIRECT
SEARCH
IN
THE
FEASIBLE
SEARCH
SPACE
.
73
3.4.2.3
INDIRECT
SEARCH
IN
THE
FEASIBLE
SEARCH
SPACE
.
77
3.5
SUMMARY
.
81
4
DIRECT
SEARCH
IN
THE
COMPLETE
SEARCH
SPACE
83
4.1
THE
FEASIBILITY
PROBLEM
.
84
4.1.1
PENALTY
FUNCTIONS
.
84
4.1.1.1
THE
DOMINANCE
OF
FEASIBLE
SOLUTIONS
.
84
4.1.1.2
THE
NUMBER
OF
VIOLATED
CONSTRAINTS
.
85
4.1.1.3
THE
AMOUNT
OF
CONSTRAINT
VIOLATION
.
86
4.1.2
THE
EFFECTS
OF
THE
INITIALIZATION
PROCEDURE
.
87
4.1.2.1
THE
AVERAGE
HAMMING
WEIGHT
DYNAMICS
.
88
4.1.2.2
BIASING
THE
INITIALIZATION
TOWARDS
FEASIBLE
SOLUTIONS
.
96
4.1.3
THE
PERFORMANCE
OF
THE
FUNCTIONS
PENALTY
1
AND
PENALTY*,
.
99
4.2
THE
BIAS
TOWARDS
THE
BOUNDARY
OF
THE
FEASIBLE
REGION
.
104
4.2.1
EMPIRICAL
ANALYSIS
OF
PENALTIES
BY
FITNESS
SEGMENTS
.
105
4.2.1.1
FITNESS
SEGMENTS
.
105
4.2.1.2
EXAMPLES
FOR
A
MISSING
BIAS
TOWARDS
THE
BOUNDARY
.
.
.
106
III
4.2.1.3
THE
DOMINANCE
OF
FEASIBLE
SOLUTIONS
.
108
4.2.1.4
FITNESS
SEGMENTS
AND
THE
BIAS
TOWARDS
THE
BOUNDARY
.
.
109
4.2.2
FORMAL
ANALYSIS
OF
PENALTIES
BY
MONOTONY
CONCEPTS
.
110
4.2.2.1
MONOTONY
CONCEPTS
AND
THEIR
IMPLICATIONS
.
ILL
4.2.2.2
NEW
PENALTY
FUNCTIONS
AND
THEIR
MONOTONY
PROPERTIES
.
115
4.2.3
THE
PERFORMANCE
OF
THE
FUNCTION
PENALTY
G
.
117
4.3
SUMMARY
.
120
5
DIRECT
SEARCH
IN
THE
FEASIBLE
SEARCH
SPACE
123
5.1
INITIALIZATION
.
123
5.1.1
IMPROVEMENT
OF
INITIALIZATION
ROUTINES
.
124
5.1.2
EMPIRICAL
ANALYSIS
OF
THE
INITIALIZATION
METHODS
.
127
5.1.2.1
STATISTICAL
MEASURES
CHARACTERIZING
THE
INITIAL
POPULATION
128
5.1.2.2
EFFECTS
OF
THE
INITIALIZATION
METHODS
.
129
5.1.2.3
EFFECTS
OF
THE
PROBLEM
STRUCTURE
.
132
5.2
REPAIRING
AND
LOCAL
OPTIMIZATION
.
133
5.2.1
COMPLEXITY
OF
REPAIR
PROBLEMS
.
134
5.2.2
REPAIR
ALGORITHMS
.
136
5.2.3
COMPLEXITY
OF
LOCAL
OPTIMIZATION
PROBLEMS
.
139
5.2.4
LOCAL
OPTIMIZATION
ALGORITHMS
AND
STRATEGIES
.
143
5.3
EMPIRICAL
ANALYSIS
.
145
5.3.1
DUPLICATE
ELIMINATION
AND
LOCAL
OPTIMIZATION
STRATEGIES
.
145
5.3.2
INITIALIZATION
METHODS
AND
ORDERING
HEURISTICS
.
149
5.3.3
RESULTS
FOR
CHU
'
S
COMPLETE
BENCHMARK
SUITE
.
151
5.4
SUMMARY
.
152
6
INDIRECT
SEARCH
IN
THE
FEASIBLE
SEARCH
SPACE
157
6.1
SOLUTION
REPRESENTATIONS
.
158
6.1.1
THE
PERMUTATION
REPRESENTATION
.
158
6.1.2
THE
ORDINAL
REPRESENTATION
.
160
6.1.3
THE
VARIABLE-LENGTH
REPRESENTATION
.
161
6.1.4
REAL-VALUED
REPRESENTATIONS
.
161
6.1.4.1
THE
RANDOM
KEYS
APPROACH
.
161
6.1.4.2
THE
WEIGHT-CODED
APPROACH
.
162
IV
CONTENTS
6.2
THE
CHOICE
OF
VARIATION
OPERATORS
.
162
6.2.1
PERMUTATION
PROBLEMS
AND
INFORMATION
TYPES
.
163
6.2.1.1
THE
TRAVELING
SALESMAN
PROBLEM
.
163
6.2.1.2
THE
FLOWSHOP
SCHEDULING
PROBLEM
.
165
6.2.1.3
THE
MULTIDIMENSIONAL
KNAPSACK
PROBLEM
.
167
6.2.2
THE
RELEVANCE
OF
INFORMATION
TYPES
.
168
6.2.3
CHARACTERIZING
EXPLORATION
AND
EXPLOITATION
.
170
6.2.3.1
THE
RELATION
BETWEEN
GENOTYPE
AND
FITNESS
.
171
6.2.3.2
THE
EXPLICIT
RELATION
BETWEEN
GENOTYPE
AND
PHENOTYPE
.
172
6.2.3.3
THE
IMPLICIT
RELATION
BETWEEN
GENOTYPE
AND
PHENOTYPE
.
173
6.3
PERMUTATION
OPERATORS
.
175
6.3.1
MUTATION
.
175
6.3.2
CROSSOVER
.
177
6.4
GENERAL
COMPARISON
OF
PERMUTATION
OPERATORS
.
182
6.4.1
MUTATION
.
183
6.4.1.1
POSITION
INFORMATION
.
183
6.4.1.2
ORDER
INFORMATION
.
186
6.4.1.3
ADJACENCY
INFORMATION
.
188
6.4.1.4
SUMMARY
.
191
6.4.2
CROSSOVER
.
191
6.4.2.1
POSITION
INFORMATION
.
192
6.4.2.2
ORDER
INFORMATION
.
196
6.4.2.3
ADJACENCY
INFORMATION
.
198
6.4.2.4
SUMMARY
.
201
6.5
EMPIRICAL
ANALYSIS
OF
THE
PERMUTATION
REPRESENTATION
.
202
6.5.1
CORRELATION
MEASURES
.
202
6.5.2
COMPARISON
OF
THE
OPERATORS
.
205
6.5.2.1
DUPLICATE
ELIMINATION
.
206
6.5.2.2
THE
ROLE
OF
CROSSOVER
.
207
6.5.2.3
CROSSOVER
OPERATORS
.
208
6.5.2.4
CROSSOVER,
EXPLORATION
AND
EXPLOITATION
.
209
6.5.2.5
UNIFORM
ORDER
BASED
CROSSOVER
.
209
6.5.2.6
MUTATION
OPERATORS
.
211
6.5.2.7
THE
BEST
SETUP
.
213
6.6
SUMMARY
.
213
7
COMPARISON
OF
CONSTRAINT-HANDLING
TECHNIQUES
217
8
CONCLUSIONS
225
ABBREVIATIONS
229
LIST
OF
FIGURES
231
LIST
OF
TABLES
235
REFERENCES
237 |
| any_adam_object | 1 |
| author | Gottlieb, Jens |
| author_facet | Gottlieb, Jens |
| author_role | aut |
| author_sort | Gottlieb, Jens |
| author_variant | j g jg |
| building | Verbundindex |
| bvnumber | BV013337651 |
| callnumber-first | F - General American History |
| callnumber-label | F212 |
| callnumber-raw | F212 |
| callnumber-search | F212 |
| callnumber-sort | F 3212 |
| callnumber-subject | F - General American History |
| ctrlnum | (OCoLC)50052008 (DE-599)BVBBV013337651 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV013337651</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20030317</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">000905s2000 gw d||| m||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">959658874</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3826577833</subfield><subfield code="9">3-8265-7783-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)50052008</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV013337651</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">F212</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Gottlieb, Jens</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Evolutionary algorithms for constrained optimization problems</subfield><subfield code="c">Jens Gottlieb</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Aachen</subfield><subfield code="b">Shaker</subfield><subfield code="c">2000</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VI, 251 S.</subfield><subfield code="b">graph. Darst. : 21 cm</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Informatik</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Clausthal, Techn. Univ., Diss., 1999</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Geschichte</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Indianer</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Indians of North America</subfield><subfield code="x">Commerce</subfield><subfield code="z">Southern States</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Indians of North America</subfield><subfield code="x">Wars</subfield><subfield code="z">Southern States</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Nebenbedingung</subfield><subfield code="0">(DE-588)4140066-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Evolutionärer Algorithmus</subfield><subfield code="0">(DE-588)4366912-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="651" ind1=" " ind2="4"><subfield code="a">Southern States</subfield><subfield code="x">History</subfield><subfield code="y">Colonial period, ca. 1600-1775</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Optimierung</subfield><subfield code="0">(DE-588)4043664-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Nebenbedingung</subfield><subfield code="0">(DE-588)4140066-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Evolutionärer Algorithmus</subfield><subfield code="0">(DE-588)4366912-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009095673&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-009095673</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| geographic | Southern States History Colonial period, ca. 1600-1775 |
| geographic_facet | Southern States History Colonial period, ca. 1600-1775 |
| id | DE-604.BV013337651 |
| illustrated | Illustrated |
| indexdate | 2024-08-13T00:16:41Z |
| institution | BVB |
| isbn | 3826577833 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-009095673 |
| oclc_num | 50052008 |
| open_access_boolean | |
| owner | DE-703 |
| owner_facet | DE-703 |
| physical | VI, 251 S. graph. Darst. : 21 cm |
| publishDate | 2000 |
| publishDateSearch | 2000 |
| publishDateSort | 2000 |
| publisher | Shaker |
| record_format | marc |
| series2 | Informatik |
| spelling | Gottlieb, Jens Verfasser aut Evolutionary algorithms for constrained optimization problems Jens Gottlieb Aachen Shaker 2000 VI, 251 S. graph. Darst. : 21 cm txt rdacontent n rdamedia nc rdacarrier Informatik Zugl.: Clausthal, Techn. Univ., Diss., 1999 Geschichte Indianer Indians of North America Commerce Southern States Indians of North America Wars Southern States Nebenbedingung (DE-588)4140066-5 gnd rswk-swf Optimierung (DE-588)4043664-0 gnd rswk-swf Evolutionärer Algorithmus (DE-588)4366912-8 gnd rswk-swf Southern States History Colonial period, ca. 1600-1775 (DE-588)4113937-9 Hochschulschrift gnd-content Optimierung (DE-588)4043664-0 s Nebenbedingung (DE-588)4140066-5 s Evolutionärer Algorithmus (DE-588)4366912-8 s DE-604 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009095673&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Gottlieb, Jens Evolutionary algorithms for constrained optimization problems Geschichte Indianer Indians of North America Commerce Southern States Indians of North America Wars Southern States Nebenbedingung (DE-588)4140066-5 gnd Optimierung (DE-588)4043664-0 gnd Evolutionärer Algorithmus (DE-588)4366912-8 gnd |
| subject_GND | (DE-588)4140066-5 (DE-588)4043664-0 (DE-588)4366912-8 (DE-588)4113937-9 |
| title | Evolutionary algorithms for constrained optimization problems |
| title_auth | Evolutionary algorithms for constrained optimization problems |
| title_exact_search | Evolutionary algorithms for constrained optimization problems |
| title_full | Evolutionary algorithms for constrained optimization problems Jens Gottlieb |
| title_fullStr | Evolutionary algorithms for constrained optimization problems Jens Gottlieb |
| title_full_unstemmed | Evolutionary algorithms for constrained optimization problems Jens Gottlieb |
| title_short | Evolutionary algorithms for constrained optimization problems |
| title_sort | evolutionary algorithms for constrained optimization problems |
| topic | Geschichte Indianer Indians of North America Commerce Southern States Indians of North America Wars Southern States Nebenbedingung (DE-588)4140066-5 gnd Optimierung (DE-588)4043664-0 gnd Evolutionärer Algorithmus (DE-588)4366912-8 gnd |
| topic_facet | Geschichte Indianer Indians of North America Commerce Southern States Indians of North America Wars Southern States Nebenbedingung Optimierung Evolutionärer Algorithmus Southern States History Colonial period, ca. 1600-1775 Hochschulschrift |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009095673&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT gottliebjens evolutionaryalgorithmsforconstrainedoptimizationproblems |