Nemhauser, G.L.; Widhelm, W.B.
July 1971
Operations Research;Jul/Aug71, Vol. 19 Issue 4, p1051
Academic Journal
This paper develops a modified linear programming algorithm for columnar methods in mathematical programming that is applicable to the decomposition principle of linear programming, to concave maximization problems over compact and convex sets, and to searching generalized Lagrange multipliers. It derives the linear program from linear inequalities in the multiplier space and compares it with the well-known linear program of DANTZIG AND WOLFE for solving such problems.


Related Articles

  • Parametric global optimisation for bilevel programming. Nuno Faísca; Vivek Dua; Berç Rustem; Pedro Saraiva; Efstratios Pistikopoulos // Journal of Global Optimization;Aug2007, Vol. 38 Issue 4, p609 

    Abstract  We propose a global optimisation approach for the solution of various classes of bilevel programming problems (BLPP) based on recently developed parametric programming algorithms. We first describe how we can recast and solve the inner (follower’s) problem of the bilevel...

  • Energy-aware disk scheduling for soft real-time I/O requests. Youjip Won; Jongmin Kim; Wonmin Jung // Multimedia Systems;Feb2008, Vol. 13 Issue 5/6, p409 

    Abstract  In this work, we develop energy-aware disk scheduling algorithm for soft real-time I/O. Energy consumption is one of the major factors which bar the adoption of hard disk in mobile environment. Heat dissipation of large scale storage system also calls for an...

  • Sufficient Optimality Criterion for Linearly Constrained, Separable Concave Minimization Problems. Illés, T.; Nagy, Á B. // Journal of Optimization Theory & Applications;Jun2005, Vol. 125 Issue 3, p559 

    A sufficient optimality criterion for linearly-constrained concave minimization problems is given in this paper. Our optimally criterion is based on the sensitivity analysis of the relaxed linear programming Problem. The main result is similar to that of Phillips and Rosen (Ref. 1); however, our...

  • GENERALIZED RESOLUTION AND CUTTING PLANES. Hooker, J. N. // Annals of Operations Research;1988, Vol. 12 Issue 1-4, p217 

    This paper illustrates how the application of integer programming to logic can reveal parallels between logic and mathematics and lead to new algorithms for inference in knowledge-based systems. If logical clauses (stating that at least one of a set of literals is true) are written as...

  • Solving One-Dimensional Cutting Stock Problem with Discrete Demands and Capacitated Planning Objective. Wongprakornkul, Sirirat; Charnsethikul, Peerayuth // Journal of Mathematics & Statistics;2010, Vol. 6 Issue 2, p79 

    Problem statement: One-dimensional cutting stock problem with discrete demands and capacitated planning objective is an NP hard problem. Approach: The mathematical model with column-generation technique by a branch-and-bound procedure and the heuristic based on the first fit decreasing method...

  • A UNIFIED VIEW OF INTERIOR POINT METHODS FOR LINEAR PROGRAMMING. Shanno, David F.; Bagchi, Ansuman // Annals of Operations Research;1990, Vol. 22 Issue 1-4, p55 

    The paper shows how various interior point methods for linear programming may all be derived from logarithmic barrier methods. These methods include primal and dual projective methods, affine methods, and methods based on the method of centers. In particular, the paper demonstrates that...

  • A note on linear complementarity problems and multiple objective programming. Mohan, S. R.; Neogy, S. K.; Das, A. K. // Mathematical Programming;Jun2004, Vol. 100 Issue 2, p339 

    Kostreva and Wiecek [3] introduced a problem called LCP-related weighted problem in connection with a multiple objective programming problem, and suggested that a given linear complementarity problem (LCP) can be solved by solving the LCP-related weighted problem associated with it. In this note...

  • Optimal 3-terminal cuts and linear programming. Cheung, Kevin K. H.; Cunningham, William H.; Tang, Lawrence // Mathematical Programming;Mar2006, Vol. 106 Issue 1, p1 

    Given an undirected graph G=( V, E) and three specified terminal nodes t 1, t 2, t 3, a 3-cut is a subset A of E such that no two terminals are in the same component of G\ A. If a non-negative edge weight c e is specified for each e∈ E, the optimal 3-cut problem is to find a 3-cut of...

  • RELAXATION TECHNIQUES FOR STRICTLY CONVEX NETWORK PROBLEMS. Zenios, S. A.; Mulvey, J. M. // Annals of Operations Research;1986, Vol. 5 Issue 1-4, p517 

    Gauss-Seidel type relaxation techniques are applied in the context of strictly convex pure networks with separable cost functions. The algorithm is an extension of the Bertsekas-Tseng approach for solving the linear network problem and its dual as a pair of monotropic programming problems. The...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics