We view the optimal single commodity network flow problem with linear arc costs and its dual as a pair of monotropic programming problems, i.e. problems of minimizing the separable sum of scalar extended real-valued convex functions over a subspace. For such problems directions of cost improvement can be selected from among a finite set of directions--the elementary vectors of the constraint su...

An algorithm for minimizing a nonlinear function subject to nonlinear inequality constraints is described It applies sequential quadratic programming techniques to a sequence of barrier problems and uses trust regions to ensure the robustness of the iteration and to allow the direct use of second order derivatives This framework permits primal and primal dual steps but the paper focuses on the ...

We present pure-integer Gomory cuts in a way so that they are derived with respect to a “dual form” pure-integer optimization problem and applied on the standard-form primal side as columns, using the primal simplex algorithm. The input integer problem is not in standard form, and so the cuts are derived a bit differently. In this manner, we obtain a finitely-terminating version of pure-integer...

We present a hierarchical model predictive control approach for large-scale systems based on dual decomposition. The proposed scheme allows coupling in both dynamics and constraints between the subsystems and generates a primal feasible solution within a finite number of iterations, using primal averaging and a constraint tightening approach. The primal update is performed in a distributed way ...

We present a hierarchical model predictive control approach for large-scale systems based on dual decomposition. The proposed scheme allows coupling in both dynamics and constraints between the subsystems and generates a primal feasible solution within a finite number of iterations, using primal averaging and a constraint tightening approach. The primal update is performed in a distributed way ...

Propositional primal logic, as defined by Gurevich and Neeman, has two kinds of quotations: p said φ, and p implied φ. Note 1. The derivation problem for propositional primal logic with one kind of quotations is solvable linear time. Note 2. In the Hilbertian calculus for propositional primal logic, the shortest derivation of a formula φ from hypotheses H may be exponential in the length of (H,φ).