miun.sePublikasjoner
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
A Fast Bilinear Optimization Algorithm
Mittuniversitetet, Fakulteten för naturvetenskap, teknik och medier, Institutionen för informationsteknologi och medier. (FSCN - Fibre Science and Communication Network)
Mittuniversitetet, Fakulteten för naturvetenskap, teknik och medier, Institutionen för informationsteknologi och medier.ORCID-id: 0000-0002-0665-1889
2004 (engelsk)Inngår i: Proceedings of the Third International Conference on Nonlinear Analysis and Convex Analysis 2003 (NACA 2003), Yokohama: Yokohama Publishers , 2004Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

Computational decision analysis methods (such as DELTA) have been developed and implemented over a number of years for solving decision problems when vague and numerically imprecise information prevails. However, the evaluation phases in those methods often give rise to bilinear programming problems, which are time-consuming to solve in an interactive environment with general nonlinear programming solvers such as SNOPT. This paper proposes a linear programming based algorithm for solving this type of problems, thus enabling interactive use of such methods.

sted, utgiver, år, opplag, sider
Yokohama: Yokohama Publishers , 2004.
Emneord [en]
linear program, bilinear program, interval probability, utility theory, decision analysis
HSV kategori
Identifikatorer
URN: urn:nbn:se:miun:diva-1707Lokal ID: 356ISBN: 4-946552-15-4 (tryckt)OAI: oai:DiVA.org:miun-1707DiVA, id: diva2:26739
Tilgjengelig fra: 2008-09-30 Laget: 2008-09-30 Sist oppdatert: 2018-01-12bibliografisk kontrollert
Inngår i avhandling
1. Bilinear optimization in computational decision analysis
Åpne denne publikasjonen i ny fane eller vindu >>Bilinear optimization in computational decision analysis
2005 (engelsk)Doktoravhandling, med artikler (Annet vitenskapelig)
Abstract [en]

In real-life decision analysis, significant recognition has been given to theunrealistic expectation of numerically precise information. Many modernapproaches attempting to handle imprecision have focused more on representationand less on evaluation. The DELTA method, as one of the fewleading approaches, challenges this issue by its evaluation framework thatcan accommodate both precision and imprecision. However, computationally,DELTA and similar approaches may incur time-consuming calculationsdue to the introduction of imprecise information concerning probability andutility. In general, those problems are bounded non-convex bilinear optimizationprograms with disjoint linear constraints, which cannot be solvedeffectively by any existing general-purpose global optimization technique.This thesis presents two enhanced cutting plane algorithms for solvingbounded disjoint bilinear programs arising in computational decision analysis.Each algorithm consists of a local phase designed to determine a localoptimizer from an approximate solution, and a global phase designed to systematicallyexplore the feasible region, subset by subset. These two phasesare switched automatically during the global search procedure. The basicframework builds upon previously developed efficient cutting plane methods.By embedding the lower bounding technique in a branch and bound procedure,the improvement of their performances seems encouraging in the lightof computational experience. Even though the motivation to develop thesealgorithms stems from computational decision analysis, the idea can also beextended to the development of optimization approaches for handling generalbounded disjoint bilinear programs, especially for larger sized ones.

sted, utgiver, år, opplag, sider
Sundsvall: Mittuniversitetet, 2005
Serie
Mid Sweden University doctoral thesis, ISSN 1652-893X ; 2
HSV kategori
Identifikatorer
urn:nbn:se:miun:diva-8856 (URN)
Disputas
2005-05-27, O102, Åkroken, Sundsvall, 13:15 (engelsk)
Opponent
Veileder
Tilgjengelig fra: 2009-05-06 Laget: 2009-05-06 Sist oppdatert: 2018-01-13bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Personposter BETA

Ding, XiaosongEkenberg, Love

Søk i DiVA

Av forfatter/redaktør
Ding, XiaosongEkenberg, Love
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric

isbn
urn-nbn
Totalt: 169 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf