Open AccessModified Stojkovic-Stanimirovic method to find redundant constrains in linear programming problems
Author(s) -
Yully Estiningsih,
Farikhin,
R. Heru Tjahjana
Publication year - 2019
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1321/2/022074
Subject(s) - linear programming , linear fractional programming , mathematical optimization , feasible region , linear inequality , computer science , constraint (computer aided design) , constraint programming , active set method , set (abstract data type) , redundancy (engineering) , algorithm , mathematics , nonlinear programming , stochastic programming , inequality , nonlinear system , mathematical analysis , physics , geometry , operating system , quantum mechanics , programming language
Important techniques in linear programming are modeling and solving practical optimization. A redundant constraint is a constraint that can be remove from a system of linear constraints without changing the feasible region. Method for identifying redundant constraints which in the process only uses the objective function and inequality constraints, i.e., Stojkovic-Stanimirovic method. In this paper we give a modified method of Stojkovic-Stanimirovic method to detect redundant constraints in linear programming problems. The advantages of employing the propose method is still to use the different objective function on linear programming associated the same feasible set have the same result. To clarify these method is given an example cannot be solve using detect Stojkovic-Stanimirovic method but can be solve using propose method.