Page 1

Displaying 1 – 14 of 14

Showing per page

Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results

Jean Damay, Alain Quilliot, Eric Sanlaville (2008)

RAIRO - Operations Research


We deal here with a scheduling problem GPPCSP (Generalized Parallelism and Preemption Constrained Scheduling Problem) which is an extension of both the well-known Resource Constrained Scheduling Problem and the Scheduling Problem with Disjunctive Constraints. We first propose a reformulation of GPPCSP: according to it, solving GPPCSP means finding a vertex of the Feasible Vertex Subset of an Antichain Polyhedron. Next, we state several theoretical results related to this reformulation process and...

Positivity and stabilization of 2D linear systems

Tadeusz Kaczorek (2009)

Discussiones Mathematicae, Differential Inclusions, Control and Optimization

The problem of finding a gain matrix of the state-feedback of 2D linear system such that the closed-loop system is positive and asymptotically stable is formulated and solved. Necessary and sufficient conditions for the solvability of the problem are established. It is shown that the problem can be reduced to suitable linear programming problem. The proposed approach can be extended to 2D linear system described by the 2D Roesser model.

Proč řešit graficky úlohy lineárního programování

Andrea Kubišová (2016)

Učitel matematiky

At universities focused on economy, Operation Research topics are usually included in the study plan, including solving of Linear Programming problems. A universal tool for their algebraic solution is (numerically difficult) Simplex Algorithm, for which it is necessary to know at least the fundamental of Matrix Algebra. To illustrate this method of solving LP problems and to discuss all types of results, it seems to be very convenient to include a chapter about graphic solutions to LP problems....

Currently displaying 1 – 14 of 14

Page 1