FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W4281296416> ?p ?o ?g. }

• W4281296416 endingPage "2753" @default.
• W4281296416 startingPage "2736" @default.
• W4281296416 abstract "We explore the Projective Cutting-Planes algorithm proposed in Porumbel (2020) from new angles by applying it to two new problems, that is, to robust linear programming and to a cutting-stock problem with multiple lengths. Projective Cutting-Planes is a generalization of the widely used Cutting-Planes, and it aims at optimizing a linear function over a polytope [Formula: see text] with prohibitively many constraints. The main new idea is to replace the well-known separation subproblem with the following projection subproblem: given an interior point [Formula: see text] and a direction [Formula: see text], find the maximum steplength t such that [Formula: see text]. This enables one to generate a feasible solution at each iteration, a feature that does not exist built-in in a standard Cutting-Planes algorithm. The practical success of this new algorithm does not mainly come from the higher level ideas already presented in Porumbel (2020) . Its success is significantly more dependent on the computation time needed to solve the projection subproblem in practice. Thus, the main challenge addressed by the current paper is the design of new techniques for solving this subproblem very efficiently for different polytopes [Formula: see text]. We first address a well-known robust linear programming problem in which [Formula: see text] is defined as a primal polytope. We then solve a multiple-length cutting stock problem in which [Formula: see text] is a dual polytope defined in a column generation model. Numerical experiments on both these new problems confirm the potential of the proposed ideas. This enables us to draw conclusions supported by numerical results from both the current paper and Porumbel (2020) while also gaining more insight into the dynamics of the algorithm. Summary of Contribution: The well-known Cutting-Planes algorithm relies on the separation subproblem to cut off the current optimal solution. This paper belongs to a line of work whose goal is to “upgrade” the widely used separation subproblem to the following projection subproblem: given a feasible solution x inside some polytope P and a direction d, what is the maximum t value such that x + td ∈ P. In simple terms, one has to “shoot” from x along direction d up to the point where the boundary of the polytope is hit. The greatest challenge is to solve this projection subproblem rapidly enough to compete well in terms of computational speed with the separation subproblem algorithm. This paper shows how to achieve this on two new problems: robust linear programming and multiple length cutting stock. The numerical results confirm one important advantage offered by the projection logic: it enables one to generate a new feasible interior solution (i.e., x + td) at each iteration. The interior points thus generated actually guide the evolution of the overall algorithm, which is a feature that does not exist (built-in) in a traditional Cutting-Planes algorithm." @default.
• W4281296416 created "2022-05-24" @default.
• W4281296416 creator A5046556052 @default.
• W4281296416 date "2022-09-01" @default.
• W4281296416 modified "2023-09-29" @default.
• W4281296416 title "Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems" @default.
• W4281296416 cites W1574951568 @default.
• W4281296416 cites W1970355999 @default.
• W4281296416 cites W1992439238 @default.
• W4281296416 cites W2005431820 @default.
• W4281296416 cites W2078726782 @default.
• W4281296416 cites W2079451635 @default.
• W4281296416 cites W2103159428 @default.
• W4281296416 cites W2241927630 @default.
• W4281296416 cites W2574610297 @default.
• W4281296416 cites W2809615149 @default.
• W4281296416 cites W3013252004 @default.
• W4281296416 cites W4234009545 @default.
• W4281296416 doi "https://doi.org/10.1287/ijoc.2022.1160" @default.
• W4281296416 hasPublicationYear "2022" @default.
• W4281296416 type Work @default.
• W4281296416 citedByCount "0" @default.
• W4281296416 crossrefType "journal-article" @default.
• W4281296416 hasAuthorship W4281296416A5046556052 @default.
• W4281296416 hasBestOaLocation W42812964162 @default.
• W4281296416 hasConcept C109839438 @default.
• W4281296416 hasConcept C11413529 @default.
• W4281296416 hasConcept C114614502 @default.
• W4281296416 hasConcept C126255220 @default.
• W4281296416 hasConcept C137836250 @default.
• W4281296416 hasConcept C145691206 @default.
• W4281296416 hasConcept C155253501 @default.
• W4281296416 hasConcept C168956720 @default.
• W4281296416 hasConcept C33923547 @default.
• W4281296416 hasConcept C37307619 @default.
• W4281296416 hasConcept C41008148 @default.
• W4281296416 hasConcept C41045048 @default.
• W4281296416 hasConcept C56086750 @default.
• W4281296416 hasConceptScore W4281296416C109839438 @default.
• W4281296416 hasConceptScore W4281296416C11413529 @default.
• W4281296416 hasConceptScore W4281296416C114614502 @default.
• W4281296416 hasConceptScore W4281296416C126255220 @default.
• W4281296416 hasConceptScore W4281296416C137836250 @default.
• W4281296416 hasConceptScore W4281296416C145691206 @default.
• W4281296416 hasConceptScore W4281296416C155253501 @default.
• W4281296416 hasConceptScore W4281296416C168956720 @default.
• W4281296416 hasConceptScore W4281296416C33923547 @default.
• W4281296416 hasConceptScore W4281296416C37307619 @default.
• W4281296416 hasConceptScore W4281296416C41008148 @default.
• W4281296416 hasConceptScore W4281296416C41045048 @default.
• W4281296416 hasConceptScore W4281296416C56086750 @default.
• W4281296416 hasIssue "5" @default.
• W4281296416 hasLocation W42812964161 @default.
• W4281296416 hasLocation W42812964162 @default.
• W4281296416 hasLocation W42812964163 @default.
• W4281296416 hasLocation W42812964164 @default.
• W4281296416 hasLocation W42812964165 @default.
• W4281296416 hasOpenAccess W4281296416 @default.
• W4281296416 hasPrimaryLocation W42812964161 @default.
• W4281296416 hasRelatedWork W1983531152 @default.
• W4281296416 hasRelatedWork W2054299720 @default.
• W4281296416 hasRelatedWork W2057327943 @default.
• W4281296416 hasRelatedWork W2073944685 @default.
• W4281296416 hasRelatedWork W2106915499 @default.
• W4281296416 hasRelatedWork W2109445739 @default.
• W4281296416 hasRelatedWork W2161798622 @default.
• W4281296416 hasRelatedWork W2470301277 @default.
• W4281296416 hasRelatedWork W2588840994 @default.
• W4281296416 hasRelatedWork W4281296416 @default.
• W4281296416 hasVolume "34" @default.
• W4281296416 isParatext "false" @default.
• W4281296416 isRetracted "false" @default.
• W4281296416 workType "article" @default.