E-model for Transportation Problem of Linear Stochastic Fractional Programming

This paper deals with the so-called transportation problem of linear stochastic fractional programming, and emphasizes the wide applicability of LSFP. The transportation problem, received this name because many of its applications involve in determining how to optimally transport goods. However, some of its applications (e.g., production scheduling) actually have nothing to do with transportation. The … Read more

Optimization of forming load and variables in deep drawing process for automotive cup using Genetic Algorithm

Sheet metal forming is a significant manufacturing process for producing a large variety of automotive parts and aerospace parts as well as consumer products. Deep drawing is a compression-tension forming process involving wide spectrum of operations and flow conditions. The result of the process depends on the large number of parameters and their interdependence. With … Read more

Jamming communication networks under complete uncertainty

This paper describes a problem of interdicting/jamming wireless communication networks in uncertain environments. Jamming communication networks is an important problem with many applications, but has received relatively little attention in the literature. Most of the work on network interdiction is focused on preventing jamming and analyzing network vulnerabilities. Here, we consider the case where there … Read more

MIR Closures of Polyhedral Sets

We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is NP-hard. We describe a mixed-integer programming (MIP) model with linear constraints and a non-linear objective for separating an arbitrary point from the MIR closure of a … Read more

An EP theorem for dual linear complementarity problem

The linear complementarity problem (LCP) belongs to the class of NP-complete problems. Therefore we can not expect a polynomial time solution method for LCPs without requiring some special property of the matrix of the problem. We show that the dual LCP can be solved in polynomial time if the matrix is row sufficient, moreover in … Read more

One Class Nonsmooth Dyscrete Step Control Problem

In this paper a survey and refinement of its recent results in the discrete optimal control theory are presented. The step control problem depending on a parameter is investigated. No smoothness of the cost function is assumed and new versions of the discrete maximum principle for the step control problem are derived Citation submited to … Read more