Results 21 to 30 of about 3,786,566 (280)
LINEAR PROGRAMMING APPLIED TO A CONVEX PROGRAMMING TYPE
In the present’s paper studying a strategy for a typo of convex problem, we treat a linear programming problem whose coefficient of decision variables in the objective function has a nonlinear behavior.
Edinson Raúl Montoro Alegre +3 more
doaj +1 more source
Linear-programming receivers [PDF]
7 pages (double-column), presented at the 46th Annual Allerton Conference on Communication, Control and ...
openaire +3 more sources
On Linear and Quadratic Two-Stage Transportation Problem
Introduction. When formulating the classical two-stage transportation problem, it is assumed that the product is transported from suppliers to consumers through intermediate points.
Petro Stetsyuk +2 more
doaj +1 more source
Complexity of linear programming
The complexity of linear programming is discussed in the "integer" and "real number" models of computation. Even though the integer model is widely used in theoretical computer science, the real number model is more useful for estimating an algorithm's running time in actual computation.
Traub, Joseph F., Wozniakowski, Henryk
openaire +4 more sources
In this study. linear and goal programming models were to shortly introduced, similarities and differences between structure of the models were to discussed.
Altay Uğur GÜL
doaj +1 more source
Adaptive Linear Classifier by Linear Programming
A linear classifier based on linear programming which is adaptive to a change in the set of input vectors is discussed. Different from other linear classifiers, this one maintains the maximum reliability of its operation, provided that the set of pattern vectors is linearly separable.
Ibaraki, Toshihide., Muroga, Saburo.
openaire +3 more sources
Team Teaching Load using Linear Programming
Assignment of teaching loads refers to the allocation of teaching hours among academic staff. It will be the ideal way to assign the right courses to the right staff based on their expertise, preference and experience.
Syadatul Syaeda binti Mat Saleh +2 more
doaj +5 more sources
Solving large scale linear programming problems [PDF]
The interior point method (IPM) is now well established as a computationaly com-petitive scheme for solving very large scale linear programming problems. The leading variant of the IPM is the primal dual predictor corrector algorithm due to Mehrotra. The
Levkovitz, R
core +6 more sources
The complexity of linear programming
AbstractThe complexity of linear programming and other problems in the geometry of d-dimensions is studied. A notion of LP-completeness is introduced, and a set of problems is shown to be (polynomially) equivalent to linear programming. Many of these problems involve computation of subsets of convex hulls of polytopes, and require O(n log n) operations
David P. Dobkin, Steven P. Reiss
openaire +3 more sources

