Conditions under which adjustability lowers the cost of a robust linear program
Sign Up to like & getrecommendations! Published in 2018 at "Annals of Operations Research"
DOI: 10.1007/s10479-018-2954-4
Abstract: The adjustable robust counterpart (ARC) of an uncertain linear program extends the robust counterpart (RC) by allowing some decision variables to adjust to the realizations of some uncertain parameters. The ARC may produce a less… read more here.
Keywords: adjustability lowers; adjustability; conditions adjustability; robust counterpart ... See more keywords
Luenberger observer design for a dynamic system with embedded linear program, applied to bioprocesses
Sign Up to like & getrecommendations! Published in 2020 at "IFAC-PapersOnLine"
DOI: 10.1016/j.ifacol.2020.12.280
Abstract: Abstract Microbial dynamics are fundamental to many processes in medicine and biotechnology. To model, estimate, and control such growth dynamics, methods of systems theory and control engineering are applied. In this paper, we use a… read more here.
Keywords: system; optimal bases; observer design; linear program ... See more keywords
Linear programming with nonparametric penalty programs and iterated thresholding
Sign Up to like & getrecommendations! Published in 2022 at "Optimization Methods and Software"
DOI: 10.1080/10556788.2022.2117356
Abstract: It is known [Mangasarian, A Newton method for linear programming, J. Optim. Theory Appl. 121 (2004), pp. 1–18] that every linear program can be solved exactly by minimizing an unconstrained quadratic penalty program. The penalty… read more here.
Keywords: penalty; linear program; linear programming; penalty program ... See more keywords
LP Relaxation of the Potts Labeling Problem Is as Hard as Any Linear Program
Sign Up to like & getrecommendations! Published in 2017 at "IEEE Transactions on Pattern Analysis and Machine Intelligence"
DOI: 10.1109/tpami.2016.2582165
Abstract: In our recent work, we showed that solving the LP relaxation of the pairwise min-sum labeling problem (also known as MAP inference in graphical models or discrete energy minimization) is not much easier than solving… read more here.
Keywords: relaxation; labeling problem; min sum; linear program ... See more keywords
A Novel Convexified Linear Program for Coordination of Directional Overcurrent Relays
Sign Up to like & getrecommendations! Published in 2019 at "IEEE Transactions on Power Delivery"
DOI: 10.1109/tpwrd.2019.2892606
Abstract: A novel convexified linear program for optimal directional overcurrent relay (DOCR) coordination problem (CP) is proposed in this letter. The DOCR CP is a highly constrained nonlinear nonconvex problem which was solved using various traditional… read more here.
Keywords: linear program; convexified linear; novel convexified; directional overcurrent ... See more keywords