Results 41 to 50 of about 750,593 (188)
An Application Model for Linear Programming with an Evolutionary Ranking Function
One of the most important methodologies in operations research (OR) is the linear programming problem (LPP). Many real-world problems can be turned into linear programming models (LPM), making this model an essential tool for today's financial, hotel ...
Rasha Jalal Mitlif
doaj +1 more source
Presentation and Solving Non-Linear Quad-Level Programming Problem Utilizing a Heuristic Approach Based on Taylor Theorem [PDF]
The multi-level programming problems are attractive for many researchers because of their application in several areas such as economic, traffic, finance, management, transportation, information technology, engineering and so on.
Eghbal Hosseini
doaj +1 more source
This paper presents a trajectory generation method that optimizes a quadratic cost functional with respect to linear system dynamics and to linear input and state constraints.
Kennel, Ralph, Stumper, Jean-Francois
core +1 more source
Solving P - Norm Intuitionistic Fuzzy Programming Problem [PDF]
In this paper, notion of p - norm generalized trapezoidal intuitionistic fuzzy numbers is introduced. A new ranking method is introduced for p - norm generalized trapezoidal intuitionistic fuzzy numbers.
Aggarwal, Shashi, Gupta, Chavi
core
LP-Based Algorithms for Capacitated Facility Location
Linear programming has played a key role in the study of algorithms for combinatorial optimization problems. In the field of approximation algorithms, this is well illustrated by the uncapacitated facility location problem.
An, Hyung-Chan +2 more
core +1 more source
The Key Solution Algorithm of Linear Programming Model
Linear programming problem is a common problem, and to solve the linear model is more plagued. The paper generating algorithm is based on mathematical theory and composition.
Liu Jun +4 more
doaj +1 more source
A linear fractional bilevel programming problem with multichoice parameters
A bilevel programming problem (BLPP) is a hierarchical optimization problem where the constraint region of the upper level is implicitly determined by the lower level optimization problem.
Ritu Arora, Kavita Gupta
doaj +1 more source
The metric dimension and metric independence of a graph [PDF]
A vertex x of a graph G resolves two vertices u and v of G if the distance from x to u does not equal the distance from x to v. A set S of vertices of G is a resolving set for G if every two distinct vertices of G are resolved by some vertex of S. The
Currie, James, Oellerman, Ortrud R.
core
On a geometric programming problem with linear constraints
Not available.
I. Maruşciac
doaj +2 more sources
Linear Programming in Some Ramsey Problems
By using some graphical algorithms and solving large integer linear programming problems the authors obtain the following new upper bounds for some classical Ramsey numbers, namely \(R(4,5) \leq 27\), \(R(5,5) \leq 52\), and \(R(4,6) \leq 43\). Their approach to the search is outlined in the paper. They also note in an addendum that by improving one of
McKay, Brendan D. +1 more
openaire +2 more sources

