Search · four archives
Search · four archives
14 papers · ranked by Valyu relevance
Ahmad Abdi, Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel
A rational number is dyadic if it has a finite binary representation $p/2^k$, where p is an integer and k is a nonnegative integer. Dyadic rationals are important for numerical computations because they have an exact representation in floating-point arithmetic on a computer. A vector is dyadic if all its entries are…
Oliver Serang, Jérémie Bourdon
Linear programming (LP) problems are commonly used in analysis and resource allocation, frequently surfacing as approximations to more difficult problems. Existing approaches to LP have been dominated by a small group of methods, and randomized algorithms have not enjoyed popularity in practice. This paper introduces a…
Charalampos P. Triantafyllidis, Nikolaos Samaras, Sándor Szénási
This paper presents a new simplex-type algorithm for Linear Programming with the following two main characteristics: (i) the algorithm computes basic solutions which are neither primal or dual feasible, nor monotonically improving and (ii) the sequence of these basic solutions is connected with a sequence of…
Marcel-Ioan Boloș, Ioana-Alexandra Bradea, Camelia Delcea
This paper studies the problem of tangible assets acquisition within the company by proposing a new hybrid model that uses linear programming and fuzzy numbers. Regarding linear programming, two methods were implemented in the model, namely: the graphical method and the primal simplex algorithm. This hybrid model is…
Alexandr Parlesak, Inge Tetens, Jørgen Dejgård Jensen, Sinne Smed + 5 more
Nutritional adequacy, health-promoting, NCD-preventing properties, and cultural acceptability are all constraints that need to be addressed and LP is a method that can help solve this complex task. When designing low cost national food baskets their feasibility and implementation has to be investigated via intervention…
Syed Inayatullah, Nasir Touheed, Muhammad Imtiaz, Cheng-Yi Xia
This paper proposes a streamlined form of simplex method which provides some great benefits over traditional simplex method. For instance, it does not need any kind of artificial variables or artificial constraints; it could start with any feasible or infeasible basis of an LP. This method follows the same pivoting…
Radoslaw Ryńca, Yasmin Ziaeian, Claudia Noemi González Brambila
In the past few decades, any type of organization, from factories to government organizations, the banking sector, or educational institutions concentrates on increasing profit margins. To achieve this, one of the key factors is to achieve maximum output with minimum resources (input). Therefore, having an optimal plan…
Peiping Shen, Tongli Zhang, Chunfeng Wang
This article presents a new approximation algorithm for globally solving a class of generalized fractional programming problems (P) whose objective functions are defined as an appropriate composition of ratios of affine functions. To solve this problem, the algorithm solves an equivalent optimization problem (Q) via an…
Jan Schröder, Yair Censor, Philipp Süss, Karl-Heinz Küfer
Given a family of linear constraints and a linear objective function one can consider whether to apply a Linear Programming (LP) algorithm or use a Linear Superiorization (LinSup) algorithm on this data. In the LP methodology one aims at finding a point that fulfills the constraints and has the minimal value of the…
Hendrik Schawe, Roman Bleim, Alexander K. Hartmann, Andrea Gambassi
Here we study linear programming applied to the random K-SAT problem, a fundamental problem in computational complexity. The K-SAT problem is to decide whether a Boolean formula with N variables and structured as a conjunction of M clauses, each being a disjunction of K variables or their negations is satisfiable or…
Gonzalo Guillén-Gosálbez, Albert Sorribas
Background Optimization methods allow designing changes in a system so that specific goals are attained. These techniques are fundamental for metabolic engineering. However, they are not directly applicable for investigating the evolution of metabolic adaptation to environmental changes. Although biological systems…
Lei Wang, Min Fang
In this paper, we consider the multiobjective linear programs where coefficients in the objective function belong to uncertainty sets. We introduce the concept of robust efficient solutions to uncertain multiobjective linear programming problems. By using two scalarization methods, the weighted sum method and the…
Gennadiy Averkov, Matthias Schymura
For a set X of integer points in a polyhedron, the smallest number of facets of any polyhedron whose set of integer points coincides with X is called the relaxation complexity ${{\,\mathrm{rc}\,}}X$. This parameter, introduced by Kaibel & Weltge (2015), captures the complexity of linear descriptions of X without using…
Hamiden Abd El- Wahed Khalifa, Dragan Pamucar, Amina Hadj Kacem, W. A. Afifi
'W. A. Afifi'] Rough set theory, presented by Pawlak in 1981, is one of the most well-known methods for communicating ambiguity by estimating an item based on some knowledge rather than membership. The concept of a rough function and its convexity and differentiability in regard to its boundary region are discussed in…