In a linear programming (LP), market demand is assumed to be constant, but the demand is often random variable which is to be realized as time lapses. We refined the previous work of Higle and Wallace (2003) who studied an LP depending on the timing of market demand realization. The motivation of this research is the need to consider three operational strategies used for dealing with demand unc...

In the previous lecture, we introduced linear programming using slack form, and we showed how to solve an LP assuming that we have a black box for solving an LP starting from a feasible solution (SimplexInner). In this lecture, we would present SimplexInner. Slack form-a tuple (N, B, A, b, c, v) is an LP. The feasible solution is generated by assigning all the Nonbasic variables the value zero....

Product-mix decision through theory of constraints (TOC) should take into account considerations like the decisionmaker’s (DM) level of satisfaction in order to make product-mix decision a robust one. Sensitivity of the decision made, needs to be focused for a bottle-neck-free, optimal product-mix solution of TOC problem. A membership function (MF) has been suitably designed in the present work...

Novelty detection involves modeling the normal patterns for detecting any divergence from this behavior. Our recently proposed algorithm, Glabal&Local One Class Classifier (GLocal OCC), can solve this problem by maximizing the margin between the hyperplane and the origin through embedding the global information into the OCSVM framework. In this paper, we propose Linear Programming (LP) GLocal O...

Consider the relaxation of an integer programming (IP) problem in which the feasible region is replaced by the intersection of the linear programming (LP) feasible region and the corner polyhedron for a particular LP basis. Recently a primal-dual ascent algorithm has been given for solving this relaxation. Given an optimal solution of this relaxation, we state criteria for selecting a new LP ba...

Central to many sentiment analysis tasks are sentiment lexicons (SLs). SLs exhibit polarity inconsistencies. Previous work studied the problem of checking the consistency of an SL for the case when the entries have categorical labels (positive, negative or neutral) and showed that it is NPhard. In this paper, we address the more general problem, in which polarity tags take the form of a continu...

Recently, Wang et al. [IEEE INFOCOM 2011, 820-828], and Nie et al. [IEEE AINA 2014, 591-596] have proposed two schemes for secure outsourcing of linear programming (LP). They did not consider the standard form: minimize cx, subject to Ax = b,x ≥ 0. Instead, they studied a peculiar form: minimize cx, subject to Ax = b,Bx ≥ 0, where B is a non-singular matrix. In this note, we stress that the pro...

Deformable surface 3D tracking is a severely under-constrained problem and great efforts have been made to solve it. A recent state-of-the-art approach solves this problem by formulating it as a second order cone programming (SOCP) problem. However, one drawback of this approach is that it is timeconsuming. In this paper, we propose an effective method for 3D deformable surface tracking. First,...

Abstract: In this paper, we present a first linear programming (LP) formulation of the vertex colouring problem (VCP). The complexity orders of the number of variables and the number of constraints of the proposed LP are O ( 9 ) and O ( 8 ), respectively, where and are the number of vertices and the number of available colours in the VCP instance, respectively. Hence, the proposed model represe...

This paper describes a new hybrid method based on the application of the Population Training Algorithm (PTA) and linear programming (LP) for generation of schedules for drivers in a public transport system. These methods are applied in an iterative way, where PTA is responsible for the generation of good columns (low cost and good covering of the tasks), and LP for solving a set partitioning pr...