Results 31 to 40 of about 10,510,472 (349)
Alexandria Engineering Journal, 2022 This paper illustrates how the fuzzy harmonic mean technique can efficiently solve fully fuzzy multilevel multiobjective linear programming (FFMMLP) problems.
E. Fathy, A.E. Hassanien
doaj
Linear Superiorization for Infeasible Linear Programming
, 2016 Linear superiorization (abbreviated: LinSup) considers linear programming (LP) problems wherein the constraints as well as the objective function are linear.
A Cegielski +11 more
core +1 more source
Complexity of linear programming
Operations Research Letters, 1982 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
The complexity of linear programming
Theoretical Computer Science, 1980 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
Steven P. Reiss, David P. Dobkin
openaire +3 more sources
Team Teaching Load using Linear Programming
Journal of Computing Research and Innovation, 2019 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
Sensitivity analysis in piecewise linear fractional programming problem with non-degenerate optimal solution [PDF]
Opuscula Mathematica, 2009 In this paper, we study how changes in the coefficients of objective function and the right-hand-side vector of constraints of the piecewise linear fractional programming problems affect the non-degenerate optimal solution.
Behrouz Kheirfam
doaj +1 more source
One-bit compressed sensing by linear programming [PDF]
, 2012 We give the first computationally tractable and almost optimal solution to the problem of one-bit compressed sensing, showing how to accurately recover an s-sparse vector x in R^n from the signs of O(s log^2(n/s)) random linear measurements of x.
Plan, Yaniv, Vershynin, Roman
core +2 more sources
Conic Programming Reformulations of Two-Stage Distributionally Robust Linear Programs over Wasserstein Balls [PDF]
Operational Research, 2016 Adaptive robust optimization problems are usually solved approximately by restricting the adaptive decisions to simple parametric decision rules. However, the corresponding approximation error can be substantial.
G. A. Hanasusanto, D. Kuhn
semanticscholar +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
Generating Non-Linear Interpolants by Semidefinite Programming [PDF]
, 2013 Interpolation-based techniques have been widely and successfully applied in the verification of hardware and software, e.g., in bounded-model check- ing, CEGAR, SMT, etc., whose hardest part is how to synthesize interpolants. Various work for discovering
A. Biere +20 more
core +2 more sources