Results 71 to 80 of about 750,593 (188)

A Hybrid IP/GA Approach to the Parallel Production Lines Scheduling Problem

Discrete Dynamics in Nature and Society, 2016
A special parallel production lines scheduling problem is studied in this paper. Considering the time window and technical constraints, a mixed integer linear programming (MILP) model is formulated for the problem.
Huizhi Ren, Shenshen Sun
doaj   +1 more source

Inner approximation algorithm for generalized linear multiplicative programming problems

Journal of Inequalities and Applications, 2018
An efficient inner approximation algorithm is presented for solving the generalized linear multiplicative programming problem with generalized linear multiplicative constraints.
Yingfeng Zhao, Juanjuan Yang
doaj   +1 more source

Global Algorithm for Generalized Affine Multiplicative Programming Problem

IEEE Access, 2019
In this paper, a new outer space rectangle branch and bound algorithm is proposed for globally solving generalized affine multiplicative programming problem.
Jingben Yin, Hongwei Jiao, Youlin Shang
doaj   +1 more source

On partial calmness for bilevel programming problem with a linear lower-level problem

Доклады Белорусского государственного университета информатики и радиоэлектроники, 2019
Numerous publications are devoted to bilevel programming problems. Despite a seemingly simple statement these problems are considerably difficult for numerical solving, and a significant part of research in the field of bilevel programming is devoted to ...
D. E. Berezhnov, L. I. Minchenko
doaj  

Linear complementarity problems solvable by A single linear program [PDF]

Mathematical Programming, 1976
The principal result of this paper is, that the linear complementarity problem in \(\mathbb R^n\): \[ Mz+q\geq 0,\;z\geq 0,\;z^T(Mz+q)=0\tag{1} \] has a solution, which can be obtained by solving the linear program \[ \{p^Tz\mid Mz+q\geq 0,\;z\geq 0,\;p=r+M^Ts\}=\min!
openaire   +1 more source

Alternative mathematical programming formulations for FSS synthesis [PDF]

A variety of mathematical programming models and two solution strategies are suggested for the problem of allocating orbital positions to (synthesizing) satellites in the Fixed Satellite Service.
Gonsalvez, D. J. A., Levis, C. A., Mount-Campbell, C. A., Reilly, C. H.   +3 more
core   +1 more source

Duality in linear programming [PDF]

Any linear programming problem marked as P and called ”primal” can be seen in connection with another linear programming problem marked as D and called ”dual”. The economic interpretation of the dual model brings about new information when analyzing such
Albici, Mihaela, Popa, Ionela, Prundeanu, Raluca, Teselios, Delia   +3 more
core   +1 more source

Revised Harmonious Fuzzy Technique for Solving Fully Fuzzy Multi-Objective Linear Fractional Programming Problems

Zanco Journal of Pure and Applied Sciences
    The revised harmonious fuzzy technique (RHFT) is a method used to solve fuzzy optimization problems. It was capitalized as an extension of the classical linear programming technique to handle constraints and objectives that are fuzzy. The harmonious
Maher A. Nawkhass
doaj   +1 more source

Bounding Option Prices Using SDP With Change Of Numeraire [PDF]

Recently, given the first few moments, tight upper and lower bounds of the no arbitrage prices can be obtained by solving semidefinite programming (SDP) or linear programming (LP) problems.
Berc Rustem, Kai Ye, Panos Parpas
core  

Linear complementarity problems solvable as linear programs

Journal of Numerical Analysis and Approximation Theory, 2018
In this paper, we present a theoretical and numerical study of linear complementary problems solvable as linear programs. We give several examples of linear complementarity problems which can be solved as linear programs using linear programming appraoches. Also, we propose two examples solved by the simplex and Karmarkar's method, while the most
openaire   +3 more sources