Academic Journal

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
Περιγραφή
Η περιγραφή δεν είναι διαθέσιμη