Academic Journal
Προβολή σε EDS

Solution to the single parametric linear programming problems via simplex-based algorithms: handling the uncertainties in costs, left or right-hand sides

Λεπτομέρειες βιβλιογραφικής εγγραφής
Τίτλος: Solution to the single parametric linear programming problems via simplex-based algorithms: handling the uncertainties in costs, left or right-hand sides
Συγγραφείς: Temelcan Ergenecosar, Gizem, Gonce Kocken, Hale, Albayrak, Inci, Sivri, Mustafa
Πηγή: Croatian Operational Research Review; Vol. 17 No. 1 (2026): CRORR; 29-40 ; 1848-9931 ; 1848-0225
Στοιχεία εκδότη: Croatian Operational Research Society (CRORS)
Έτος έκδοσης: 2026
Συλλογή: University of Zagreb (SRCE): OJS / Sveučilišni računski centar Sveučilišta u Zagrebu
Περιγραφή: Parametric programming is one of the notable approaches to expressing the uncertainties encountered in real life. Many studies express the parameters of the objective function and right-hand side parametrically, but only a few include the parametric coefficient matrix of the constraints. This paper examines the feasibility and optimality conditions of the simplex table and proposes a simplex-based algorithm (dual-simplex, generalized-simplex, or primal-simplex). In the solution process, each case is considered independently through the mathematical analysis of simplex multipliers. Distinct numerical examples illustrate each case to demonstrate the algorithm's implementation.
Τύπος εγγράφου: article in journal/newspaper
Περιγραφή αρχείου: application/pdf
Γλώσσα: English
Relation: https://ojs.srce.hr/crorr/article/view/32930/17711; https://ojs.srce.hr/crorr/article/view/32930
Διαθεσιμότητα: https://ojs.srce.hr/crorr/article/view/32930
Rights: Copyright (c) 2025 Croatian Operational Research Review
Αριθμός Καταχώρησης: edsbas.F6BDCEBC
Βάση Δεδομένων: BASE
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://ojs.srce.hr/crorr/article/view/32930#
    Name: EDS - BASE (ns324271)
    Category: fullText
    Text: View record from BASE
Header DbId: edsbas
DbLabel: BASE
An: edsbas.F6BDCEBC
RelevancyScore: 1011
AccessLevel: 3
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 1010.63568115234
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Solution to the single parametric linear programming problems via simplex-based algorithms: handling the uncertainties in costs, left or right-hand sides
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Temelcan+Ergenecosar%2C+Gizem%22">Temelcan Ergenecosar, Gizem</searchLink><br /><searchLink fieldCode="AR" term="%22Gonce+Kocken%2C+Hale%22">Gonce Kocken, Hale</searchLink><br /><searchLink fieldCode="AR" term="%22Albayrak%2C+Inci%22">Albayrak, Inci</searchLink><br /><searchLink fieldCode="AR" term="%22Sivri%2C+Mustafa%22">Sivri, Mustafa</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: Croatian Operational Research Review; Vol. 17 No. 1 (2026): CRORR; 29-40 ; 1848-9931 ; 1848-0225
– Name: Publisher
  Label: Publisher Information
  Group: PubInfo
  Data: Croatian Operational Research Society (CRORS)
– Name: DatePubCY
  Label: Publication Year
  Group: Date
  Data: 2026
– Name: Subset
  Label: Collection
  Group: HoldingsInfo
  Data: University of Zagreb (SRCE): OJS / Sveučilišni računski centar Sveučilišta u Zagrebu
– Name: Abstract
  Label: Description
  Group: Ab
  Data: Parametric programming is one of the notable approaches to expressing the uncertainties encountered in real life. Many studies express the parameters of the objective function and right-hand side parametrically, but only a few include the parametric coefficient matrix of the constraints. This paper examines the feasibility and optimality conditions of the simplex table and proposes a simplex-based algorithm (dual-simplex, generalized-simplex, or primal-simplex). In the solution process, each case is considered independently through the mathematical analysis of simplex multipliers. Distinct numerical examples illustrate each case to demonstrate the algorithm's implementation.
– Name: TypeDocument
  Label: Document Type
  Group: TypDoc
  Data: article in journal/newspaper
– Name: Format
  Label: File Description
  Group: SrcInfo
  Data: application/pdf
– Name: Language
  Label: Language
  Group: Lang
  Data: English
– Name: NoteTitleSource
  Label: Relation
  Group: SrcInfo
  Data: https://ojs.srce.hr/crorr/article/view/32930/17711; https://ojs.srce.hr/crorr/article/view/32930
– Name: URL
  Label: Availability
  Group: URL
  Data: https://ojs.srce.hr/crorr/article/view/32930
– Name: Copyright
  Label: Rights
  Group: Cpyrght
  Data: Copyright (c) 2025 Croatian Operational Research Review
– Name: AN
  Label: Accession Number
  Group: ID
  Data: edsbas.F6BDCEBC
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsbas&AN=edsbas.F6BDCEBC
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Text: English
    Titles:
      – TitleFull: Solution to the single parametric linear programming problems via simplex-based algorithms: handling the uncertainties in costs, left or right-hand sides
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Temelcan Ergenecosar, Gizem
      – PersonEntity:
          Name:
            NameFull: Gonce Kocken, Hale
      – PersonEntity:
          Name:
            NameFull: Albayrak, Inci
      – PersonEntity:
          Name:
            NameFull: Sivri, Mustafa
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2026
          Identifiers:
            – Type: issn-locals
              Value: edsbas
            – Type: issn-locals
              Value: edsbas.oa
          Titles:
            – TitleFull: Croatian Operational Research Review; Vol. 17 No. 1 (2026): CRORR; 29-40
              Type: main
ResultId 1