Results 11 to 20 of about 4,002,335 (287)
Reformulations of mathematical programming problems as linear complementarity problems [PDF]
A family of complementarity problems are defined as extensions of the well known Linear Complementarity Problem (LCP). These are (i.) Second Linear Complementarity Problem (SLCP) which is an LCP extended by introducing further equality restrictions and ...
Mitra, G, Judice, JJ
core +4 more sources
The future of feed formulation for poultry: Toward more sustainable production of meat and eggs
Current methods for feed formulation are based on minimizing costs, not maximizing profits. Complex models of bird growth and reproduction as functions of genetic, feed and other environmental variables are being developed, but their adaptation has been ...
Gene M. Pesti, Mingan Choct
doaj +1 more source
Decoding by Linear Programming [PDF]
This paper considers the classical error correcting problem which is frequently discussed in coding theory. We wish to recover an input vector $f \in \R^n$ from corrupted measurements $y = A f + e$. Here, $A$ is an $m$ by $n$ (coding) matrix and $e$ is an arbitrary and unknown vector of errors.
Candès, Emmanuel J., Tao, Terence
openaire +5 more sources
Integral and impossible‐differential attacks on the reduced‐round Lesamnta‐LW‐BC
Lesamnta‐LW‐BC is the internal block cipher of the Lesamnta‐LW lightweight hash function, specified in ISO/IEC 29192‐5:2016. It is based on the unbalanced Feistel network and Advanced Encryption Standard round function.
Rentaro Shiba +4 more
doaj +1 more source
Algorithms for network piecewise-linear programs [PDF]
In this paper a subarea of Piecewise-Linear Programming named network Piecewise-Linear Programming (NPLP) is discussed. Initially the problem formulation, main efinitins and related Concepts are presented.
Machado, A, Marins, F A S, Perin, C
core +4 more sources
Developments in linear and integer programming [PDF]
In this review we describe recent developments in linear and integer (linear) programming. For over 50 years Operational Research practitioners have made use of linear optimisation models to aid decision making and over this period the size of problems ...
Darby-Dowman, K, Wilson, J M
core +1 more source
A linear programming methodology for approximate dynamic programming
The linear programming (LP) approach to solve the Bellman equation in dynamic programming is a well-known option for finite state and input spaces to obtain an exact solution.
Díaz Henry +2 more
doaj +1 more source
The problem of maximizing a linear function with linear and quadratic constraints is considered. The solution of the problem is obtained in a constructive form using the Lagrange function and the optimality conditions.
Gorelik Victor, Zolotova Tatiana
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
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

