- Book Chapter
- 10.1016/b978-012417910-3/50006-1
3 - Further Topics in Linear Programming
- Jan 01, 1995
- Elementary Linear Programming with Applications
- Bernard Kolman + 1 more +1
3 - Further Topics in Linear Programming
A duality theorem for linear congruences
3 - Further Topics in Linear Programming
3 - Further Topics in Linear Programming
Duality theorems and saddle point optimality conditions in fuzzy nonlinear programming problems based on different solution concepts
Duality theorems and saddle point optimality conditions in fuzzy nonlinear programming problems based on different solution concepts
Read moreElementary Linear Programming with Applications
Elementary Linear Programming with Applications
A duality theorem for plastic plates
Summary Limit analysis studies the asymptotic behavior of elastic-plastic materials and structures. The asymptotic material properties exist for a class of ductile metals and are designed into optimal structural members such as I-beams and composite plates. The analysis automatically ignores the relatively small elastic deformations. Classical lower and upper bound theorems in the form of inequalities are mathematically incomplete. A duality theorem equates the greatest lower bound and the least upper bound. Although some general statement has been made on the duality relation of limit analysis, each yield criterion will lead to a specific duality theorem. The duality theorem for a class of plastic plates is established in this paper. The family of ~-norms is used to represent the yield functions. Exact solutions for circular plates under a uniform load are obtained for clamped and simply supported boundaries as examples of the specific duality relations. Two classical solutions associated with Tresca and Johansen yield functions are also presented in the spirit of their own duality relations, providing interesting comparison to the new solutions. A class of approximate solutions by a finite element method is presented to show the rapid mesh convergence property of the dual formulation. Complete and general forms of the primal and dual limit analysis problems for the ~-family plates are stated in terms of the components of the moment and curvature matrices.
Read moreEfficient algorithms for buffer space allocation
This paper describes efficient algorithms for determining how buffer space should be allocated in a flow line. We analyze two problems: a primal problem, which minimizes total buffer space subject to a production rate constraint; and a dual problem, which maximizes production rate subject to a total buffer space constraint. The dual problem is solved by means of a gradient method, and the primal problem is solved using the dual solution. Numerical results are presented. Profit optimization problems are natural generalizations of the primal and dual problems, and we show how they can be solved using essentially the same algorithms.
Read moreDuality for nondifferentiable minimax programming in complex spaces
Duality for nondifferentiable minimax programming in complex spaces
Supplement to “On the Inverse of Monoidal Transformation”
In this note we shall fill a gap in the original proof of the Main Theorem in the previous paper ^4], and sharpen the Theorem by showing that the condition (a) alone is sufficient to derive the conclusion of the theorem. This sharpened theorem enables us to solve a problem posed by K. Kodaira in [2]. The authors are grateful to Professor Mudumbai S. Narasimhan for calling our attention to the gap, to him, to Takahiro Kawai and to other friends for discussion about this. § 1. Vanishing of Cohomology In the proof of theorem 1 in Q4], we made too easy use of Serre's duality theorem. Let V be a connected paracompact complex analytic manifold of dimension n and E a holomorphic vector bundle over V. Let us denote by Cp>q=-Cp'q(V, E) the space of E -valued differential forms of type (p, q) and of class C°°, with the topology as given in Q5]. (Cp>q stands for Ap*9 in [5].) The space K%~pt*~q of £*-valued currents of type (n—p, n — q) with compact supports is isomorphic to the topological dual of Cp>9, and the transpose of the sequence
Read moreFeasibility and solvability of Lyapunov-type linear programming over symmetric cones
In this paper, we consider the Lyapunov-type linear programming and its dual over symmetric cones. By introducing and characterizing the generalized inverse of Lyapunov operator in Euclidean Jordan algebras, we establish two kinds of Lyapunov-type Farkas’ lemmas to exhibit feasibilities of the corresponding primal and dual programming problems, respectively. As one of the main results, we show that the feasibilities of the primal and dual problems lead to the solvability of the primal problem and zero duality gap under some mild condition. In this case, we obtain that any solution to the pair of primal and dual problems is equivalent to the solution of the corresponding KKT system.
Read moreDuality Theory
Nonlinear optimization problems have two different representations, the primal problem and the dual problem. The relation between the primal and the dual problem is provided by an elegant duality theory. This chapter presents the basics of duality theory. Section 4.1 discusses the primal problem and the perturbation function. Section 4.2 presents the dual problem. Section 4.3 discusses the weak and strong duality theorems, while section 4.4 discusses the duality gap. This section presents the formulation of the primal problem, the definition and properties of the perturbation function, the definition of stable primal problem, and the existence conditions of optimal multiplier vectors.
Read moreScheduling parallel-machine batch operations to maximize on-time delivery performance
In this paper we study the problem of minimizing total weighted tardiness, a proxy for maximizing on-time delivery performance, on parallel nonidentical batch processing machines. We first formulate the (primal) problem as a nonlinear integer programming model. We then show that the primal problem can be solved exactly by solving a corresponding dual problem with a nonlinear relaxation. Since both the primal and the dual problems are NP-hard, we use genetic algorithms, based on random keys and multiple choice encodings, to heuristically solve them. We find that the genetic algorithms consistently outperform a standard mathematical programming package in terms of solution quality and computation time. We also compare the smaller problem instances to a breadth-first tree search algorithm that gives evidence of the quality of the solutions.
Read moreSymmetric duality for multiplicatively separable fractional mixed integer programming problem
A pair of symmetric dual fractional mixed integer programming problems is formulated and an appropriate duality theorem is established under suitable convexity and multiplicative separability assumptions on the kernel function. A self duality theorem and the extension of the formulation to convex cone domains are also discussed
Read moreDUALITY IN INTERVAL LINEAR PROGRAMMING
DUALITY IN INTERVAL LINEAR PROGRAMMING
A neural net algorithm for multidimensional maximum entropy spectrum estimation
A neural net algorithm for multidimensional maximum entropy spectrum estimation
Analysis and Problem Characterization
The previous chapter addresses the envelope constrained (EC) filtering problem from the general view point of a convex programming problem by examining properties of the cost functional and the feasible region. This chapter examines the primal-dual nature of the EC filtering problem. In particular, generalized versions of the Kuhn-Tucker Theorem and Duality Theorem (Appendix B.5) are used to convert the quadratic programming problem in Hilbert space into its dual in the space of regular Borel measures. Furthermore, by exploiting the mutual singularity of the dual variables, we can rewrite the dual problem as an unconstrained one. This form, however, does not retain the desirable smooth feature of the original dual. The relationship between the primal and dual solutions suggests an interesting interpretation of the structure of optimal EC filters. For the case in which the decision variable is finite dimensional, we have a semi-infinite programming (SIP) problem, i.e. finite number of degrees of freedom but infinite number of constraints. In this case, Carathéodor’s Dimensionality Theorem (Appendix B.3) can be applied to convert the convex but infinite dimensional dual problem into a non-convex finite dimensional problem.KeywordsDual ProblemPrimal ProblemDuality TheoremMatched FilterSupport PointThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Read moreε-Conjugate maps and ε-conjugate duality in vector optimization with set-valued maps
The aim of this article is to develop an approximate (ε)-conjugate duality theory for a general vector optimization problem with set-valued maps on the basis of ε-weak efficiency. We first introduce the concepts of ε-conjugate maps and ε-weak subgradients for set-valued maps and establish several properties of them. Then we introduce an ε-conjugate dual problem for the vector set-valued optimization problem. Finally, we establish a weak duality theorem and a strong duality theorem for the relationship between the primal and the dual problems.
Read more