Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Programming, Linear”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Improving Mathematical Exposition of an Industrial-Scale Linear Program

Industrial-scale models require considerable setup time; hence, once built, they are used in myriad ways to consider closely related cases. In practice, the code for these models frequently evolves without appropriate notational choices, largely as a result of the lengthy development time of, and the number of individuals contributing to, their formulation. This leads to inefficiencies and obfuscates model structures that might be leveraged to expedite solutions. In this paper, we advocate for an emerging literature on model formulation “best practices” and present the reformulation of a widely used industrial-scale linear program. The efficient mathematical expression of this linear program, used to plan capacity expansion in the energy sector, allows for greater transparency of model structures and enhanced ability to identify computational performance improvements, as well as a lucid interpretation of its solutions. This type of formulation is employed in several mathematical programming courses at our university as an example of the advantages of best practices; the model more broadly is used widely to inform policy in the U.S. energy sector.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1985

A non-linear programming approach to the computer-aided design of regulators using a linear-quadratic formulation

A design technique is proposed for linear regulators in which a feedback controller of fixed structure is chosen to minimize an integral quadratic objective function subject to the satisfaction of integral quadratic constraint functions. Application of a non-linear programming algorithm to this mathematically tractable formulation results in an efficient and useful computer-aided design tool. Particular attention is paid to computational efficiency and various recommendations are made. Two design examples illustrate the flexibility of the approach and highlight the special insight afforded to the designer.

Fleming, P.↗
DOE OSTI2021

Tuning successive linear programming to solve AC optimal power flow problem for large networks

Successive linear programming (SLP) is a practical approach for solving large-scale nonlinear optimization problems. Alternating current optimal power flow (ACOPF) is no exception, particularly the large size of real-world networks. However, in order to achieve tractability, it is essential to tune the SLP algorithm presented in the literature. This paper presents a modified SLP algorithm to solve the ACOPF problem, specified by the U.S. Department of Energy’s (DOE) Grid Optimization (GO) Competition Challenge 1, within strict time limits. The algorithm first finds a near-optimal solution for the relaxed problem (i.e., Stage 1). Then, it finds a feasible solution in the proximity of the near-optimal solution (i.e., Stage 2 and Stage 3). The numerical experiments on test cases ranging from 500-bus to 30,000-bus systems show that the algorithm is tractable. Here the results show that our proposed algorithm is tractable and can solve more than 80% of test cases faster than the well-known Interior Point Method while significantly reduce the number of iterations required to solve ACOPF. The number of iterations is considered an important factor in the examination of tractability which can drastically reduce the computational time required within each iteration.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1972

Automated design and optimization of flexible booster autopilots via linear programming, volume 1

A nonlinear programming technique was developed for the automated design and optimization of autopilots for large flexible launch vehicles. This technique, which resulted in the COEBRA program, uses the iterative application of linear programming. The method deals directly with the three main requirements of booster autopilot design: to provide (1) good response to guidance commands; (2) response to external disturbances (e.g. wind) to minimize structural bending moment loads and trajectory dispersions; and (3) stability with specified tolerances on the vehicle and flight control system parameters. The method is applicable to very high order systems (30th and greater per flight condition). Examples are provided that demonstrate the successful application of the employed algorithm to the design of autopilots for both single and multiple flight conditions.

Hauser, F. D.↗
DOE OSTI2025

Optimal sizing of battery energy storage systems for peak shaving and demand response using a degradation-aware Bayesian Optimization-Mixed-Integer Linear Programming framework

The increasing integration of renewable energy and rising electricity demand highlight the importance of battery energy storage systems for peak shaving and demand response. Unlike prior approaches that overlook operational impacts on degradation, this study proposes a Bayesian Optimization–Mixed Integer Linear Programming framework for optimal battery energy storage system sizing. In this framework, Mixed Integer Linear Programming determines short-term scheduling while a calibrated electrochemical model iteratively evaluates degradation. The central hypothesis is that the framework can efficiently identify optimal sizes that yield realistic and economically robust outcomes. The method is tested across three scenarios: peak shaving, peak shaving with energy-reduction demand response, and peak shaving with power-reduction demand response. Results show that the framework converge to the optimum within 20 iterations out of 150 possible sizes. Under baseline conditions, the framework consistently selects the smallest feasible system, minimizing unnecessary degradation costs from oversized storage. Sensitivity analyses reveal that larger systems are favored as demand rates or incentives increase. Comparisons of demand response programs indicate that power-reduction demand response offers greater economic benefits than energy-reduction demand response, although demand savings from peak shaving remain the dominant contributor to overall performance. This study demonstrates that the proposed framework balances computational tractability with degradation fidelity, identifies critical economic thresholds for investment, and offers a practical, flexible tool to guide industrial stakeholders in cost-effective battery energy storage system deployment.

Batteries↗
DOE OSTI2025

Two-Stage Distributionally Robust Conic Linear Programming over 1-Wasserstein Balls

Here, this paper studies two-stage distributionally robust conic linear programming under constraint uncertainty over type-1 Wasserstein balls. We present optimality conditions for the dual of the worst-case expectation problem, which characterizes worst-case uncertain parameters for its inner maximization problem. This condition offers an alternative proof, a counterexample, and an extension to previous works. Additionally, the condition highlights the potential advantage of a specific distance metric for out-of-sample performance, as exemplified in a numerical study on a facility location problem with demand uncertainty. Furthermore, cutting-plane-based algorithms, equipped with a unified scenario generation framework, are proposed for addressing both unbounded support and second-stage dual feasible regions, with a finite convergence proof under less stringent assumptions.

Wasserstein↗
DOE OSTI2024

A mixed integer linear programming approach for the design of chemical process families

Tackling climate change goals requires widespread deployment of process technology variants across many decentralized sites with different geographical, environmental, and operational requirements. Conventional engineering approaches focus on unique designs for each installation (process variant), while missing opportunities for manufacturing standardization. Here, instead we seek to optimize a process platform of common unit designs while simultaneously designing an entire family of process variants that make use of that platform. This reduces engineering effort, deployment timelines, and manufacturing costs. We propose a nonlinear generalized disjunctive programming formulation and convert this to an efficient mixed-integer linear programming (MILP) formulation through discretization of the design space. We formulate our optimization in Pyomo with costing from IDAES, and we demonstrate the computational performance and solution quality on a water treatment desalination system from the PARETO framework and a carbon capture system built in Aspen Plus as part of CCSI2.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1989

An algorithm for the solution of dynamic linear programs

The algorithm's objective is to efficiently solve Dynamic Linear Programs (DLP) by taking advantage of their special staircase structure. This algorithm constitutes a stepping stone to an improved algorithm for solving Dynamic Quadratic Programs, which, in turn, would make the nonlinear programming method of Successive Quadratic Programs more practical for solving trajectory optimization problems. The ultimate goal is to being trajectory optimization solution speeds into the realm of real-time control. The algorithm exploits the staircase nature of the large constraint matrix of the equality-constrained DLPs encountered when solving inequality-constrained DLPs by an active set approach. A numerically-stable, staircase QL factorization of the staircase constraint matrix is carried out starting from its last rows and columns. The resulting recursion is like the time-varying Riccati equation from multi-stage LQR theory. The resulting factorization increases the efficiency of all of the typical LP solution operations over that of a dense matrix LP code. At the same time numerical stability is ensured. The algorithm also takes advantage of dynamic programming ideas about the cost-to-go by relaxing active pseudo constraints in a backwards sweeping process. This further decreases the cost per update of the LP rank-1 updating procedure, although it may result in more changes of the active set that if pseudo constraints were relaxed in a non-stagewise fashion. The usual stability of closed-loop Linear/Quadratic optimally-controlled systems, if it carries over to strictly linear cost functions, implies that the saving due to reduced factor update effort may outweigh the cost of an increased number of updates. An aerospace example is presented in which a ground-to-ground rocket's distance is maximized. This example demonstrates the applicability of this class of algorithms to aerospace guidance. It also sheds light on the efficacy of the proposed pseudo constraint relaxation scheme.

Psiaki, Mark L.↗
NASA NTRS2009

Sensitivity Analysis of Linear Programming and Quadratic Programming Algorithms for Control Allocation

The Next Generation (NextGen) transport aircraft configurations being investigated as part of the NASA Aeronautics Subsonic Fixed Wing Project have more control surfaces, or control effectors, than existing transport aircraft configurations. Conventional flight control is achieved through two symmetric elevators, two antisymmetric ailerons, and a rudder. The five effectors, reduced to three command variables, produce moments along the three main axes of the aircraft and enable the pilot to control the attitude and flight path of the aircraft. The NextGen aircraft will have additional redundant control effectors to control the three moments, creating a situation where the aircraft is over-actuated and where a simple relationship does not exist anymore between the required effector deflections and the desired moments. NextGen flight controllers will incorporate control allocation algorithms to determine the optimal effector commands and attain the desired moments, taking into account the effector limits. Approaches to solving the problem using linear programming and quadratic programming algorithms have been proposed and tested. It is of great interest to understand their relative advantages and disadvantages and how design parameters may affect their properties. In this paper, we investigate the sensitivity of the effector commands with respect to the desired moments and show on some examples that the solutions provided using the l2 norm of quadratic programming are less sensitive than those using the l1 norm of linear programming.

Frost, Susan A.↗
NASA NTRS1985

Development and validation of a general purpose linearization program for rigid aircraft models

This paper discusses a FORTRAN program that provides the user with a powerful and flexible tool for the linearization of aircraft models. The program LINEAR numerically determines a linear systems model using nonlinear equations of motion and a user-supplied, nonlinear aerodynamic model. The system model determined by LINEAR consists of matrices for both the state and observation equations. The program has been designed to allow easy selection and definition of the state, control, and observation variables to be used in a particular model. Also, included in the report is a comparison of linear and nonlinear models for a high-performance aircraft.

Duke, E. L.↗
NASA NTRS1992

Fault detection and initial state verification by linear programming for a class of Petri nets

The authors present an algorithmic approach to determining when the marking of a LSMG (live safe marked graph) or a LSFC (live safe free choice) net is in the set of live safe markings M. Hence, once the marking of a net is determined to be in M, then if at some time thereafter the marking of this net is determined not to be in M, this indicates a fault. It is shown how linear programming can be used to determine if m is an element of M. The worst-case computational complexity of each algorithm is bounded by the number of linear programs necessary to compute.

Rachell, Traxon↗
NASA NTRS2022

Foraging with MUSHROOMS: A Mixed-integer Linear Programming Scheduler for Multimessenger Target of Opportunity Searches with the Zwicky Transient Facility

Electromagnetic follow-up of gravitational-wave detections is very resource intensive, taking up hours of limited observation time on dozens of telescopes. Creating more efficient schedules for follow-up will lead to a commensurate increase in counterpart location efficiency without using more telescope time. Widely used in operations research and telescope scheduling, mixed-integer linear programming is a strong candidate to produce these higher-efficiency schedules, as it can make use of powerful commercial solvers that find globally optimal solutions to provided problems. We detail a new target-of-opportunity scheduling algorithm designed with Zwicky Transient Facility in mind that uses mixed-integer linear programming. We compare its performance to gwemopt, the tuned heuristic scheduler used by the Zwicky Transient Facility and other facilities during the third LIGO–Virgo gravitational-wave observing run. This new algorithm uses variable-length observing blocks to enforce cadence requirements and to ensure field observability, along with having a secondary optimization step to minimize slew time. We show that by employing a hybrid method utilizing both this scheduler and gwemopt, the previous scheduler used, in concert, we can achieve an average improvement in detection efficiency of 3%–11% over gwemopt alone for a simulated binary neutron star merger data set consistent with LIGO–Virgo's third observing run, highlighting the potential of mixed-integer target of opportunity schedulers for future multimessenger follow-up surveys.

B Parazin↗
NASA NTRS1991

A linear programming approach to characterizing norm bounded uncertainty from experimental data

The linear programming spectral overbounding and factorization (LPSOF) algorithm, an algorithm for finding a minimum phase transfer function of specified order whose magnitude tightly overbounds a specified nonparametric function of frequency, is introduced. This method has direct application to transforming nonparametric uncertainty bounds (available from system identification experiments) into parametric representations required for modern robust control design software (i.e., a minimum-phase transfer function multiplied by a norm-bounded perturbation).

Scheid, R. E.↗
NASA NTRS1985

Development and validation of a general purpose linearization program for rigid aircraft models

A FORTRAN program that provides the user with a powerful and flexible tool for the linearization of aircraft models is discussed. The program LINEAR numerically determines a linear systems model using nonlinear equations of motion and a user-supplied, nonlinear aerodynamic model. The system model determined by LINEAR consists of matrices for both the state and observation equations. The program has been designed to allow easy selection and definition of the state, control, and observation variables to be used in a particular model. Also, included in the report is a comparison of linear and nonlinear models for a high performance aircraft.

Duke, E. L.↗
NASA NTRS1973

An application of a linear programing technique to nonlinear minimax problems

A differential correction technique for solving nonlinear minimax problems is presented. The basis of the technique is a linear programing algorithm which solves the linear minimax problem. By linearizing the original nonlinear equations about a nominal solution, both nonlinear approximation and estimation problems using the minimax norm may be solved iteratively. Some consideration is also given to improving convergence and to the treatment of problems with more than one measured quantity. A sample problem is treated with this technique and with the least-squares differential correction method to illustrate the properties of the minimax solution. The results indicate that for the sample approximation problem, the minimax technique provides better estimates than the least-squares method if a sufficient amount of data is used. For the sample estimation problem, the minimax estimates are better if the mathematical model is incomplete.

Schiess, J. R.↗
NASA NTRS1994

A scalable parallel algorithm for multiple objective linear programs

This paper presents an ADBASE-based parallel algorithm for solving multiple objective linear programs (MOLP's). Job balance, speedup and scalability are of primary interest in evaluating efficiency of the new algorithm. Implementation results on Intel iPSC/2 and Paragon multiprocessors show that the algorithm significantly speeds up the process of solving MOLP's, which is understood as generating all or some efficient extreme points and unbounded efficient edges. The algorithm gives specially good results for large and very large problems. Motivation and justification for solving such large MOLP's are also included.

Wiecek, Malgorzata M.↗
DOE OSTI2025

Alternative mixed integer linear programming optimization for joint job scheduling and data allocation in grid computing

This paper presents a novel approach to the joint optimization of job scheduling and data allocation in grid computing environments. We formulate this joint optimization problem as a mixed integer quadratically constrained program. To tackle the nonlinearity in the constraint, we alternatively fix a subset of decision variables and optimize the remaining ones via Mixed Integer Linear Programming (MILP). We solve the MILP problem at each iteration via an off-the-shelf MILP solver. Our experimental results show that our method significantly outperforms existing heuristic methods, employing either independent optimization or joint optimization strategies. We have also verified the generalization ability of our method over grid environments with various sizes and its high robustness to the algorithm setting.

97 MATHEMATICS AND COMPUTING↗