, A new technique for inconsistent QP problems in the SQP method, Math. Methods Oper. Res., 47 (1998), pp. 355-400. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Snopt: An SQP Algorithm For Large-Scale Constrained.. - Gill, Murray, Saunders (1997) (48 citations) (Correct)
....large. If were in nite, the nonlinear constraint violations would be minimized subject to the linear constraints and bounds. A similar 1 formulation of NP is used in the SQP method of Tone [75] and is fundamental to the S 1 QP algorithm of Fletcher [29] See also Conn [19] and Spellucci [71]. An attractive feature is that only linear terms are added to NP, giving no increase in the expected degrees of freedom at each QP solution. 1.3. Other work on large scale SQP. There has been considerable interest in extending SQP methods to the large scale case (sometimes using exact second ....
, A new technique for inconsistent QP problems in the SQP method, Math. Methods Oper. Res., 47 (1998), pp. 355-400.
Isomorphism for Digraphs and Sequences of Shop Scheduling .. - Bräsel, Harborth.. Self-citation (Sequences) (Correct)
....a partial order on the set of sequences with the property that at least one optimal sequence is in the set of minimal elements of this partial order independent of the given processing times. This partial order is part of a concept of irreducibility for sequences introduced by Br asel and Kleinau [2]. We describe a polynomial time algorithm for solving the restricted isomorphism problem on acyclic digraphs associated with open shop sequences. This algorithm allows us to give computational results for the number of such non isomorphic digraphs of a given format. This number can be used to ....
....of the j th column tournament (spanned by the vertex set f(1j) 2j) nj)g) corresponds to the job order on machine M j . This associated combination of job orders and machine orders is feasible because the underlying sequence graph does not contain any cycle. Following the intention of [2], we are interested in sequences of open shop problems for which small maximum completion times can be expected. The number of vertices on the longest paths of such reasonable sequences is relatively small. There is a partial order P on the set of sequences using this property such that the ....
, New steps in the amazing world of sequences and schedules, Math. Methods Oper. Res. 43 (1996), 195--214.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC