Brinkhuis, Jan; Protasov, Vladimir A new proof of the Lagrange multiplier rule. (English) Zbl 1408.90280 Oper. Res. Lett. 44, No. 3, 400-402 (2016). MSC: 90C30 90C46 PDFBibTeX XMLCite \textit{J. Brinkhuis} and \textit{V. Protasov}, Oper. Res. Lett. 44, No. 3, 400--402 (2016; Zbl 1408.90280) Full Text: DOI Link
Vásquez, Óscar C. On the complexity of the single machine scheduling problem minimizing total weighted delay penalty. (English) Zbl 1408.90143 Oper. Res. Lett. 42, No. 5, 343-347 (2014). MSC: 90B35 68Q25 90C60 PDFBibTeX XMLCite \textit{Ó. C. Vásquez}, Oper. Res. Lett. 42, No. 5, 343--347 (2014; Zbl 1408.90143) Full Text: DOI
Contaldi, G.; Di Pillo, G.; Lucidi, S. A continuously differentiable exact penalty function for nonlinear programming problems with unbounded feasible set. (English) Zbl 0806.90112 Oper. Res. Lett. 14, No. 3, 153-161 (1993). Reviewer: D.I.Duca (Cluj-Napoca) MSC: 90C30 PDFBibTeX XMLCite \textit{G. Contaldi} et al., Oper. Res. Lett. 14, No. 3, 153--161 (1993; Zbl 0806.90112) Full Text: DOI
Tseng, Paul A simple complexity proof for a polynomial-time linear programming algorithm. (English) Zbl 0682.90059 Oper. Res. Lett. 8, No. 3, 155-159 (1989). Reviewer: M.A.Hanson MSC: 90C05 68Q25 49M30 PDFBibTeX XMLCite \textit{P. Tseng}, Oper. Res. Lett. 8, No. 3, 155--159 (1989; Zbl 0682.90059) Full Text: DOI
Weistroffer, H. R. Multiple criteria decision making with interactive over-achievement programming. (English) Zbl 0511.90089 Oper. Res. Lett. 1, 241-245 (1982). MSC: 90C31 PDFBibTeX XMLCite \textit{H. R. Weistroffer}, Oper. Res. Lett. 1, 241--245 (1982; Zbl 0511.90089) Full Text: DOI
Lasserre, J. B. An economic interpretation of exact penalty functions using sensitivity analysis. (English) Zbl 0494.90065 Oper. Res. Lett. 1, 39-40 (1981). MSC: 90C30 91B99 90C90 PDFBibTeX XMLCite \textit{J. B. Lasserre}, Oper. Res. Lett. 1, 39--40 (1981; Zbl 0494.90065) Full Text: DOI