Results 11 to 20 of about 750,593 (188)
Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Isomorphism Problem [PDF]
, 2018 The ellipsoid method is an algorithm that solves the (weak) feasibility and linear optimization problems for convex sets by making oracle calls to their (weak) separation problem.
Atserias, Albert, Ochremiak, Joanna
core +5 more sources
An Equivalent Linear Programming Form of General Linear Fractional Programming: A Duality Approach
Mathematics, 2021 Linear fractional programming has been an important planning tool for the past four decades. The main contribution of this study is to show, under some assumptions, for a linear programming problem, that there are two different dual problems (one linear ...
Mehdi Toloo
doaj +1 more source
A New Method for Solving Quadratic Fractional Programing Problems
Tikrit Journal of Pure Science, 2021 In this article, the given algorithms were expanded and a methodology was developed to solve an objective function of a quadratic fractional programming problem (QFPP) with linear constraints. A new method called RBM was introduced to directly solve the
Mediya B. Mrakhan +4 more
doaj +1 more source
Majalah Ilmiah Matematika dan Statistika, 2022 Linear fractional programming is a special case of non-linear programming with an objective function consisting of the ratio of two linear functions. The problem can be solved using the Dinkelbach algorithm and the Charnes Cooper transformation.
Muhammad Wakhid Musthofa +1 more
doaj +1 more source
Neutrosophic Linear Programming Problem
Mathematical Sciences Letters, 2017 Smarandache presented neutrosophic theory as a tool for handling undetermined information. Wang et al. introduced a single valued neutrosophic set that is a special neutrosophic sets and can be used expediently to deal with real-world problems, especially in decision support.
Abdel-Nasser Hussian +3 more
openaire +1 more source
An Accelerating Algorithm for Linear Multiplicative Programming Problem
IEEE Access, 2020 By reformulating the linear multiplicative programming problem (LMP) as an equivalent nonconvex programming problem (EP), we present a new accelerating outcome space branch-and-bound algorithm for globally solving the problem (LMP).
Shuai Tang, Zhisong Hou, Longquan Yong
doaj +1 more source
Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem [PDF]
, 2011 In this paper, we study linear programming based approaches to the maximum matching problem in the semi-streaming model. The semi-streaming model has gained attention as a model for processing massive graphs as the importance of such graphs has increased.
A. McGregor +13 more
core +4 more sources
A MOLFP Method for Solving Linear Fractional Programming Under Fuzzy Environment [PDF]
International Journal of Research in Industrial Engineering, 2017 In this paper, a solution procedure is proposed to solve Fully Fuzzy Linear Fractional Programming (FFLFP) problem where all the variables and parameters are triangular fuzzy numbers.
S.K. Das, T. Mandal
doaj +1 more source
A nonlinear approach for neutrosophic linear programming
Journal of Applied Research on Industrial Engineering, 2019 Traditional linearl programming usually handles optimization problems involving deterministic objective functions and/or constrained functions. However, uncertainty also exists in real problems.
Seyed Ahmad Edalatpanah
doaj +1 more source
Solving a Fully Fuzzy Linear Programming Problem through Compromise Programming
Journal of Applied Mathematics, 2013 In the current literatures, there are several models of fully fuzzy linear programming (FFLP) problems where all the parameters and variables were fuzzy numbers but the constraints were crisp equality or inequality.
Haifang Cheng, Weilai Huang, Jianhu Cai
doaj +1 more source