Results 11 to 20 of about 3,786,566 (280)
Reformulations of mathematical programming problems as linear complementarity problems [PDF]
, 1982 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 +6 more sources
Linear, integer separable and fuzzy programming problems: a united approach towards automatic reformulation [PDF]
, 1986 For mathematical programming (MP) to have greater impact as a decision tool, MP software systems must offer suitable support in terms of model communication and modelling techniques.
Mitra, G +3 more
core +6 more sources
Solving large scale linear programming [PDF]
, 1993 The interior point method (IPM) is now well established as a competitive technique for solving very large scale linear programming problems. The leading variant of the interior point method is the primal dual - predictor corrector algorithm due to ...
Levkovitz, R, Mitra, G, Hafsteinsson, H
core +6 more sources
The future of feed formulation for poultry: Toward more sustainable production of meat and eggs
Animal Nutrition, 2023 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]
IEEE Transactions on Information Theory, 2005 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
IET Information Security, 2022 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
Computer assisted modelling of linear, integer and separable programming problems [PDF]
, 1984 For mathematical programming (MP) to have greater impact upon the decision making process, MP software systems must offer suitable support in terms of model communication and modelling techniques .
Mitra, G, Darby-Dowman, K, Lucas, CA
core +6 more sources
Developments in linear and integer programming [PDF]
, 2002 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
International Journal of Applied Mathematics and Computer Science, 2020 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
Open Computer Science, 2020 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