Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks

2000 ◽  
Vol 27 (5) ◽  
pp. 199-207 ◽  
Author(s):  
S.Thomas McCormick ◽  
Akiyoshi Shioura
Keyword(s):  
Linear Programming ◽  
Minimum Ratio ◽  
Strongly Polynomial

scholarly journals On computational complexity of construction of c -optimal linear regression models over finite experimental domains

2012 ◽  
Vol 51 (1) ◽  
pp. 11-21
Author(s):  
Jaromír Antoch ◽  
Michal Černý ◽  
Milan Hladík
Keyword(s):  
Linear Programming ◽  
Regression Models ◽  
Parallel Implementation ◽  
Optimal Designs ◽  
Polynomial Algorithms ◽  
Linear Regression Models ◽  
Optimal Linear ◽  
New Algorithms ◽  
Approximate Version ◽  
Strongly Polynomial

ABSTRACT Recent complexity-theoretic results on finding c-optimal designs over finite experimental domain X are discussed and their implications for the analysis of existing algorithms and for the construction of new algorithms are shown. Assuming some complexity-theoretic conjectures, we show that the approximate version of c-optimality does not have an efficient parallel implementation. Further, we study the question whether for finding the c-optimal designs over finite experimental domain X there exist a strongly polynomial algorithms and show relations between considered design problem and linear programming. Finally, we point out some complexity-theoretic properties of the SAC algorithm for c-optimality.

scholarly journals Block-Structured Integer and Linear Programming in Strongly Polynomial and Near Linear Time

2021 ◽  
pp. 1666-1681
Author(s):  
Jana Cslovjecsek ◽  
Friedrich Eisenbrand ◽  
Christoph Hunkenschröder ◽  
Lars Rohwedder ◽  
Robert Weismantel
Keyword(s):  
Linear Programming ◽  
Linear Time ◽  
Strongly Polynomial ◽  
Block Structured

Elementary Linear Programming (2nd edition)

1997 ◽  
Vol 48 (7) ◽  
pp. 757-758
Author(s):  
B Kolman ◽  
R E Beck ◽  
M J Panik
Keyword(s):  
Linear Programming

Optimal approaches to manage power system decarbonation

2020 ◽  
Vol 64 (1-4) ◽  
pp. 1447-1452
Author(s):  
Vincent Mazauric ◽  
Ariane Millot ◽  
Claude Le Pape-Gardeux ◽  
Nadia Maïzi
Keyword(s):  
Free Energy ◽  
Linear Programming ◽  
Phase Transitions ◽  
Power System ◽  
Energy System ◽  
Energy Sources ◽  
Low Carbon ◽  
Faraday’S Law ◽  
Optimal Description ◽  
Low Carbon Technologies

To overcome the negative environemental impact of the actual power system, an optimal description of quasi-static electromagnetics relying on a reversible interpretation of the Faraday’s law is given. Due to the overabundance of carbon-free energy sources, this description makes it possible to consider an evolution towards an energy system favoring low-carbon technologies. The management for changing is then explored through a simplified linear-programming problem and an analogy with phase transitions in physics is drawn.

Sign in / Sign up

Export Citation Format

Share Document