An improved probability bound for the Approximate S-Lemma
| dc.citation.epage | 746 | en_US |
| dc.citation.issueNumber | 6 | en_US |
| dc.citation.spage | 743 | en_US |
| dc.citation.volumeNumber | 35 | en_US |
| dc.contributor.author | Derinkuyu, K. | en_US |
| dc.contributor.author | Pınar, M. Ç. | en_US |
| dc.contributor.author | Camcı, A. | en_US |
| dc.date.accessioned | 2016-02-08T10:12:26Z | |
| dc.date.available | 2016-02-08T10:12:26Z | |
| dc.date.issued | 2007 | en_US |
| dc.department | Department of Industrial Engineering | en_US |
| dc.description.abstract | The purpose of this note is to give a probability bound on symmetric matrices to improve an error bound in the Approximate S-Lemma used in establishing levels of conservatism results for approximate robust counterparts. | en_US |
| dc.description.provenance | Made available in DSpace on 2016-02-08T10:12:26Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2007 | en |
| dc.identifier.doi | 10.1016/j.orl.2007.02.003 | en_US |
| dc.identifier.eissn | 1872-7468 | |
| dc.identifier.issn | 0167-6377 | |
| dc.identifier.uri | http://hdl.handle.net/11693/23340 | |
| dc.language.iso | English | en_US |
| dc.publisher | Elsevier | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1016/j.orl.2007.02.003 | en_US |
| dc.source.title | Operations Research Letters | en_US |
| dc.subject | Robust optimization | en_US |
| dc.subject | S-Lemma | en_US |
| dc.title | An improved probability bound for the Approximate S-Lemma | en_US |
| dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- An_improved_probability_bound_for_the_Approximate_S-Lemma.pdf
- Size:
- 122.42 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version