In this article a survey of studies on scheduling problems with a common due window assignment and earliness/tardiness penalty functions is presented. A due window is a generalization of the classical due date and describes a time interval in which a job should be finished. If a job is completed before or after the due window, it incurs an earliness or a tardiness penalty, respectively. In this...

We show that finding a global optimal solution for the regularized Lq-minimization problem (q ≥ 1) is strongly NP-hard if the penalty function is concave but not linear in a neighborhood of zero and satisfies a very mild technical condition. This implies that it is impossible to have a fully polynomial-time approximation scheme (FPTAS) for such problems unless P = NP. This result clarifies the ...

Abstract In this work, we study exact continuous reformulations of nonlinear integer programming problems. To this aim, we preliminarily state conditions to guarantee the equivalence between pairs of general nonlinear problems. Then, we prove that optimal solutions of a nonlinear integer programming problem can be obtained by using various exact penalty formulations of the original problem in a...

One of the strengths of Model Predictive Control (MPC) is its ability to incorporate constraints in the control formulation. Often a disturbance drives the system into a region where the MPC problem is infeasible and hence no control action can be computed. Feasibility can be recovered by softening the constraints using slack variables. This approach does not necessarily guarantee that the cons...

We examine the implications of a firm outsourcing both (i) security device management which attempts to prevent security breaches and (ii) security monitoring which attempts to detect security breaches to managed security service providers (MSSPs). In the context of security outsourcing, the firm not only faces the traditional moral hazard problem as it cannot observe an MSSP’s prevention or de...

This note continues an investigation by the authors of minimizing the transient response of a linear system as measured by nonquadratic penalty functions, in particular, penalty functions which have linear growth. First, this note shows that the optimal state feedback which minimizes the transient response in the case of no exogenous inputs also minimizes the induced norm in case exogenous inpu...

In this paper, we consider a perturbed compound Poisson risk model with two-sided jumps. The downward jumps represent the claims following an arbitrary distribution, while the upward jumps are also allowed to represent the random gains. Assuming that the density function of the upward jumps has a rational Laplace transform, the Laplace transforms and defective renewal equations for the discount...

a meshless approach, collocation discrete least square (cdls) method, is extended in this paper, for solvingelasticity problems. in the present cdls method, the problem domain is discretized by distributed field nodes. the fieldnodes are used to construct the trial functions. the moving least-squares interpolant is employed to construct the trialfunctions. some collocation points that are indep...

Segmentation technique is widely accepted to reduce noise propagation from transmission scanning for positron emission tomography. The conventional routine is to sequentially perform reconstruction and segmentation. A smoothness penalty is also usually used to reduce noise, which can be imposed to both the ML and WLS estimators. In this paper we replace the smoothness penalty by a segmentation ...

We extend the theory of penalty functions to stochastic programming problems with nonlinear inequality constraints dependent on a random vector with known distribution. We show that the problems with penalty objective, penalty constraints and chance constraints are asymptotically equivalent under discretely distributed random parts. This is a complementary result to Branda (2012a), Branda and D...