A Geometric Approach to Integer Optimization and Its Application for Reachability Analysis in Petri Nets
Integer programming plays an important role in operations research and has a wide range of applications in various fields. There are a lot of research directions in the area of integer programming. In this thesis, two main topics will be investigated in details. One is to find the optimal binary sol...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Dissertation |
| Sprache: | Englisch |
| Veröffentlicht: |
ProQuest Dissertations & Theses
01.01.2009
|
| Schlagworte: | |
| ISBN: | 9781124960104, 1124960104 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Integer programming plays an important role in operations research and has a wide range of applications in various fields. There are a lot of research directions in the area of integer programming. In this thesis, two main topics will be investigated in details. One is to find the optimal binary solution to a quadratic object function, and the other is to find integer solutions to linear equations. Finding the optimal binary solution to a quadratic object function is known as the Binary Quadratic Programming problem (BQP), which has been studied extensively in the last three decades. In this thesis, by investigating geometric features of the ellipse contour of a concave quadratic function, we derive new upper and lower bounding methods for BQP. Integrating these new bounding schemes into a proposed solution algorithm of a branch-and-bound type, we propose an exact solution method in solving general BQP with promising preliminary computational results. Meanwhile, by investigating some special structures of the second order matrix and linear term in BQP, several polynomial time algorithms are discussed to solve some special cases of BQP. In the realm of integer programming, finding integer solutions to linear equations is another important research direction. The problem is proved to be NP-Complete, and several algorithms have been proposed such as the algorithm based on linear Diophantine equations as well as the method based on Groebner bases. Unlike the traditional algorithms, the new efficient method we propose in this thesis is based on our results on zero duality gap and the cell enumeration of an arrangement of hyperplanes in discrete geometry. Finding integer solutions to linear equations has various real world applications. In the thesis, we investigate its application to the reachability analysis of Petri nets. Introduced by Petri in 1962, Petri net has been a powerful mathematical formalism for modeling, analyzing and designing discrete event systems. In the research community of Petri nets, finding a feasible path from the initial state to the target state in Petri net, known as reachability analysis, is probably one of the most important and challenging subjects. The reachability algebraic analysis is equivalent to finding the nonnegative integer solutions to a fundamental equation constructed from the Petri net. We apply our algorithm in this thesis to reachability analysis of Petri net by finding the nonnegative integer solutions to the fundamental equation. |
|---|---|
| AbstractList | Integer programming plays an important role in operations research and has a wide range of applications in various fields. There are a lot of research directions in the area of integer programming. In this thesis, two main topics will be investigated in details. One is to find the optimal binary solution to a quadratic object function, and the other is to find integer solutions to linear equations. Finding the optimal binary solution to a quadratic object function is known as the Binary Quadratic Programming problem (BQP), which has been studied extensively in the last three decades. In this thesis, by investigating geometric features of the ellipse contour of a concave quadratic function, we derive new upper and lower bounding methods for BQP. Integrating these new bounding schemes into a proposed solution algorithm of a branch-and-bound type, we propose an exact solution method in solving general BQP with promising preliminary computational results. Meanwhile, by investigating some special structures of the second order matrix and linear term in BQP, several polynomial time algorithms are discussed to solve some special cases of BQP. In the realm of integer programming, finding integer solutions to linear equations is another important research direction. The problem is proved to be NP-Complete, and several algorithms have been proposed such as the algorithm based on linear Diophantine equations as well as the method based on Groebner bases. Unlike the traditional algorithms, the new efficient method we propose in this thesis is based on our results on zero duality gap and the cell enumeration of an arrangement of hyperplanes in discrete geometry. Finding integer solutions to linear equations has various real world applications. In the thesis, we investigate its application to the reachability analysis of Petri nets. Introduced by Petri in 1962, Petri net has been a powerful mathematical formalism for modeling, analyzing and designing discrete event systems. In the research community of Petri nets, finding a feasible path from the initial state to the target state in Petri net, known as reachability analysis, is probably one of the most important and challenging subjects. The reachability algebraic analysis is equivalent to finding the nonnegative integer solutions to a fundamental equation constructed from the Petri net. We apply our algorithm in this thesis to reachability analysis of Petri net by finding the nonnegative integer solutions to the fundamental equation. |
| Author | Gu, Shenshen |
| Author_xml | – sequence: 1 givenname: Shenshen surname: Gu fullname: Gu, Shenshen |
| BookMark | eNotUN9LwzAYDKigzv4PH74X8qtt8liGzsJwInsfSZrYSJfUJnuYf70d8-k7jrvj7ntEtyEGe4MK2QhCKJc1JpjfoyIlrzHGkjHM6QMaWtjYeLR59gbaaZqjMgPkCF3I9svOsJuyP_pflX0MoEIPXU4X4ejNlXNxhk-7uJT2o89naIMaz8kn8AE-LsHwbnN6QndOjckW_3eF9q8v-_Vbud1tunW7LQcuZSmdMLQnVCnMa661IFI70veudpibijaauVpziuWCHZamUg0XVLKqIlpjxlbo-Rq7LPk52ZQP3_E0L43SQcimEmJ5BfsDmqVVEA |
| ContentType | Dissertation |
| Copyright | Database copyright ProQuest LLC; ProQuest does not claim copyright in the individual underlying works. |
| Copyright_xml | – notice: Database copyright ProQuest LLC; ProQuest does not claim copyright in the individual underlying works. |
| DBID | 053 0BH 0FJ CBPLH EU9 G20 M8- PHGZT PKEHL PQEST PQQKQ PQUKI |
| DatabaseName | Dissertations & Theses Europe Full Text: Science & Technology ProQuest Dissertations and Theses Professional Dissertations & Theses @ Chinese University of Hong Kong ProQuest Dissertations & Theses Global: The Sciences and Engineering Collection ProQuest Dissertations & Theses A&I ProQuest Dissertations & Theses Global ProQuest Dissertations and Theses A&I: The Sciences and Engineering Collection ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Academic (retired) ProQuest One Academic UKI Edition |
| DatabaseTitle | Dissertations & Theses Europe Full Text: Science & Technology ProQuest One Academic Middle East (New) ProQuest One Academic UKI Edition ProQuest One Academic Eastern Edition ProQuest Dissertations & Theses Global: The Sciences and Engineering Collection ProQuest Dissertations and Theses Professional ProQuest One Academic ProQuest Dissertations & Theses A&I Dissertations & Theses @ Chinese University of Hong Kong ProQuest One Academic (New) ProQuest Dissertations and Theses A&I: The Sciences and Engineering Collection ProQuest Dissertations & Theses Global |
| DatabaseTitleList | Dissertations & Theses Europe Full Text: Science & Technology |
| Database_xml | – sequence: 1 dbid: G20 name: ProQuest Dissertations & Theses Global url: https://www.proquest.com/pqdtglobal1 sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| ExternalDocumentID | 2483181551 |
| Genre | Dissertation/Thesis |
| GroupedDBID | 053 0BH 0FJ 8R4 8R5 CBPLH EU9 G20 M8- PHGZT PKEHL PQEST PQQKQ PQUKI Q2X |
| ID | FETCH-LOGICAL-h499-9f8c2d12aa0464bb819bf1ddf6f04c527b3f6b4209527f09c5a748293551bb033 |
| IEDL.DBID | G20 |
| ISBN | 9781124960104 1124960104 |
| IngestDate | Tue Sep 16 14:21:46 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-h499-9f8c2d12aa0464bb819bf1ddf6f04c527b3f6b4209527f09c5a748293551bb033 |
| Notes | SourceType-Dissertations & Theses-1 ObjectType-Dissertation/Thesis-1 content type line 12 |
| PQID | 897588249 |
| PQPubID | 18750 |
| ParticipantIDs | proquest_journals_897588249 |
| PublicationCentury | 2000 |
| PublicationDate | 20090101 |
| PublicationDateYYYYMMDD | 2009-01-01 |
| PublicationDate_xml | – month: 01 year: 2009 text: 20090101 day: 01 |
| PublicationDecade | 2000 |
| PublicationYear | 2009 |
| Publisher | ProQuest Dissertations & Theses |
| Publisher_xml | – name: ProQuest Dissertations & Theses |
| SSID | ssib000933042 |
| Score | 1.5017917 |
| Snippet | Integer programming plays an important role in operations research and has a wide range of applications in various fields. There are a lot of research... |
| SourceID | proquest |
| SourceType | Aggregation Database |
| SubjectTerms | Operations research |
| Title | A Geometric Approach to Integer Optimization and Its Application for Reachability Analysis in Petri Nets |
| URI | https://www.proquest.com/docview/897588249 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV09T8MwELWgMCAGQICAArqB1SJxnNieUAUUWApCHbpV8RftQAJNQOLfY7tuqYTEwhh5ic7K3bt7l_cQujAO8qsiM1gQIzE1pMAitwy7WqCMK_Alo2Uwm2CDAR-NxFPczWniWuUiJ4ZErWvlZ-SXXDhky12zcPX2jr1plCdXo4PGOtpgXOTBuWEV_Syb9dRbLIfWI6o8LZ9_peBQV_o7_3yjXbR9s8Kn76E1U-2jSQ_uTP3qrbIU9KJmOLQ1-Onfi5nBo0sTr_H_SygrDQ9tA70fJhsckIVnv2Y5F_H-goV0CUwrCB5cMDBtc4CG_dvh9T2Ohgp4Qr0Qp-WK6JSUpeczpXRgQNpUa1vYhKqcMJnZQlLiUBdhNhEqdzfFiVdgT6VMsuwQdaq6MkcIuKWpLh2csd6vxEVal4Ib6rBQ4bIrS45RdxGzcfwomvEyYCd_nnbR1pyy8XOOU9RpZx_mDG2qz3bazM7DFX8Drsmv5g |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V07T8MwELYqQAIxAAIElMcNMEYkrpvHgFBF6UMtAaEO3aLYsWmHJtAEUP8TP5JzmpRKSGwdGCMvic-5--7h7yPkUiLkF3ZNGh6V3GCS2oZXV46BsUBIDPChw8JcbMLxfXc49J4q5Ku8C6PHKkufmDvqKBG6Rn7teohsXUwWbl_fDC0apZurpYLG_FT05OwTM7b0pttE815R2rof3HWMQlTAGDFNRqlcQSOLhqHu6XGOAZErK4qUrUwm6tThNWVzRhF5UEeZnqjj27pUs5BbnJu6_IkOf53VHEsPELaXwdaiNmBpRec80ylIpRbPvzx-HsZaO_9rA3bJdnNpWmCPVGS8T0YNaMtkooXABDQKRnTIEtC1zRc5hUd0gpPidimEcQTdLIXGT58eEKbDsx4inVOUz6AkZoFxDLnCGPgySw_IYBUfdkjW4iSWRwRcxawoRLCmtBoLGjYKPVcyRHo2xg7HPCbV0kRB8cunwcI-J3-uXpDNzuChH_S7fq9KtubNKV3ROSVr2fRdnpEN8ZGN0-l5frqABCs25jeqVQoY |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adissertation&rft.genre=dissertation&rft.title=A+Geometric+Approach+to+Integer+Optimization+and+Its+Application+for+Reachability+Analysis+in+Petri+Nets&rft.DBID=053%3B0BH%3B0FJ%3BCBPLH%3BEU9%3BG20%3BM8-%3BPHGZT%3BPKEHL%3BPQEST%3BPQQKQ%3BPQUKI&rft.PQPubID=18750&rft.au=Gu%2C+Shenshen&rft.date=2009-01-01&rft.pub=ProQuest+Dissertations+%26+Theses&rft.isbn=9781124960104&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=2483181551 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781124960104/lc.gif&client=summon&freeimage=true |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781124960104/mc.gif&client=summon&freeimage=true |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781124960104/sc.gif&client=summon&freeimage=true |